./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/ldv-validator-v0.6/linux-stable-9ec4f65-1-110_1a-drivers--rtc--rtc-tegra.ko-entry_point.cil.out.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 8fc3dc66 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/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/ldv-validator-v0.6/linux-stable-9ec4f65-1-110_1a-drivers--rtc--rtc-tegra.ko-entry_point.cil.out.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-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 valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 440f273968b34677cc4ba81db9f48373d3cac4b8a75ac1f970ae3fdbbff89c17 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 13:27:28,628 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 13:27:28,681 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf [2025-03-17 13:27:28,687 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 13:27:28,687 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 13:27:28,704 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 13:27:28,705 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 13:27:28,705 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 13:27:28,706 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 13:27:28,706 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 13:27:28,706 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 13:27:28,707 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 13:27:28,707 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 13:27:28,707 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 13:27:28,707 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 13:27:28,707 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 13:27:28,707 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 13:27:28,708 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 13:27:28,708 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-17 13:27:28,708 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-17 13:27:28,708 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-17 13:27:28,708 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 13:27:28,708 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-17 13:27:28,708 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-17 13:27:28,708 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 13:27:28,708 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 13:27:28,708 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 13:27:28,708 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 13:27:28,708 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 13:27:28,708 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 13:27:28,709 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 13:27:28,709 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 13:27:28,709 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 13:27:28,709 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 13:27:28,709 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 13:27:28,709 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 13:27:28,709 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 13:27:28,709 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 13:27:28,710 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 13:27:28,710 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 valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) 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 -> 440f273968b34677cc4ba81db9f48373d3cac4b8a75ac1f970ae3fdbbff89c17 [2025-03-17 13:27:28,922 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 13:27:28,927 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 13:27:28,929 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 13:27:28,930 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 13:27:28,930 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 13:27:28,932 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-validator-v0.6/linux-stable-9ec4f65-1-110_1a-drivers--rtc--rtc-tegra.ko-entry_point.cil.out.i [2025-03-17 13:27:30,066 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e55fab65a/9e96ea2e93724f1bb1449b72ad357043/FLAG94d3281f2 [2025-03-17 13:27:30,375 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 13:27:30,378 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-validator-v0.6/linux-stable-9ec4f65-1-110_1a-drivers--rtc--rtc-tegra.ko-entry_point.cil.out.i [2025-03-17 13:27:30,396 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e55fab65a/9e96ea2e93724f1bb1449b72ad357043/FLAG94d3281f2 [2025-03-17 13:27:30,406 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e55fab65a/9e96ea2e93724f1bb1449b72ad357043 [2025-03-17 13:27:30,408 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 13:27:30,410 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 13:27:30,412 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 13:27:30,412 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 13:27:30,415 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 13:27:30,416 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 01:27:30" (1/1) ... [2025-03-17 13:27:30,417 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@28577a14 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:27:30, skipping insertion in model container [2025-03-17 13:27:30,418 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 01:27:30" (1/1) ... [2025-03-17 13:27:30,458 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 13:27:30,767 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-17 13:27:30,770 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-17 13:27:30,775 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-17 13:27:30,775 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-17 13:27:30,776 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-17 13:27:30,778 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-17 13:27:30,779 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-17 13:27:30,785 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-17 13:27:30,785 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-17 13:27:30,788 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-17 13:27:30,791 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-17 13:27:30,791 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-17 13:27:30,794 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-17 13:27:30,797 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-17 13:27:30,800 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-17 13:27:30,811 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-17 13:27:30,812 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-17 13:27:30,812 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-17 13:27:30,822 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-17 13:27:30,831 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-17 13:27:30,832 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-17 13:27:30,832 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-17 13:27:30,833 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-17 13:27:30,834 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-17 13:27:30,834 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-17 13:27:30,837 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-17 13:27:30,839 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-17 13:27:30,839 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-17 13:27:30,839 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-17 13:27:30,842 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-17 13:27:30,844 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-17 13:27:30,856 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-17 13:27:30,856 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-17 13:27:30,857 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-17 13:27:30,857 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-17 13:27:30,860 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-17 13:27:30,861 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-17 13:27:30,871 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-17 13:27:30,891 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-17 13:27:30,892 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 13:27:30,908 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 13:27:31,036 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 13:27:31,062 INFO L204 MainTranslator]: Completed translation [2025-03-17 13:27:31,063 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:27:31 WrapperNode [2025-03-17 13:27:31,063 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 13:27:31,064 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 13:27:31,064 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 13:27:31,064 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 13:27:31,069 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:27:31" (1/1) ... [2025-03-17 13:27:31,092 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:27:31" (1/1) ... [2025-03-17 13:27:31,121 INFO L138 Inliner]: procedures = 118, calls = 369, calls flagged for inlining = 54, calls inlined = 37, statements flattened = 914 [2025-03-17 13:27:31,122 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 13:27:31,122 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 13:27:31,122 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 13:27:31,122 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 13:27:31,129 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:27:31" (1/1) ... [2025-03-17 13:27:31,129 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:27:31" (1/1) ... [2025-03-17 13:27:31,136 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:27:31" (1/1) ... [2025-03-17 13:27:31,173 INFO L175 MemorySlicer]: Split 91 memory accesses to 9 slices as follows [2, 26, 10, 3, 12, 2, 10, 22, 4]. 29 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0, 0, 0, 0, 0, 0]. The 50 writes are split as follows [0, 1, 3, 2, 12, 0, 9, 22, 1]. [2025-03-17 13:27:31,173 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:27:31" (1/1) ... [2025-03-17 13:27:31,173 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:27:31" (1/1) ... [2025-03-17 13:27:31,192 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:27:31" (1/1) ... [2025-03-17 13:27:31,194 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:27:31" (1/1) ... [2025-03-17 13:27:31,204 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:27:31" (1/1) ... [2025-03-17 13:27:31,210 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:27:31" (1/1) ... [2025-03-17 13:27:31,228 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 13:27:31,229 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 13:27:31,229 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 13:27:31,229 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 13:27:31,230 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:27:31" (1/1) ... [2025-03-17 13:27:31,235 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 13:27:31,266 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 13:27:31,281 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-17 13:27:31,284 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-17 13:27:31,301 INFO L130 BoogieDeclarations]: Found specification of procedure dev_get_drvdata [2025-03-17 13:27:31,302 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_get_drvdata [2025-03-17 13:27:31,302 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#0 [2025-03-17 13:27:31,302 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#1 [2025-03-17 13:27:31,302 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#2 [2025-03-17 13:27:31,302 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#3 [2025-03-17 13:27:31,302 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#4 [2025-03-17 13:27:31,302 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#5 [2025-03-17 13:27:31,302 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#6 [2025-03-17 13:27:31,302 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#7 [2025-03-17 13:27:31,302 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#8 [2025-03-17 13:27:31,302 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#0 [2025-03-17 13:27:31,302 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#1 [2025-03-17 13:27:31,302 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#2 [2025-03-17 13:27:31,302 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#3 [2025-03-17 13:27:31,302 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#4 [2025-03-17 13:27:31,302 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#5 [2025-03-17 13:27:31,302 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#6 [2025-03-17 13:27:31,302 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#7 [2025-03-17 13:27:31,302 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#8 [2025-03-17 13:27:31,302 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2025-03-17 13:27:31,302 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2025-03-17 13:27:31,302 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-17 13:27:31,302 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-17 13:27:31,302 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-17 13:27:31,302 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-17 13:27:31,302 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-03-17 13:27:31,302 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-03-17 13:27:31,302 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-03-17 13:27:31,303 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2025-03-17 13:27:31,303 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2025-03-17 13:27:31,303 INFO L130 BoogieDeclarations]: Found specification of procedure rtc_time_to_tm [2025-03-17 13:27:31,303 INFO L138 BoogieDeclarations]: Found implementation of procedure rtc_time_to_tm [2025-03-17 13:27:31,303 INFO L130 BoogieDeclarations]: Found specification of procedure tegra_rtc_proc [2025-03-17 13:27:31,303 INFO L138 BoogieDeclarations]: Found implementation of procedure tegra_rtc_proc [2025-03-17 13:27:31,303 INFO L130 BoogieDeclarations]: Found specification of procedure irq_set_irq_wake [2025-03-17 13:27:31,303 INFO L138 BoogieDeclarations]: Found implementation of procedure irq_set_irq_wake [2025-03-17 13:27:31,303 INFO L130 BoogieDeclarations]: Found specification of procedure outer_sync [2025-03-17 13:27:31,303 INFO L138 BoogieDeclarations]: Found implementation of procedure outer_sync [2025-03-17 13:27:31,303 INFO L130 BoogieDeclarations]: Found specification of procedure tegra_rtc_remove [2025-03-17 13:27:31,303 INFO L138 BoogieDeclarations]: Found implementation of procedure tegra_rtc_remove [2025-03-17 13:27:31,303 INFO L130 BoogieDeclarations]: Found specification of procedure tegra_rtc_shutdown [2025-03-17 13:27:31,303 INFO L138 BoogieDeclarations]: Found implementation of procedure tegra_rtc_shutdown [2025-03-17 13:27:31,303 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2025-03-17 13:27:31,303 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2025-03-17 13:27:31,303 INFO L130 BoogieDeclarations]: Found specification of procedure rtc_tm_to_time [2025-03-17 13:27:31,303 INFO L138 BoogieDeclarations]: Found implementation of procedure rtc_tm_to_time [2025-03-17 13:27:31,303 INFO L130 BoogieDeclarations]: Found specification of procedure __release_region [2025-03-17 13:27:31,303 INFO L138 BoogieDeclarations]: Found implementation of procedure __release_region [2025-03-17 13:27:31,303 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2025-03-17 13:27:31,303 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2025-03-17 13:27:31,303 INFO L130 BoogieDeclarations]: Found specification of procedure tegra_rtc_set_alarm [2025-03-17 13:27:31,303 INFO L138 BoogieDeclarations]: Found implementation of procedure tegra_rtc_set_alarm [2025-03-17 13:27:31,303 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-17 13:27:31,303 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-17 13:27:31,303 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-17 13:27:31,303 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-17 13:27:31,309 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-03-17 13:27:31,309 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-03-17 13:27:31,309 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-03-17 13:27:31,309 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2025-03-17 13:27:31,309 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2025-03-17 13:27:31,309 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2025-03-17 13:27:31,309 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2025-03-17 13:27:31,309 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_lock_check [2025-03-17 13:27:31,309 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_lock_check [2025-03-17 13:27:31,309 INFO L130 BoogieDeclarations]: Found specification of procedure tegra_rtc_alarm_irq_enable [2025-03-17 13:27:31,309 INFO L138 BoogieDeclarations]: Found implementation of procedure tegra_rtc_alarm_irq_enable [2025-03-17 13:27:31,309 INFO L130 BoogieDeclarations]: Found specification of procedure tegra_iounmap [2025-03-17 13:27:31,309 INFO L138 BoogieDeclarations]: Found implementation of procedure tegra_iounmap [2025-03-17 13:27:31,309 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 13:27:31,309 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 13:27:31,309 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-17 13:27:31,309 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 13:27:31,309 INFO L130 BoogieDeclarations]: Found specification of procedure rtc_device_unregister [2025-03-17 13:27:31,309 INFO L138 BoogieDeclarations]: Found implementation of procedure rtc_device_unregister [2025-03-17 13:27:31,309 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-17 13:27:31,309 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_irq_1 [2025-03-17 13:27:31,309 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_irq_1 [2025-03-17 13:27:31,309 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-17 13:27:31,309 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-17 13:27:31,309 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-17 13:27:31,310 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-03-17 13:27:31,310 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2025-03-17 13:27:31,310 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2025-03-17 13:27:31,310 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2025-03-17 13:27:31,310 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#7 [2025-03-17 13:27:31,310 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#8 [2025-03-17 13:27:31,310 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_err [2025-03-17 13:27:31,310 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_err [2025-03-17 13:27:31,310 INFO L130 BoogieDeclarations]: Found specification of procedure device_may_wakeup [2025-03-17 13:27:31,310 INFO L138 BoogieDeclarations]: Found implementation of procedure device_may_wakeup [2025-03-17 13:27:31,310 INFO L130 BoogieDeclarations]: Found specification of procedure spin_unlock_irqrestore [2025-03-17 13:27:31,310 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_unlock_irqrestore [2025-03-17 13:27:31,310 INFO L130 BoogieDeclarations]: Found specification of procedure platform_get_resource [2025-03-17 13:27:31,310 INFO L138 BoogieDeclarations]: Found implementation of procedure platform_get_resource [2025-03-17 13:27:31,310 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-17 13:27:31,310 INFO L130 BoogieDeclarations]: Found specification of procedure platform_set_drvdata [2025-03-17 13:27:31,310 INFO L138 BoogieDeclarations]: Found implementation of procedure platform_set_drvdata [2025-03-17 13:27:31,310 INFO L130 BoogieDeclarations]: Found specification of procedure platform_get_drvdata [2025-03-17 13:27:31,310 INFO L138 BoogieDeclarations]: Found implementation of procedure platform_get_drvdata [2025-03-17 13:27:31,311 INFO L130 BoogieDeclarations]: Found specification of procedure dev_err [2025-03-17 13:27:31,311 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_err [2025-03-17 13:27:31,311 INFO L130 BoogieDeclarations]: Found specification of procedure tegra_rtc_read_time [2025-03-17 13:27:31,311 INFO L138 BoogieDeclarations]: Found implementation of procedure tegra_rtc_read_time [2025-03-17 13:27:31,311 INFO L130 BoogieDeclarations]: Found specification of procedure tegra_rtc_wait_while_busy [2025-03-17 13:27:31,311 INFO L138 BoogieDeclarations]: Found implementation of procedure tegra_rtc_wait_while_busy [2025-03-17 13:27:31,311 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 13:27:31,311 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-17 13:27:31,311 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-17 13:27:31,311 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-17 13:27:31,311 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-17 13:27:31,311 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-03-17 13:27:31,311 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-03-17 13:27:31,311 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-03-17 13:27:31,311 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-03-17 13:27:31,311 INFO L130 BoogieDeclarations]: Found specification of procedure resource_size [2025-03-17 13:27:31,311 INFO L138 BoogieDeclarations]: Found implementation of procedure resource_size [2025-03-17 13:27:31,311 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2025-03-17 13:27:31,312 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2025-03-17 13:27:31,312 INFO L130 BoogieDeclarations]: Found specification of procedure tegra_rtc_set_time [2025-03-17 13:27:31,312 INFO L138 BoogieDeclarations]: Found implementation of procedure tegra_rtc_set_time [2025-03-17 13:27:31,312 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 13:27:31,312 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 13:27:31,542 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 13:27:31,545 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 13:27:31,583 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2807: havoc #t~ret273.base, #t~ret273.offset; [2025-03-17 13:27:31,695 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2025-03-17 13:27:31,745 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1788: havoc dev_name_#t~mem58#1.base, dev_name_#t~mem58#1.offset; [2025-03-17 13:27:31,745 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2886: havoc seq_printf_#t~nondet288#1; [2025-03-17 13:27:31,745 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1602: havoc kobject_name_#t~mem10#1.base, kobject_name_#t~mem10#1.offset; [2025-03-17 13:27:31,748 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2826: havoc #t~nondet277; [2025-03-17 13:27:31,828 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1779: havoc #t~mem52;havoc #t~mem53.base, #t~mem53.offset;havoc #t~short54; [2025-03-17 13:27:31,852 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2875: havoc #t~nondet286; [2025-03-17 13:27:31,855 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2858: havoc #t~ret283.base, #t~ret283.offset; [2025-03-17 13:27:31,863 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2815: havoc dev_set_drvdata_#t~nondet275#1; [2025-03-17 13:27:31,917 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1989: call ULTIMATE.dealloc(~#sec~3.base, ~#sec~3.offset);havoc ~#sec~3.base, ~#sec~3.offset; [2025-03-17 13:27:31,920 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2804: havoc #t~nondet272; [2025-03-17 13:27:32,018 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1770: havoc #t~mem42;havoc #t~mem43; [2025-03-17 13:27:32,058 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1903: call ULTIMATE.dealloc(~#sec~1#1.base, ~#sec~1#1.offset);havoc ~#sec~1#1.base, ~#sec~1#1.offset; [2025-03-17 13:27:32,058 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2882: havoc rtc_valid_tm_#t~nondet287#1; [2025-03-17 13:27:36,355 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2844: havoc ldv_release_3_#t~nondet280#1; [2025-03-17 13:27:36,355 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2402: call ULTIMATE.dealloc(main_~#ldvarg2~0#1.base, main_~#ldvarg2~0#1.offset);havoc main_~#ldvarg2~0#1.base, main_~#ldvarg2~0#1.offset; [2025-03-17 13:27:36,355 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2848: havoc platform_driver_probe_#t~nondet281#1; [2025-03-17 13:27:36,355 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2836: havoc ldv_probe_2_#t~nondet278#1; [2025-03-17 13:27:36,355 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2840: havoc ldv_probe_3_#t~nondet279#1; [2025-03-17 13:27:36,465 INFO L? ?]: Removed 502 outVars from TransFormulas that were not future-live. [2025-03-17 13:27:36,465 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 13:27:36,499 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 13:27:36,504 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 13:27:36,504 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 01:27:36 BoogieIcfgContainer [2025-03-17 13:27:36,504 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 13:27:36,506 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 13:27:36,507 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 13:27:36,510 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 13:27:36,510 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 01:27:30" (1/3) ... [2025-03-17 13:27:36,511 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47ae64cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 01:27:36, skipping insertion in model container [2025-03-17 13:27:36,511 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:27:31" (2/3) ... [2025-03-17 13:27:36,511 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47ae64cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 01:27:36, skipping insertion in model container [2025-03-17 13:27:36,511 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 01:27:36" (3/3) ... [2025-03-17 13:27:36,512 INFO L128 eAbstractionObserver]: Analyzing ICFG linux-stable-9ec4f65-1-110_1a-drivers--rtc--rtc-tegra.ko-entry_point.cil.out.i [2025-03-17 13:27:36,522 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 13:27:36,525 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG linux-stable-9ec4f65-1-110_1a-drivers--rtc--rtc-tegra.ko-entry_point.cil.out.i that has 33 procedures, 564 locations, 1 initial locations, 1 loop locations, and 111 error locations. [2025-03-17 13:27:36,569 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 13:27:36,602 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=None, 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;@759bf979, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 13:27:36,603 INFO L334 AbstractCegarLoop]: Starting to check reachability of 111 error locations. [2025-03-17 13:27:36,607 INFO L276 IsEmpty]: Start isEmpty. Operand has 563 states, 340 states have (on average 1.6147058823529412) internal successors, (549), 460 states have internal predecessors, (549), 80 states have call successors, (80), 32 states have call predecessors, (80), 31 states have return successors, (74), 74 states have call predecessors, (74), 74 states have call successors, (74) [2025-03-17 13:27:36,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-17 13:27:36,612 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 13:27:36,613 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 13:27:36,613 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_DEREFERENCE === [ldv_irq_1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_irq_1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_irq_1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 108 more)] === [2025-03-17 13:27:36,616 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:27:36,617 INFO L85 PathProgramCache]: Analyzing trace with hash 638038161, now seen corresponding path program 1 times [2025-03-17 13:27:36,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:27:36,623 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1784697304] [2025-03-17 13:27:36,624 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:27:36,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:27:36,758 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-17 13:27:36,835 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-17 13:27:36,836 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:27:36,836 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:27:37,166 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-17 13:27:37,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:27:37,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1784697304] [2025-03-17 13:27:37,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1784697304] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 13:27:37,167 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 13:27:37,167 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 13:27:37,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [640081634] [2025-03-17 13:27:37,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 13:27:37,172 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 13:27:37,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:27:37,191 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 13:27:37,192 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 13:27:37,194 INFO L87 Difference]: Start difference. First operand has 563 states, 340 states have (on average 1.6147058823529412) internal successors, (549), 460 states have internal predecessors, (549), 80 states have call successors, (80), 32 states have call predecessors, (80), 31 states have return successors, (74), 74 states have call predecessors, (74), 74 states have call successors, (74) Second operand has 5 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 13:27:41,211 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-17 13:27:45,220 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-17 13:27:46,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 13:27:46,542 INFO L93 Difference]: Finished difference Result 892 states and 1197 transitions. [2025-03-17 13:27:46,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 13:27:46,544 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 8 [2025-03-17 13:27:46,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 13:27:46,561 INFO L225 Difference]: With dead ends: 892 [2025-03-17 13:27:46,561 INFO L226 Difference]: Without dead ends: 878 [2025-03-17 13:27:46,563 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-17 13:27:46,567 INFO L435 NwaCegarLoop]: 509 mSDtfsCounter, 473 mSDsluCounter, 1092 mSDsCounter, 0 mSdLazyCounter, 1115 mSolverCounterSat, 156 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 494 SdHoareTripleChecker+Valid, 1601 SdHoareTripleChecker+Invalid, 1273 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 156 IncrementalHoareTripleChecker+Valid, 1115 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.2s IncrementalHoareTripleChecker+Time [2025-03-17 13:27:46,568 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [494 Valid, 1601 Invalid, 1273 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [156 Valid, 1115 Invalid, 2 Unknown, 0 Unchecked, 9.2s Time] [2025-03-17 13:27:46,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 878 states. [2025-03-17 13:27:46,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 878 to 788. [2025-03-17 13:27:46,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 788 states, 526 states have (on average 1.6159695817490494) internal successors, (850), 640 states have internal predecessors, (850), 110 states have call successors, (110), 31 states have call predecessors, (110), 41 states have return successors, (166), 120 states have call predecessors, (166), 109 states have call successors, (166) [2025-03-17 13:27:46,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 1126 transitions. [2025-03-17 13:27:46,664 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 1126 transitions. Word has length 8 [2025-03-17 13:27:46,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 13:27:46,664 INFO L471 AbstractCegarLoop]: Abstraction has 788 states and 1126 transitions. [2025-03-17 13:27:46,664 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 13:27:46,664 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 1126 transitions. [2025-03-17 13:27:46,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-03-17 13:27:46,665 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 13:27:46,665 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 13:27:46,665 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-17 13:27:46,665 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_DEREFERENCE === [ldv_irq_1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_irq_1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_irq_1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 108 more)] === [2025-03-17 13:27:46,666 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:27:46,666 INFO L85 PathProgramCache]: Analyzing trace with hash -1695652774, now seen corresponding path program 1 times [2025-03-17 13:27:46,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:27:46,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [960324781] [2025-03-17 13:27:46,667 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:27:46,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:27:46,756 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-17 13:27:46,783 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-17 13:27:46,783 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:27:46,783 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:27:47,054 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-17 13:27:47,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:27:47,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [960324781] [2025-03-17 13:27:47,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [960324781] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 13:27:47,055 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 13:27:47,055 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 13:27:47,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [782734592] [2025-03-17 13:27:47,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 13:27:47,056 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 13:27:47,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:27:47,057 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 13:27:47,057 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 13:27:47,058 INFO L87 Difference]: Start difference. First operand 788 states and 1126 transitions. Second operand has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 13:27:51,067 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-17 13:27:55,071 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-17 13:27:56,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 13:27:56,136 INFO L93 Difference]: Finished difference Result 1159 states and 1716 transitions. [2025-03-17 13:27:56,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 13:27:56,137 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 9 [2025-03-17 13:27:56,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 13:27:56,144 INFO L225 Difference]: With dead ends: 1159 [2025-03-17 13:27:56,146 INFO L226 Difference]: Without dead ends: 1159 [2025-03-17 13:27:56,146 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-17 13:27:56,147 INFO L435 NwaCegarLoop]: 518 mSDtfsCounter, 465 mSDsluCounter, 1124 mSDsCounter, 0 mSdLazyCounter, 1120 mSolverCounterSat, 143 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 488 SdHoareTripleChecker+Valid, 1642 SdHoareTripleChecker+Invalid, 1265 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 143 IncrementalHoareTripleChecker+Valid, 1120 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.0s IncrementalHoareTripleChecker+Time [2025-03-17 13:27:56,147 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [488 Valid, 1642 Invalid, 1265 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [143 Valid, 1120 Invalid, 2 Unknown, 0 Unchecked, 9.0s Time] [2025-03-17 13:27:56,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1159 states. [2025-03-17 13:27:56,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1159 to 1090. [2025-03-17 13:27:56,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1090 states, 775 states have (on average 1.6529032258064515) internal successors, (1281), 892 states have internal predecessors, (1281), 162 states have call successors, (162), 31 states have call predecessors, (162), 42 states have return successors, (264), 172 states have call predecessors, (264), 161 states have call successors, (264) [2025-03-17 13:27:56,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1090 states to 1090 states and 1707 transitions. [2025-03-17 13:27:56,202 INFO L78 Accepts]: Start accepts. Automaton has 1090 states and 1707 transitions. Word has length 9 [2025-03-17 13:27:56,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 13:27:56,203 INFO L471 AbstractCegarLoop]: Abstraction has 1090 states and 1707 transitions. [2025-03-17 13:27:56,203 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 13:27:56,203 INFO L276 IsEmpty]: Start isEmpty. Operand 1090 states and 1707 transitions. [2025-03-17 13:27:56,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-03-17 13:27:56,204 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 13:27:56,204 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 13:27:56,204 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 13:27:56,205 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ldv_irq_1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_irq_1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_irq_1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 108 more)] === [2025-03-17 13:27:56,205 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:27:56,205 INFO L85 PathProgramCache]: Analyzing trace with hash -961972250, now seen corresponding path program 1 times [2025-03-17 13:27:56,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:27:56,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [631500055] [2025-03-17 13:27:56,205 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:27:56,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:27:56,259 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-17 13:27:56,270 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-17 13:27:56,270 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:27:56,270 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:27:56,345 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-17 13:27:56,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:27:56,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [631500055] [2025-03-17 13:27:56,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [631500055] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 13:27:56,345 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 13:27:56,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 13:27:56,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1527851421] [2025-03-17 13:27:56,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 13:27:56,346 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 13:27:56,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:27:56,346 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 13:27:56,346 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 13:27:56,346 INFO L87 Difference]: Start difference. First operand 1090 states and 1707 transitions. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 13:28:00,353 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-17 13:28:00,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 13:28:00,421 INFO L93 Difference]: Finished difference Result 2138 states and 3343 transitions. [2025-03-17 13:28:00,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 13:28:00,422 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2025-03-17 13:28:00,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 13:28:00,432 INFO L225 Difference]: With dead ends: 2138 [2025-03-17 13:28:00,432 INFO L226 Difference]: Without dead ends: 2138 [2025-03-17 13:28:00,432 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-17 13:28:00,433 INFO L435 NwaCegarLoop]: 679 mSDtfsCounter, 643 mSDsluCounter, 665 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 3 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 643 SdHoareTripleChecker+Valid, 1344 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2025-03-17 13:28:00,433 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [643 Valid, 1344 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 16 Invalid, 1 Unknown, 0 Unchecked, 4.0s Time] [2025-03-17 13:28:00,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2138 states. [2025-03-17 13:28:00,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2138 to 2026. [2025-03-17 13:28:00,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2026 states, 1518 states have (on average 1.652832674571805) internal successors, (2509), 1642 states have internal predecessors, (2509), 315 states have call successors, (315), 60 states have call predecessors, (315), 82 states have return successors, (515), 335 states have call predecessors, (515), 314 states have call successors, (515) [2025-03-17 13:28:00,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2026 states to 2026 states and 3339 transitions. [2025-03-17 13:28:00,524 INFO L78 Accepts]: Start accepts. Automaton has 2026 states and 3339 transitions. Word has length 18 [2025-03-17 13:28:00,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 13:28:00,525 INFO L471 AbstractCegarLoop]: Abstraction has 2026 states and 3339 transitions. [2025-03-17 13:28:00,525 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 13:28:00,525 INFO L276 IsEmpty]: Start isEmpty. Operand 2026 states and 3339 transitions. [2025-03-17 13:28:00,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-03-17 13:28:00,529 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 13:28:00,530 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 13:28:00,530 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 13:28:00,530 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_DEREFERENCE === [ldv_irq_1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_irq_1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_irq_1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 108 more)] === [2025-03-17 13:28:00,530 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:28:00,530 INFO L85 PathProgramCache]: Analyzing trace with hash -169089303, now seen corresponding path program 1 times [2025-03-17 13:28:00,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:28:00,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842206235] [2025-03-17 13:28:00,530 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:28:00,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:28:00,585 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-17 13:28:00,643 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-17 13:28:00,643 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:28:00,643 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:28:00,915 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-17 13:28:00,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:28:00,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1842206235] [2025-03-17 13:28:00,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1842206235] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 13:28:00,916 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 13:28:00,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 13:28:00,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1861915189] [2025-03-17 13:28:00,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 13:28:00,916 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 13:28:00,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:28:00,917 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 13:28:00,917 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-17 13:28:00,917 INFO L87 Difference]: Start difference. First operand 2026 states and 3339 transitions. Second operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-17 13:28:04,923 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-17 13:28:08,930 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-17 13:28:12,945 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-17 13:28:14,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 13:28:14,306 INFO L93 Difference]: Finished difference Result 2580 states and 4303 transitions. [2025-03-17 13:28:14,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 13:28:14,306 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 24 [2025-03-17 13:28:14,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 13:28:14,316 INFO L225 Difference]: With dead ends: 2580 [2025-03-17 13:28:14,317 INFO L226 Difference]: Without dead ends: 2580 [2025-03-17 13:28:14,317 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-17 13:28:14,317 INFO L435 NwaCegarLoop]: 552 mSDtfsCounter, 807 mSDsluCounter, 1254 mSDsCounter, 0 mSdLazyCounter, 1404 mSolverCounterSat, 301 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 847 SdHoareTripleChecker+Valid, 1806 SdHoareTripleChecker+Invalid, 1708 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 301 IncrementalHoareTripleChecker+Valid, 1404 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.3s IncrementalHoareTripleChecker+Time [2025-03-17 13:28:14,318 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [847 Valid, 1806 Invalid, 1708 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [301 Valid, 1404 Invalid, 3 Unknown, 0 Unchecked, 13.3s Time] [2025-03-17 13:28:14,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2580 states. [2025-03-17 13:28:14,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2580 to 2083. [2025-03-17 13:28:14,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2083 states, 1564 states have (on average 1.6508951406649617) internal successors, (2582), 1689 states have internal predecessors, (2582), 319 states have call successors, (319), 60 states have call predecessors, (319), 90 states have return successors, (611), 345 states have call predecessors, (611), 318 states have call successors, (611) [2025-03-17 13:28:14,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2083 states to 2083 states and 3512 transitions. [2025-03-17 13:28:14,375 INFO L78 Accepts]: Start accepts. Automaton has 2083 states and 3512 transitions. Word has length 24 [2025-03-17 13:28:14,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 13:28:14,375 INFO L471 AbstractCegarLoop]: Abstraction has 2083 states and 3512 transitions. [2025-03-17 13:28:14,375 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-17 13:28:14,375 INFO L276 IsEmpty]: Start isEmpty. Operand 2083 states and 3512 transitions. [2025-03-17 13:28:14,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-03-17 13:28:14,376 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 13:28:14,376 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 13:28:14,376 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 13:28:14,376 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ldv_irq_1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_irq_1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_irq_1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 108 more)] === [2025-03-17 13:28:14,377 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:28:14,377 INFO L85 PathProgramCache]: Analyzing trace with hash 1539519190, now seen corresponding path program 1 times [2025-03-17 13:28:14,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:28:14,377 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1905422241] [2025-03-17 13:28:14,377 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:28:14,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:28:14,449 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-17 13:28:14,461 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-17 13:28:14,463 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:28:14,463 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:28:14,617 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-17 13:28:14,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:28:14,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1905422241] [2025-03-17 13:28:14,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1905422241] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 13:28:14,618 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 13:28:14,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 13:28:14,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1230458143] [2025-03-17 13:28:14,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 13:28:14,618 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 13:28:14,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:28:14,619 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 13:28:14,619 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 13:28:14,619 INFO L87 Difference]: Start difference. First operand 2083 states and 3512 transitions. Second operand has 5 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 13:28:18,625 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-17 13:28:22,629 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-17 13:28:23,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 13:28:23,564 INFO L93 Difference]: Finished difference Result 2445 states and 4099 transitions. [2025-03-17 13:28:23,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 13:28:23,564 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2025-03-17 13:28:23,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 13:28:23,574 INFO L225 Difference]: With dead ends: 2445 [2025-03-17 13:28:23,574 INFO L226 Difference]: Without dead ends: 2443 [2025-03-17 13:28:23,574 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 13:28:23,575 INFO L435 NwaCegarLoop]: 687 mSDtfsCounter, 446 mSDsluCounter, 1367 mSDsCounter, 0 mSdLazyCounter, 1199 mSolverCounterSat, 128 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 467 SdHoareTripleChecker+Valid, 2054 SdHoareTripleChecker+Invalid, 1329 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 128 IncrementalHoareTripleChecker+Valid, 1199 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.9s IncrementalHoareTripleChecker+Time [2025-03-17 13:28:23,575 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [467 Valid, 2054 Invalid, 1329 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [128 Valid, 1199 Invalid, 2 Unknown, 0 Unchecked, 8.9s Time] [2025-03-17 13:28:23,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2443 states. [2025-03-17 13:28:23,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2443 to 2371. [2025-03-17 13:28:23,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2371 states, 1803 states have (on average 1.6572379367720467) internal successors, (2988), 1930 states have internal predecessors, (2988), 368 states have call successors, (368), 60 states have call predecessors, (368), 90 states have return successors, (723), 394 states have call predecessors, (723), 367 states have call successors, (723) [2025-03-17 13:28:23,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2371 states to 2371 states and 4079 transitions. [2025-03-17 13:28:23,651 INFO L78 Accepts]: Start accepts. Automaton has 2371 states and 4079 transitions. Word has length 22 [2025-03-17 13:28:23,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 13:28:23,651 INFO L471 AbstractCegarLoop]: Abstraction has 2371 states and 4079 transitions. [2025-03-17 13:28:23,651 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 13:28:23,651 INFO L276 IsEmpty]: Start isEmpty. Operand 2371 states and 4079 transitions. [2025-03-17 13:28:23,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-03-17 13:28:23,653 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 13:28:23,653 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 13:28:23,653 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 13:28:23,653 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_DEREFERENCE === [ldv_irq_1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_irq_1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_irq_1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 108 more)] === [2025-03-17 13:28:23,654 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:28:23,654 INFO L85 PathProgramCache]: Analyzing trace with hash -946800382, now seen corresponding path program 1 times [2025-03-17 13:28:23,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:28:23,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1782410247] [2025-03-17 13:28:23,654 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:28:23,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:28:23,704 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-17 13:28:23,718 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-17 13:28:23,718 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:28:23,718 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:28:24,052 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-17 13:28:24,052 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:28:24,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1782410247] [2025-03-17 13:28:24,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1782410247] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 13:28:24,052 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 13:28:24,052 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 13:28:24,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1481863057] [2025-03-17 13:28:24,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 13:28:24,053 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 13:28:24,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:28:24,053 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 13:28:24,053 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-17 13:28:24,053 INFO L87 Difference]: Start difference. First operand 2371 states and 4079 transitions. Second operand has 7 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-17 13:28:28,060 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-17 13:28:32,073 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-17 13:28:36,081 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-17 13:28:37,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 13:28:37,671 INFO L93 Difference]: Finished difference Result 4028 states and 7176 transitions. [2025-03-17 13:28:37,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 13:28:37,672 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 25 [2025-03-17 13:28:37,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 13:28:37,687 INFO L225 Difference]: With dead ends: 4028 [2025-03-17 13:28:37,688 INFO L226 Difference]: Without dead ends: 4028 [2025-03-17 13:28:37,688 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-03-17 13:28:37,688 INFO L435 NwaCegarLoop]: 566 mSDtfsCounter, 1056 mSDsluCounter, 1674 mSDsCounter, 0 mSdLazyCounter, 1889 mSolverCounterSat, 249 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1105 SdHoareTripleChecker+Valid, 2240 SdHoareTripleChecker+Invalid, 2141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 249 IncrementalHoareTripleChecker+Valid, 1889 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.5s IncrementalHoareTripleChecker+Time [2025-03-17 13:28:37,689 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1105 Valid, 2240 Invalid, 2141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [249 Valid, 1889 Invalid, 3 Unknown, 0 Unchecked, 13.5s Time] [2025-03-17 13:28:37,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4028 states. [2025-03-17 13:28:37,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4028 to 3886. [2025-03-17 13:28:37,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3886 states, 3052 states have (on average 1.6847968545216252) internal successors, (5142), 3188 states have internal predecessors, (5142), 629 states have call successors, (629), 60 states have call predecessors, (629), 96 states have return successors, (1377), 661 states have call predecessors, (1377), 628 states have call successors, (1377) [2025-03-17 13:28:37,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3886 states to 3886 states and 7148 transitions. [2025-03-17 13:28:37,790 INFO L78 Accepts]: Start accepts. Automaton has 3886 states and 7148 transitions. Word has length 25 [2025-03-17 13:28:37,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 13:28:37,790 INFO L471 AbstractCegarLoop]: Abstraction has 3886 states and 7148 transitions. [2025-03-17 13:28:37,791 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-17 13:28:37,791 INFO L276 IsEmpty]: Start isEmpty. Operand 3886 states and 7148 transitions. [2025-03-17 13:28:37,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-03-17 13:28:37,791 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 13:28:37,791 INFO L218 NwaCegarLoop]: trace histogram [1, 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-17 13:28:37,792 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 13:28:37,792 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting tegra_rtc_procErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ldv_irq_1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_irq_1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_irq_1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 108 more)] === [2025-03-17 13:28:37,792 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:28:37,792 INFO L85 PathProgramCache]: Analyzing trace with hash -291879968, now seen corresponding path program 1 times [2025-03-17 13:28:37,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:28:37,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [442325845] [2025-03-17 13:28:37,792 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:28:37,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:28:37,840 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-17 13:28:37,849 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-17 13:28:37,849 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:28:37,849 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:28:37,877 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-17 13:28:37,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:28:37,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [442325845] [2025-03-17 13:28:37,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [442325845] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 13:28:37,877 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 13:28:37,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 13:28:37,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [337526037] [2025-03-17 13:28:37,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 13:28:37,878 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 13:28:37,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:28:37,878 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 13:28:37,878 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 13:28:37,881 INFO L87 Difference]: Start difference. First operand 3886 states and 7148 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 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-17 13:28:37,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 13:28:37,911 INFO L93 Difference]: Finished difference Result 2396 states and 4206 transitions. [2025-03-17 13:28:37,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 13:28:37,912 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 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 25 [2025-03-17 13:28:37,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 13:28:37,920 INFO L225 Difference]: With dead ends: 2396 [2025-03-17 13:28:37,921 INFO L226 Difference]: Without dead ends: 2396 [2025-03-17 13:28:37,921 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-17 13:28:37,921 INFO L435 NwaCegarLoop]: 421 mSDtfsCounter, 418 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 418 SdHoareTripleChecker+Valid, 421 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 13:28:37,922 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [418 Valid, 421 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 13:28:37,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2396 states. [2025-03-17 13:28:37,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2396 to 2396. [2025-03-17 13:28:37,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2396 states, 1862 states have (on average 1.5198711063372718) internal successors, (2830), 1918 states have internal predecessors, (2830), 407 states have call successors, (407), 48 states have call predecessors, (407), 78 states have return successors, (969), 433 states have call predecessors, (969), 406 states have call successors, (969) [2025-03-17 13:28:38,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2396 states to 2396 states and 4206 transitions. [2025-03-17 13:28:38,004 INFO L78 Accepts]: Start accepts. Automaton has 2396 states and 4206 transitions. Word has length 25 [2025-03-17 13:28:38,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 13:28:38,004 INFO L471 AbstractCegarLoop]: Abstraction has 2396 states and 4206 transitions. [2025-03-17 13:28:38,004 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 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-17 13:28:38,004 INFO L276 IsEmpty]: Start isEmpty. Operand 2396 states and 4206 transitions. [2025-03-17 13:28:38,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-03-17 13:28:38,005 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 13:28:38,005 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 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-17 13:28:38,005 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 13:28:38,005 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_irq_1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ldv_irq_1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_irq_1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_irq_1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 108 more)] === [2025-03-17 13:28:38,006 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:28:38,006 INFO L85 PathProgramCache]: Analyzing trace with hash 1406870411, now seen corresponding path program 1 times [2025-03-17 13:28:38,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:28:38,006 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [882951474] [2025-03-17 13:28:38,006 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:28:38,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:28:38,056 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-17 13:28:38,065 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-17 13:28:38,065 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:28:38,065 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:28:38,153 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-17 13:28:38,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:28:38,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [882951474] [2025-03-17 13:28:38,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [882951474] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 13:28:38,153 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 13:28:38,153 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 13:28:38,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [857554921] [2025-03-17 13:28:38,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 13:28:38,154 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 13:28:38,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:28:38,154 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 13:28:38,154 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 13:28:38,155 INFO L87 Difference]: Start difference. First operand 2396 states and 4206 transitions. Second operand has 5 states, 5 states have (on average 4.8) internal successors, (24), 4 states have internal predecessors, (24), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-17 13:28:38,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 13:28:38,236 INFO L93 Difference]: Finished difference Result 4796 states and 8544 transitions. [2025-03-17 13:28:38,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 13:28:38,237 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 4 states have internal predecessors, (24), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 31 [2025-03-17 13:28:38,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 13:28:38,263 INFO L225 Difference]: With dead ends: 4796 [2025-03-17 13:28:38,263 INFO L226 Difference]: Without dead ends: 4796 [2025-03-17 13:28:38,264 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-03-17 13:28:38,264 INFO L435 NwaCegarLoop]: 482 mSDtfsCounter, 422 mSDsluCounter, 1362 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 423 SdHoareTripleChecker+Valid, 1844 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 13:28:38,264 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [423 Valid, 1844 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 13:28:38,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4796 states. [2025-03-17 13:28:38,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4796 to 4657. [2025-03-17 13:28:38,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4657 states, 3638 states have (on average 1.5299615173172072) internal successors, (5566), 3783 states have internal predecessors, (5566), 812 states have call successors, (812), 97 states have call predecessors, (812), 158 states have return successors, (2076), 784 states have call predecessors, (2076), 811 states have call successors, (2076) [2025-03-17 13:28:38,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4657 states to 4657 states and 8454 transitions. [2025-03-17 13:28:38,415 INFO L78 Accepts]: Start accepts. Automaton has 4657 states and 8454 transitions. Word has length 31 [2025-03-17 13:28:38,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 13:28:38,415 INFO L471 AbstractCegarLoop]: Abstraction has 4657 states and 8454 transitions. [2025-03-17 13:28:38,415 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 4 states have internal predecessors, (24), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-17 13:28:38,415 INFO L276 IsEmpty]: Start isEmpty. Operand 4657 states and 8454 transitions. [2025-03-17 13:28:38,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-03-17 13:28:38,416 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 13:28:38,416 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 13:28:38,417 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-17 13:28:38,417 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_irq_1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ldv_irq_1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_irq_1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_irq_1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 108 more)] === [2025-03-17 13:28:38,417 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:28:38,418 INFO L85 PathProgramCache]: Analyzing trace with hash -1938268146, now seen corresponding path program 1 times [2025-03-17 13:28:38,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:28:38,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1969120166] [2025-03-17 13:28:38,419 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:28:38,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:28:38,468 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-17 13:28:38,477 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-17 13:28:38,477 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:28:38,477 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:28:38,540 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-17 13:28:38,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:28:38,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1969120166] [2025-03-17 13:28:38,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1969120166] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 13:28:38,540 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 13:28:38,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 13:28:38,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1242162943] [2025-03-17 13:28:38,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 13:28:38,541 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 13:28:38,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:28:38,541 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 13:28:38,541 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 13:28:38,541 INFO L87 Difference]: Start difference. First operand 4657 states and 8454 transitions. Second operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 states have internal predecessors, (26), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-17 13:28:38,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 13:28:38,608 INFO L93 Difference]: Finished difference Result 4681 states and 8382 transitions. [2025-03-17 13:28:38,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 13:28:38,609 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 states have internal predecessors, (26), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 33 [2025-03-17 13:28:38,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 13:28:38,629 INFO L225 Difference]: With dead ends: 4681 [2025-03-17 13:28:38,630 INFO L226 Difference]: Without dead ends: 4681 [2025-03-17 13:28:38,630 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-03-17 13:28:38,630 INFO L435 NwaCegarLoop]: 419 mSDtfsCounter, 416 mSDsluCounter, 825 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 417 SdHoareTripleChecker+Valid, 1244 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 13:28:38,630 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [417 Valid, 1244 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 13:28:38,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4681 states. [2025-03-17 13:28:38,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4681 to 4647. [2025-03-17 13:28:38,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4647 states, 3646 states have (on average 1.5255074053757542) internal successors, (5562), 3771 states have internal predecessors, (5562), 792 states have call successors, (792), 99 states have call predecessors, (792), 160 states have return successors, (1976), 784 states have call predecessors, (1976), 791 states have call successors, (1976) [2025-03-17 13:28:38,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4647 states to 4647 states and 8330 transitions. [2025-03-17 13:28:38,802 INFO L78 Accepts]: Start accepts. Automaton has 4647 states and 8330 transitions. Word has length 33 [2025-03-17 13:28:38,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 13:28:38,803 INFO L471 AbstractCegarLoop]: Abstraction has 4647 states and 8330 transitions. [2025-03-17 13:28:38,803 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 states have internal predecessors, (26), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-17 13:28:38,803 INFO L276 IsEmpty]: Start isEmpty. Operand 4647 states and 8330 transitions. [2025-03-17 13:28:38,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-03-17 13:28:38,804 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 13:28:38,804 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 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-17 13:28:38,804 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-17 13:28:38,804 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_irq_1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ldv_irq_1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_irq_1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_irq_1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 108 more)] === [2025-03-17 13:28:38,805 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:28:38,805 INFO L85 PathProgramCache]: Analyzing trace with hash -782141788, now seen corresponding path program 1 times [2025-03-17 13:28:38,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:28:38,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1307931311] [2025-03-17 13:28:38,805 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:28:38,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:28:38,852 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-17 13:28:38,860 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-17 13:28:38,860 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:28:38,860 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:28:38,927 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-17 13:28:38,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:28:38,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1307931311] [2025-03-17 13:28:38,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1307931311] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 13:28:38,928 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 13:28:38,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 13:28:38,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1350984545] [2025-03-17 13:28:38,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 13:28:38,928 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 13:28:38,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:28:38,929 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 13:28:38,929 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 13:28:38,929 INFO L87 Difference]: Start difference. First operand 4647 states and 8330 transitions. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 4 states have internal predecessors, (25), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-17 13:28:38,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 13:28:38,993 INFO L93 Difference]: Finished difference Result 4671 states and 8258 transitions. [2025-03-17 13:28:38,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 13:28:38,993 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 4 states have internal predecessors, (25), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 32 [2025-03-17 13:28:38,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 13:28:39,006 INFO L225 Difference]: With dead ends: 4671 [2025-03-17 13:28:39,006 INFO L226 Difference]: Without dead ends: 4671 [2025-03-17 13:28:39,006 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-03-17 13:28:39,007 INFO L435 NwaCegarLoop]: 418 mSDtfsCounter, 416 mSDsluCounter, 823 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 417 SdHoareTripleChecker+Valid, 1241 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 13:28:39,007 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [417 Valid, 1241 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 13:28:39,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4671 states. [2025-03-17 13:28:39,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4671 to 4637. [2025-03-17 13:28:39,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4637 states, 3654 states have (on average 1.5210727969348659) internal successors, (5558), 3759 states have internal predecessors, (5558), 772 states have call successors, (772), 101 states have call predecessors, (772), 162 states have return successors, (1876), 784 states have call predecessors, (1876), 771 states have call successors, (1876) [2025-03-17 13:28:39,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4637 states to 4637 states and 8206 transitions. [2025-03-17 13:28:39,157 INFO L78 Accepts]: Start accepts. Automaton has 4637 states and 8206 transitions. Word has length 32 [2025-03-17 13:28:39,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 13:28:39,158 INFO L471 AbstractCegarLoop]: Abstraction has 4637 states and 8206 transitions. [2025-03-17 13:28:39,159 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 4 states have internal predecessors, (25), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-17 13:28:39,159 INFO L276 IsEmpty]: Start isEmpty. Operand 4637 states and 8206 transitions. [2025-03-17 13:28:39,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-03-17 13:28:39,160 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 13:28:39,160 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 13:28:39,160 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-17 13:28:39,160 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_irq_1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ldv_irq_1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_irq_1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_irq_1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 108 more)] === [2025-03-17 13:28:39,161 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:28:39,161 INFO L85 PathProgramCache]: Analyzing trace with hash -1139704505, now seen corresponding path program 1 times [2025-03-17 13:28:39,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:28:39,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [615837286] [2025-03-17 13:28:39,161 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:28:39,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:28:39,240 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-17 13:28:39,256 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-17 13:28:39,258 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:28:39,258 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:28:39,336 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-17 13:28:39,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:28:39,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [615837286] [2025-03-17 13:28:39,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [615837286] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 13:28:39,336 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 13:28:39,337 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 13:28:39,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1026752260] [2025-03-17 13:28:39,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 13:28:39,337 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 13:28:39,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:28:39,337 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 13:28:39,337 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 13:28:39,337 INFO L87 Difference]: Start difference. First operand 4637 states and 8206 transitions. Second operand has 5 states, 5 states have (on average 5.4) internal successors, (27), 4 states have internal predecessors, (27), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-17 13:28:39,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 13:28:39,419 INFO L93 Difference]: Finished difference Result 4515 states and 7916 transitions. [2025-03-17 13:28:39,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 13:28:39,420 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 4 states have internal predecessors, (27), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 34 [2025-03-17 13:28:39,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 13:28:39,434 INFO L225 Difference]: With dead ends: 4515 [2025-03-17 13:28:39,434 INFO L226 Difference]: Without dead ends: 4515 [2025-03-17 13:28:39,434 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-03-17 13:28:39,435 INFO L435 NwaCegarLoop]: 415 mSDtfsCounter, 429 mSDsluCounter, 821 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 430 SdHoareTripleChecker+Valid, 1236 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 13:28:39,435 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [430 Valid, 1236 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 13:28:39,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4515 states. [2025-03-17 13:28:39,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4515 to 4475. [2025-03-17 13:28:39,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4475 states, 3534 states have (on average 1.518958687040181) internal successors, (5368), 3615 states have internal predecessors, (5368), 734 states have call successors, (734), 101 states have call predecessors, (734), 158 states have return successors, (1752), 762 states have call predecessors, (1752), 733 states have call successors, (1752) [2025-03-17 13:28:39,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4475 states to 4475 states and 7854 transitions. [2025-03-17 13:28:39,559 INFO L78 Accepts]: Start accepts. Automaton has 4475 states and 7854 transitions. Word has length 34 [2025-03-17 13:28:39,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 13:28:39,560 INFO L471 AbstractCegarLoop]: Abstraction has 4475 states and 7854 transitions. [2025-03-17 13:28:39,560 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 4 states have internal predecessors, (27), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-17 13:28:39,560 INFO L276 IsEmpty]: Start isEmpty. Operand 4475 states and 7854 transitions. [2025-03-17 13:28:39,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-03-17 13:28:39,561 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 13:28:39,561 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-17 13:28:39,561 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-17 13:28:39,561 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ldv_irq_1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_irq_1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_irq_1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 108 more)] === [2025-03-17 13:28:39,562 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:28:39,562 INFO L85 PathProgramCache]: Analyzing trace with hash 137411186, now seen corresponding path program 1 times [2025-03-17 13:28:39,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:28:39,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1297629816] [2025-03-17 13:28:39,562 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:28:39,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:28:39,642 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-17 13:28:39,655 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-17 13:28:39,657 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:28:39,657 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:28:39,691 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-17 13:28:39,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:28:39,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1297629816] [2025-03-17 13:28:39,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1297629816] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 13:28:39,692 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 13:28:39,692 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 13:28:39,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [543059958] [2025-03-17 13:28:39,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 13:28:39,692 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 13:28:39,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:28:39,692 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 13:28:39,692 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 13:28:39,692 INFO L87 Difference]: Start difference. First operand 4475 states and 7854 transitions. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-17 13:28:39,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 13:28:39,729 INFO L93 Difference]: Finished difference Result 4478 states and 7838 transitions. [2025-03-17 13:28:39,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 13:28:39,729 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 44 [2025-03-17 13:28:39,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 13:28:39,742 INFO L225 Difference]: With dead ends: 4478 [2025-03-17 13:28:39,742 INFO L226 Difference]: Without dead ends: 4478 [2025-03-17 13:28:39,742 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-17 13:28:39,743 INFO L435 NwaCegarLoop]: 422 mSDtfsCounter, 415 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 415 SdHoareTripleChecker+Valid, 424 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 13:28:39,743 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [415 Valid, 424 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 13:28:39,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4478 states. [2025-03-17 13:28:39,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4478 to 4475. [2025-03-17 13:28:39,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4475 states, 3534 states have (on average 1.5138653084323712) internal successors, (5350), 3615 states have internal predecessors, (5350), 734 states have call successors, (734), 101 states have call predecessors, (734), 158 states have return successors, (1752), 762 states have call predecessors, (1752), 733 states have call successors, (1752) [2025-03-17 13:28:39,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4475 states to 4475 states and 7836 transitions. [2025-03-17 13:28:39,853 INFO L78 Accepts]: Start accepts. Automaton has 4475 states and 7836 transitions. Word has length 44 [2025-03-17 13:28:39,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 13:28:39,853 INFO L471 AbstractCegarLoop]: Abstraction has 4475 states and 7836 transitions. [2025-03-17 13:28:39,854 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-17 13:28:39,854 INFO L276 IsEmpty]: Start isEmpty. Operand 4475 states and 7836 transitions. [2025-03-17 13:28:39,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-03-17 13:28:39,855 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 13:28:39,855 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 13:28:39,855 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-17 13:28:39,855 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting device_may_wakeupErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ldv_irq_1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_irq_1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_irq_1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 108 more)] === [2025-03-17 13:28:39,856 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:28:39,856 INFO L85 PathProgramCache]: Analyzing trace with hash -1444580009, now seen corresponding path program 1 times [2025-03-17 13:28:39,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:28:39,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477346473] [2025-03-17 13:28:39,856 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:28:39,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:28:39,906 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-17 13:28:39,914 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-17 13:28:39,914 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:28:39,914 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:28:39,950 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-17 13:28:39,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:28:39,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1477346473] [2025-03-17 13:28:39,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1477346473] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 13:28:39,951 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 13:28:39,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 13:28:39,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1814861896] [2025-03-17 13:28:39,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 13:28:39,952 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 13:28:39,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:28:39,952 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 13:28:39,952 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 13:28:39,953 INFO L87 Difference]: Start difference. First operand 4475 states and 7836 transitions. Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-17 13:28:40,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 13:28:40,018 INFO L93 Difference]: Finished difference Result 6045 states and 10184 transitions. [2025-03-17 13:28:40,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 13:28:40,018 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 40 [2025-03-17 13:28:40,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 13:28:40,034 INFO L225 Difference]: With dead ends: 6045 [2025-03-17 13:28:40,034 INFO L226 Difference]: Without dead ends: 6045 [2025-03-17 13:28:40,034 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-17 13:28:40,035 INFO L435 NwaCegarLoop]: 422 mSDtfsCounter, 179 mSDsluCounter, 385 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 807 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 13:28:40,035 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [179 Valid, 807 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 13:28:40,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6045 states. [2025-03-17 13:28:40,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6045 to 6027. [2025-03-17 13:28:40,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6027 states, 4909 states have (on average 1.5009166836422896) internal successors, (7368), 5017 states have internal predecessors, (7368), 871 states have call successors, (871), 130 states have call predecessors, (871), 198 states have return successors, (1939), 887 states have call predecessors, (1939), 870 states have call successors, (1939) [2025-03-17 13:28:40,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6027 states to 6027 states and 10178 transitions. [2025-03-17 13:28:40,152 INFO L78 Accepts]: Start accepts. Automaton has 6027 states and 10178 transitions. Word has length 40 [2025-03-17 13:28:40,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 13:28:40,152 INFO L471 AbstractCegarLoop]: Abstraction has 6027 states and 10178 transitions. [2025-03-17 13:28:40,152 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-17 13:28:40,152 INFO L276 IsEmpty]: Start isEmpty. Operand 6027 states and 10178 transitions. [2025-03-17 13:28:40,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-03-17 13:28:40,154 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 13:28:40,154 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-17 13:28:40,154 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-17 13:28:40,154 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ldv_irq_1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_irq_1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_irq_1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 108 more)] === [2025-03-17 13:28:40,155 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:28:40,155 INFO L85 PathProgramCache]: Analyzing trace with hash -1199739090, now seen corresponding path program 1 times [2025-03-17 13:28:40,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:28:40,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1897311333] [2025-03-17 13:28:40,155 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:28:40,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:28:40,210 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-17 13:28:40,237 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-17 13:28:40,237 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:28:40,237 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:28:40,359 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-17 13:28:40,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:28:40,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1897311333] [2025-03-17 13:28:40,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1897311333] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 13:28:40,360 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 13:28:40,360 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 13:28:40,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1827825489] [2025-03-17 13:28:40,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 13:28:40,360 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 13:28:40,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:28:40,361 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 13:28:40,361 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 13:28:40,361 INFO L87 Difference]: Start difference. First operand 6027 states and 10178 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-17 13:28:40,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 13:28:40,432 INFO L93 Difference]: Finished difference Result 6029 states and 10180 transitions. [2025-03-17 13:28:40,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 13:28:40,433 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 38 [2025-03-17 13:28:40,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 13:28:40,447 INFO L225 Difference]: With dead ends: 6029 [2025-03-17 13:28:40,447 INFO L226 Difference]: Without dead ends: 6029 [2025-03-17 13:28:40,447 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 13:28:40,448 INFO L435 NwaCegarLoop]: 417 mSDtfsCounter, 2 mSDsluCounter, 831 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1248 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 13:28:40,448 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1248 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 13:28:40,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6029 states. [2025-03-17 13:28:40,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6029 to 6029. [2025-03-17 13:28:40,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6029 states, 4911 states have (on average 1.5007126858073712) internal successors, (7370), 5019 states have internal predecessors, (7370), 871 states have call successors, (871), 130 states have call predecessors, (871), 198 states have return successors, (1939), 887 states have call predecessors, (1939), 870 states have call successors, (1939) [2025-03-17 13:28:40,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6029 states to 6029 states and 10180 transitions. [2025-03-17 13:28:40,557 INFO L78 Accepts]: Start accepts. Automaton has 6029 states and 10180 transitions. Word has length 38 [2025-03-17 13:28:40,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 13:28:40,557 INFO L471 AbstractCegarLoop]: Abstraction has 6029 states and 10180 transitions. [2025-03-17 13:28:40,557 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-17 13:28:40,557 INFO L276 IsEmpty]: Start isEmpty. Operand 6029 states and 10180 transitions. [2025-03-17 13:28:40,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-03-17 13:28:40,558 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 13:28:40,558 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-17 13:28:40,558 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-17 13:28:40,558 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ldv_irq_1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_irq_1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_irq_1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 108 more)] === [2025-03-17 13:28:40,559 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:28:40,559 INFO L85 PathProgramCache]: Analyzing trace with hash -1754621976, now seen corresponding path program 1 times [2025-03-17 13:28:40,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:28:40,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253883313] [2025-03-17 13:28:40,559 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:28:40,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:28:40,606 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-17 13:28:40,620 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-17 13:28:40,621 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:28:40,621 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:28:40,742 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-17 13:28:40,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:28:40,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [253883313] [2025-03-17 13:28:40,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [253883313] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 13:28:40,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1924276058] [2025-03-17 13:28:40,743 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:28:40,743 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 13:28:40,743 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 13:28:40,781 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-17 13:28:40,783 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-17 13:28:41,070 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-17 13:28:41,215 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-17 13:28:41,215 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:28:41,215 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:28:41,220 INFO L256 TraceCheckSpWp]: Trace formula consists of 593 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-17 13:28:41,225 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 13:28:41,257 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-17 13:28:41,259 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 13:28:41,343 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-17 13:28:41,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1924276058] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 13:28:41,343 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 13:28:41,343 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2025-03-17 13:28:41,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1455214667] [2025-03-17 13:28:41,344 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 13:28:41,344 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 13:28:41,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:28:41,344 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 13:28:41,344 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2025-03-17 13:28:41,345 INFO L87 Difference]: Start difference. First operand 6029 states and 10180 transitions. Second operand has 9 states, 9 states have (on average 3.888888888888889) internal successors, (35), 9 states have internal predecessors, (35), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-17 13:28:41,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 13:28:41,422 INFO L93 Difference]: Finished difference Result 6035 states and 10186 transitions. [2025-03-17 13:28:41,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 13:28:41,423 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.888888888888889) internal successors, (35), 9 states have internal predecessors, (35), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 39 [2025-03-17 13:28:41,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 13:28:41,437 INFO L225 Difference]: With dead ends: 6035 [2025-03-17 13:28:41,437 INFO L226 Difference]: Without dead ends: 6035 [2025-03-17 13:28:41,437 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2025-03-17 13:28:41,438 INFO L435 NwaCegarLoop]: 417 mSDtfsCounter, 4 mSDsluCounter, 1663 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 2080 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 13:28:41,438 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 2080 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 13:28:41,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6035 states. [2025-03-17 13:28:41,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6035 to 6035. [2025-03-17 13:28:41,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6035 states, 4917 states have (on average 1.500101688021151) internal successors, (7376), 5025 states have internal predecessors, (7376), 871 states have call successors, (871), 130 states have call predecessors, (871), 198 states have return successors, (1939), 887 states have call predecessors, (1939), 870 states have call successors, (1939) [2025-03-17 13:28:41,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6035 states to 6035 states and 10186 transitions. [2025-03-17 13:28:41,596 INFO L78 Accepts]: Start accepts. Automaton has 6035 states and 10186 transitions. Word has length 39 [2025-03-17 13:28:41,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 13:28:41,597 INFO L471 AbstractCegarLoop]: Abstraction has 6035 states and 10186 transitions. [2025-03-17 13:28:41,597 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.888888888888889) internal successors, (35), 9 states have internal predecessors, (35), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-17 13:28:41,597 INFO L276 IsEmpty]: Start isEmpty. Operand 6035 states and 10186 transitions. [2025-03-17 13:28:41,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-03-17 13:28:41,598 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 13:28:41,598 INFO L218 NwaCegarLoop]: trace histogram [4, 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] [2025-03-17 13:28:41,610 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-17 13:28:41,799 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,SelfDestructingSolverStorable14 [2025-03-17 13:28:41,799 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ldv_irq_1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_irq_1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_irq_1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 108 more)] === [2025-03-17 13:28:41,800 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:28:41,800 INFO L85 PathProgramCache]: Analyzing trace with hash -1629565522, now seen corresponding path program 2 times [2025-03-17 13:28:41,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:28:41,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1366834599] [2025-03-17 13:28:41,800 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 13:28:41,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:28:41,865 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 42 statements into 2 equivalence classes. [2025-03-17 13:28:41,939 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 42 of 42 statements. [2025-03-17 13:28:41,940 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 13:28:41,940 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 13:28:41,940 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 13:28:41,945 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-17 13:28:41,981 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-17 13:28:41,981 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:28:41,982 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 13:28:42,017 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 13:28:42,017 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-17 13:28:42,018 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (110 of 111 remaining) [2025-03-17 13:28:42,019 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ldv_irq_1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (109 of 111 remaining) [2025-03-17 13:28:42,019 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ldv_irq_1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (108 of 111 remaining) [2025-03-17 13:28:42,019 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ldv_irq_1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (107 of 111 remaining) [2025-03-17 13:28:42,020 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ldv_irq_1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (106 of 111 remaining) [2025-03-17 13:28:42,020 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ldv_irq_1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (105 of 111 remaining) [2025-03-17 13:28:42,020 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ldv_irq_1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (104 of 111 remaining) [2025-03-17 13:28:42,020 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location tegra_rtc_procErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (103 of 111 remaining) [2025-03-17 13:28:42,020 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location tegra_rtc_procErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (102 of 111 remaining) [2025-03-17 13:28:42,020 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location tegra_rtc_procErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (101 of 111 remaining) [2025-03-17 13:28:42,020 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location tegra_rtc_procErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (100 of 111 remaining) [2025-03-17 13:28:42,020 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location tegra_rtc_procErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (99 of 111 remaining) [2025-03-17 13:28:42,020 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location tegra_rtc_procErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (98 of 111 remaining) [2025-03-17 13:28:42,020 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location tegra_rtc_procErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (97 of 111 remaining) [2025-03-17 13:28:42,021 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location tegra_rtc_procErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (96 of 111 remaining) [2025-03-17 13:28:42,021 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location outer_syncErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (95 of 111 remaining) [2025-03-17 13:28:42,021 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location outer_syncErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (94 of 111 remaining) [2025-03-17 13:28:42,021 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location outer_syncErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (93 of 111 remaining) [2025-03-17 13:28:42,021 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location outer_syncErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (92 of 111 remaining) [2025-03-17 13:28:42,021 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location tegra_rtc_removeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (91 of 111 remaining) [2025-03-17 13:28:42,021 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location tegra_rtc_removeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (90 of 111 remaining) [2025-03-17 13:28:42,021 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location tegra_rtc_removeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (89 of 111 remaining) [2025-03-17 13:28:42,021 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location tegra_rtc_removeErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (88 of 111 remaining) [2025-03-17 13:28:42,021 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location tegra_rtc_removeErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (87 of 111 remaining) [2025-03-17 13:28:42,021 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location tegra_rtc_removeErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (86 of 111 remaining) [2025-03-17 13:28:42,021 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location tegra_rtc_removeErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (85 of 111 remaining) [2025-03-17 13:28:42,021 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location tegra_rtc_removeErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (84 of 111 remaining) [2025-03-17 13:28:42,021 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location device_may_wakeupErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (83 of 111 remaining) [2025-03-17 13:28:42,021 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location device_may_wakeupErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (82 of 111 remaining) [2025-03-17 13:28:42,022 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location device_may_wakeupErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (81 of 111 remaining) [2025-03-17 13:28:42,022 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location device_may_wakeupErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (80 of 111 remaining) [2025-03-17 13:28:42,022 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location kfreeErr0ASSERT_VIOLATIONMEMORY_FREE (79 of 111 remaining) [2025-03-17 13:28:42,022 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location kfreeErr1ASSERT_VIOLATIONMEMORY_FREE (78 of 111 remaining) [2025-03-17 13:28:42,022 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location kfreeErr2ASSERT_VIOLATIONMEMORY_FREE (77 of 111 remaining) [2025-03-17 13:28:42,022 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location tegra_rtc_set_alarmErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (76 of 111 remaining) [2025-03-17 13:28:42,022 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location tegra_rtc_set_alarmErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (75 of 111 remaining) [2025-03-17 13:28:42,022 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location tegra_rtc_set_alarmErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (74 of 111 remaining) [2025-03-17 13:28:42,022 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location tegra_rtc_set_alarmErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (73 of 111 remaining) [2025-03-17 13:28:42,022 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location tegra_rtc_set_alarmErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (72 of 111 remaining) [2025-03-17 13:28:42,022 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location tegra_rtc_set_alarmErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (71 of 111 remaining) [2025-03-17 13:28:42,022 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location tegra_rtc_set_alarmErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (70 of 111 remaining) [2025-03-17 13:28:42,022 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location tegra_rtc_set_alarmErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (69 of 111 remaining) [2025-03-17 13:28:42,023 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location tegra_rtc_set_alarmErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (68 of 111 remaining) [2025-03-17 13:28:42,023 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location tegra_rtc_set_alarmErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (67 of 111 remaining) [2025-03-17 13:28:42,023 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location tegra_rtc_set_alarmErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (66 of 111 remaining) [2025-03-17 13:28:42,023 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location tegra_rtc_set_alarmErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (65 of 111 remaining) [2025-03-17 13:28:42,023 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location tegra_rtc_read_timeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (64 of 111 remaining) [2025-03-17 13:28:42,023 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location tegra_rtc_read_timeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (63 of 111 remaining) [2025-03-17 13:28:42,023 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location tegra_rtc_read_timeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (62 of 111 remaining) [2025-03-17 13:28:42,023 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location tegra_rtc_read_timeErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (61 of 111 remaining) [2025-03-17 13:28:42,024 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location tegra_rtc_read_timeErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (60 of 111 remaining) [2025-03-17 13:28:42,024 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location tegra_rtc_read_timeErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (59 of 111 remaining) [2025-03-17 13:28:42,024 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location tegra_rtc_read_timeErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 111 remaining) [2025-03-17 13:28:42,024 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location tegra_rtc_read_timeErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 111 remaining) [2025-03-17 13:28:42,024 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ldv_errorErr0ASSERT_VIOLATIONMEMORY_LEAK (56 of 111 remaining) [2025-03-17 13:28:42,024 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location tegra_rtc_wait_while_busyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 111 remaining) [2025-03-17 13:28:42,024 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location tegra_rtc_wait_while_busyErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 111 remaining) [2025-03-17 13:28:42,024 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location tegra_rtc_wait_while_busyErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 111 remaining) [2025-03-17 13:28:42,024 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location tegra_rtc_wait_while_busyErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 111 remaining) [2025-03-17 13:28:42,024 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location tegra_rtc_alarm_irq_enableErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 111 remaining) [2025-03-17 13:28:42,024 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location tegra_rtc_alarm_irq_enableErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 111 remaining) [2025-03-17 13:28:42,024 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location tegra_rtc_alarm_irq_enableErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 111 remaining) [2025-03-17 13:28:42,024 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location tegra_rtc_alarm_irq_enableErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 111 remaining) [2025-03-17 13:28:42,024 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location tegra_rtc_alarm_irq_enableErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 111 remaining) [2025-03-17 13:28:42,024 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location tegra_rtc_alarm_irq_enableErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 111 remaining) [2025-03-17 13:28:42,024 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location tegra_rtc_alarm_irq_enableErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 111 remaining) [2025-03-17 13:28:42,024 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location tegra_rtc_alarm_irq_enableErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 111 remaining) [2025-03-17 13:28:42,024 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location resource_sizeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 111 remaining) [2025-03-17 13:28:42,025 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location resource_sizeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 111 remaining) [2025-03-17 13:28:42,025 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location resource_sizeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 111 remaining) [2025-03-17 13:28:42,025 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location resource_sizeErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 111 remaining) [2025-03-17 13:28:42,025 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location tegra_rtc_set_timeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 111 remaining) [2025-03-17 13:28:42,025 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location tegra_rtc_set_timeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 111 remaining) [2025-03-17 13:28:42,025 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location tegra_rtc_set_timeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 111 remaining) [2025-03-17 13:28:42,025 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location tegra_rtc_set_timeErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 111 remaining) [2025-03-17 13:28:42,025 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location tegra_rtc_set_timeErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 111 remaining) [2025-03-17 13:28:42,025 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location tegra_rtc_set_timeErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 111 remaining) [2025-03-17 13:28:42,025 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 111 remaining) [2025-03-17 13:28:42,025 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 111 remaining) [2025-03-17 13:28:42,025 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 111 remaining) [2025-03-17 13:28:42,025 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 111 remaining) [2025-03-17 13:28:42,025 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 111 remaining) [2025-03-17 13:28:42,025 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 111 remaining) [2025-03-17 13:28:42,025 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 111 remaining) [2025-03-17 13:28:42,025 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 111 remaining) [2025-03-17 13:28:42,025 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 111 remaining) [2025-03-17 13:28:42,025 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 111 remaining) [2025-03-17 13:28:42,025 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 111 remaining) [2025-03-17 13:28:42,025 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 111 remaining) [2025-03-17 13:28:42,025 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 111 remaining) [2025-03-17 13:28:42,025 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 111 remaining) [2025-03-17 13:28:42,025 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 111 remaining) [2025-03-17 13:28:42,025 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 111 remaining) [2025-03-17 13:28:42,025 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 111 remaining) [2025-03-17 13:28:42,025 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 111 remaining) [2025-03-17 13:28:42,025 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 111 remaining) [2025-03-17 13:28:42,025 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 111 remaining) [2025-03-17 13:28:42,026 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 111 remaining) [2025-03-17 13:28:42,026 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 111 remaining) [2025-03-17 13:28:42,027 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 111 remaining) [2025-03-17 13:28:42,027 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 111 remaining) [2025-03-17 13:28:42,027 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 111 remaining) [2025-03-17 13:28:42,027 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 111 remaining) [2025-03-17 13:28:42,027 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 111 remaining) [2025-03-17 13:28:42,027 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 111 remaining) [2025-03-17 13:28:42,027 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 111 remaining) [2025-03-17 13:28:42,027 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 111 remaining) [2025-03-17 13:28:42,027 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 111 remaining) [2025-03-17 13:28:42,027 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 111 remaining) [2025-03-17 13:28:42,027 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_DEREFERENCE (1 of 111 remaining) [2025-03-17 13:28:42,027 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_DEREFERENCE (0 of 111 remaining) [2025-03-17 13:28:42,028 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-17 13:28:42,030 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 13:28:42,095 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-17 13:28:42,105 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.03 01:28:42 BoogieIcfgContainer [2025-03-17 13:28:42,105 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-17 13:28:42,106 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-17 13:28:42,106 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-17 13:28:42,106 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-17 13:28:42,106 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 01:27:36" (3/4) ... [2025-03-17 13:28:42,108 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-17 13:28:42,109 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-17 13:28:42,109 INFO L158 Benchmark]: Toolchain (without parser) took 71699.65ms. Allocated memory was 142.6MB in the beginning and 604.0MB in the end (delta: 461.4MB). Free memory was 101.6MB in the beginning and 350.9MB in the end (delta: -249.3MB). Peak memory consumption was 220.0MB. Max. memory is 16.1GB. [2025-03-17 13:28:42,109 INFO L158 Benchmark]: CDTParser took 2.07ms. Allocated memory is still 201.3MB. Free memory is still 127.2MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 13:28:42,110 INFO L158 Benchmark]: CACSL2BoogieTranslator took 652.06ms. Allocated memory is still 142.6MB. Free memory was 101.6MB in the beginning and 53.3MB in the end (delta: 48.3MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. [2025-03-17 13:28:42,110 INFO L158 Benchmark]: Boogie Procedure Inliner took 57.63ms. Allocated memory is still 142.6MB. Free memory was 53.3MB in the beginning and 46.9MB in the end (delta: 6.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 13:28:42,110 INFO L158 Benchmark]: Boogie Preprocessor took 106.15ms. Allocated memory is still 142.6MB. Free memory was 46.9MB in the beginning and 35.6MB in the end (delta: 11.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 13:28:42,110 INFO L158 Benchmark]: IcfgBuilder took 5275.38ms. Allocated memory is still 142.6MB. Free memory was 35.6MB in the beginning and 46.2MB in the end (delta: -10.6MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-17 13:28:42,110 INFO L158 Benchmark]: TraceAbstraction took 65599.59ms. Allocated memory was 142.6MB in the beginning and 604.0MB in the end (delta: 461.4MB). Free memory was 45.3MB in the beginning and 351.0MB in the end (delta: -305.7MB). Peak memory consumption was 150.0MB. Max. memory is 16.1GB. [2025-03-17 13:28:42,110 INFO L158 Benchmark]: Witness Printer took 3.04ms. Allocated memory is still 604.0MB. Free memory was 351.0MB in the beginning and 350.9MB in the end (delta: 49.5kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 13:28:42,111 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 2.07ms. Allocated memory is still 201.3MB. Free memory is still 127.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 652.06ms. Allocated memory is still 142.6MB. Free memory was 101.6MB in the beginning and 53.3MB in the end (delta: 48.3MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 57.63ms. Allocated memory is still 142.6MB. Free memory was 53.3MB in the beginning and 46.9MB in the end (delta: 6.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 106.15ms. Allocated memory is still 142.6MB. Free memory was 46.9MB in the beginning and 35.6MB in the end (delta: 11.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 5275.38ms. Allocated memory is still 142.6MB. Free memory was 35.6MB in the beginning and 46.2MB in the end (delta: -10.6MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 65599.59ms. Allocated memory was 142.6MB in the beginning and 604.0MB in the end (delta: 461.4MB). Free memory was 45.3MB in the beginning and 351.0MB in the end (delta: -305.7MB). Peak memory consumption was 150.0MB. Max. memory is 16.1GB. * Witness Printer took 3.04ms. Allocated memory is still 604.0MB. Free memory was 351.0MB in the beginning and 350.9MB in the end (delta: 49.5kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * 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 - UnprovableResult [Line: 2396]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 2396. Possible FailurePath: [L1695] int ldv_irq_1_2 = 0; [L1696] int LDV_IN_INTERRUPT = 1; [L1697] int ldv_irq_1_3 = 0; [L1698] struct platform_device *tegra_rtc_driver_group0 ; [L1699] void *ldv_irq_data_1_1 ; [L1700] int ldv_irq_1_1 = 0; [L1701] int ldv_irq_1_0 = 0; [L1702] int ldv_irq_line_1_3 ; [L1703] void *ldv_irq_data_1_0 ; [L1704] int ldv_state_variable_0 ; [L1705] struct device *tegra_rtc_ops_group1 ; [L1706] int ldv_state_variable_3 ; [L1707] int ldv_irq_line_1_0 ; [L1708] int ldv_state_variable_2 ; [L1709] void *ldv_irq_data_1_3 ; [L1710] int ref_cnt ; [L1711] int ldv_irq_line_1_1 ; [L1712] struct rtc_time *tegra_rtc_ops_group0 ; [L1713] void *ldv_irq_data_1_2 ; [L1714] int ldv_state_variable_1 ; [L1715] int ldv_irq_line_1_2 ; [L1716] struct rtc_wkalrm *tegra_rtc_ops_group2 ; [L2058-L2060] static struct rtc_class_ops tegra_rtc_ops = {0, 0, 0, & tegra_rtc_read_time, & tegra_rtc_set_time, & tegra_rtc_read_alarm, & tegra_rtc_set_alarm, & tegra_rtc_proc, 0, 0, & tegra_rtc_alarm_irq_enable}; [L2058-L2060] static struct rtc_class_ops tegra_rtc_ops = {0, 0, 0, & tegra_rtc_read_time, & tegra_rtc_set_time, & tegra_rtc_read_alarm, & tegra_rtc_set_alarm, & tegra_rtc_proc, 0, 0, & tegra_rtc_alarm_irq_enable}; [L2058-L2060] static struct rtc_class_ops tegra_rtc_ops = {0, 0, 0, & tegra_rtc_read_time, & tegra_rtc_set_time, & tegra_rtc_read_alarm, & tegra_rtc_set_alarm, & tegra_rtc_proc, 0, 0, & tegra_rtc_alarm_irq_enable}; [L2058-L2060] static struct rtc_class_ops tegra_rtc_ops = {0, 0, 0, & tegra_rtc_read_time, & tegra_rtc_set_time, & tegra_rtc_read_alarm, & tegra_rtc_set_alarm, & tegra_rtc_proc, 0, 0, & tegra_rtc_alarm_irq_enable}; [L2058-L2060] static struct rtc_class_ops tegra_rtc_ops = {0, 0, 0, & tegra_rtc_read_time, & tegra_rtc_set_time, & tegra_rtc_read_alarm, & tegra_rtc_set_alarm, & tegra_rtc_proc, 0, 0, & tegra_rtc_alarm_irq_enable}; [L2058-L2060] static struct rtc_class_ops tegra_rtc_ops = {0, 0, 0, & tegra_rtc_read_time, & tegra_rtc_set_time, & tegra_rtc_read_alarm, & tegra_rtc_set_alarm, & tegra_rtc_proc, 0, 0, & tegra_rtc_alarm_irq_enable}; [L2058-L2060] static struct rtc_class_ops tegra_rtc_ops = {0, 0, 0, & tegra_rtc_read_time, & tegra_rtc_set_time, & tegra_rtc_read_alarm, & tegra_rtc_set_alarm, & tegra_rtc_proc, 0, 0, & tegra_rtc_alarm_irq_enable}; [L2058-L2060] static struct rtc_class_ops tegra_rtc_ops = {0, 0, 0, & tegra_rtc_read_time, & tegra_rtc_set_time, & tegra_rtc_read_alarm, & tegra_rtc_set_alarm, & tegra_rtc_proc, 0, 0, & tegra_rtc_alarm_irq_enable}; [L2058-L2060] static struct rtc_class_ops tegra_rtc_ops = {0, 0, 0, & tegra_rtc_read_time, & tegra_rtc_set_time, & tegra_rtc_read_alarm, & tegra_rtc_set_alarm, & tegra_rtc_proc, 0, 0, & tegra_rtc_alarm_irq_enable}; [L2058-L2060] static struct rtc_class_ops tegra_rtc_ops = {0, 0, 0, & tegra_rtc_read_time, & tegra_rtc_set_time, & tegra_rtc_read_alarm, & tegra_rtc_set_alarm, & tegra_rtc_proc, 0, 0, & tegra_rtc_alarm_irq_enable}; [L2058-L2060] static struct rtc_class_ops tegra_rtc_ops = {0, 0, 0, & tegra_rtc_read_time, & tegra_rtc_set_time, & tegra_rtc_read_alarm, & tegra_rtc_set_alarm, & tegra_rtc_proc, 0, 0, & tegra_rtc_alarm_irq_enable}; [L2058-L2060] static struct rtc_class_ops tegra_rtc_ops = {0, 0, 0, & tegra_rtc_read_time, & tegra_rtc_set_time, & tegra_rtc_read_alarm, & tegra_rtc_set_alarm, & tegra_rtc_proc, 0, 0, & tegra_rtc_alarm_irq_enable}; [L2058-L2060] static struct rtc_class_ops tegra_rtc_ops = {0, 0, 0, & tegra_rtc_read_time, & tegra_rtc_set_time, & tegra_rtc_read_alarm, & tegra_rtc_set_alarm, & tegra_rtc_proc, 0, 0, & tegra_rtc_alarm_irq_enable}; [L2226-L2227] static struct platform_driver tegra_rtc_driver = {0, & tegra_rtc_remove, & tegra_rtc_shutdown, & tegra_rtc_suspend, & tegra_rtc_resume, {"tegra_rtc", 0, & __this_module, 0, (_Bool)0, 0, 0, 0, 0, 0, 0, 0, 0, 0}, 0}; [L2226-L2227] static struct platform_driver tegra_rtc_driver = {0, & tegra_rtc_remove, & tegra_rtc_shutdown, & tegra_rtc_suspend, & tegra_rtc_resume, {"tegra_rtc", 0, & __this_module, 0, (_Bool)0, 0, 0, 0, 0, 0, 0, 0, 0, 0}, 0}; [L2226-L2227] static struct platform_driver tegra_rtc_driver = {0, & tegra_rtc_remove, & tegra_rtc_shutdown, & tegra_rtc_suspend, & tegra_rtc_resume, {"tegra_rtc", 0, & __this_module, 0, (_Bool)0, 0, 0, 0, 0, 0, 0, 0, 0, 0}, 0}; [L2226-L2227] static struct platform_driver tegra_rtc_driver = {0, & tegra_rtc_remove, & tegra_rtc_shutdown, & tegra_rtc_suspend, & tegra_rtc_resume, {"tegra_rtc", 0, & __this_module, 0, (_Bool)0, 0, 0, 0, 0, 0, 0, 0, 0, 0}, 0}; [L2226-L2227] static struct platform_driver tegra_rtc_driver = {0, & tegra_rtc_remove, & tegra_rtc_shutdown, & tegra_rtc_suspend, & tegra_rtc_resume, {"tegra_rtc", 0, & __this_module, 0, (_Bool)0, 0, 0, 0, 0, 0, 0, 0, 0, 0}, 0}; [L2226-L2227] static struct platform_driver tegra_rtc_driver = {0, & tegra_rtc_remove, & tegra_rtc_shutdown, & tegra_rtc_suspend, & tegra_rtc_resume, {"tegra_rtc", 0, & __this_module, 0, (_Bool)0, 0, 0, 0, 0, 0, 0, 0, 0, 0}, 0}; [L2226-L2227] static struct platform_driver tegra_rtc_driver = {0, & tegra_rtc_remove, & tegra_rtc_shutdown, & tegra_rtc_suspend, & tegra_rtc_resume, {"tegra_rtc", 0, & __this_module, 0, (_Bool)0, 0, 0, 0, 0, 0, 0, 0, 0, 0}, 0}; [L2226-L2227] static struct platform_driver tegra_rtc_driver = {0, & tegra_rtc_remove, & tegra_rtc_shutdown, & tegra_rtc_suspend, & tegra_rtc_resume, {"tegra_rtc", 0, & __this_module, 0, (_Bool)0, 0, 0, 0, 0, 0, 0, 0, 0, 0}, 0}; [L2226-L2227] static struct platform_driver tegra_rtc_driver = {0, & tegra_rtc_remove, & tegra_rtc_shutdown, & tegra_rtc_suspend, & tegra_rtc_resume, {"tegra_rtc", 0, & __this_module, 0, (_Bool)0, 0, 0, 0, 0, 0, 0, 0, 0, 0}, 0}; [L2226-L2227] static struct platform_driver tegra_rtc_driver = {0, & tegra_rtc_remove, & tegra_rtc_shutdown, & tegra_rtc_suspend, & tegra_rtc_resume, {"tegra_rtc", 0, & __this_module, 0, (_Bool)0, 0, 0, 0, 0, 0, 0, 0, 0, 0}, 0}; [L2226-L2227] static struct platform_driver tegra_rtc_driver = {0, & tegra_rtc_remove, & tegra_rtc_shutdown, & tegra_rtc_suspend, & tegra_rtc_resume, {"tegra_rtc", 0, & __this_module, 0, (_Bool)0, 0, 0, 0, 0, 0, 0, 0, 0, 0}, 0}; [L2226-L2227] static struct platform_driver tegra_rtc_driver = {0, & tegra_rtc_remove, & tegra_rtc_shutdown, & tegra_rtc_suspend, & tegra_rtc_resume, {"tegra_rtc", 0, & __this_module, 0, (_Bool)0, 0, 0, 0, 0, 0, 0, 0, 0, 0}, 0}; [L2226-L2227] static struct platform_driver tegra_rtc_driver = {0, & tegra_rtc_remove, & tegra_rtc_shutdown, & tegra_rtc_suspend, & tegra_rtc_resume, {"tegra_rtc", 0, & __this_module, 0, (_Bool)0, 0, 0, 0, 0, 0, 0, 0, 0, 0}, 0}; [L2226-L2227] static struct platform_driver tegra_rtc_driver = {0, & tegra_rtc_remove, & tegra_rtc_shutdown, & tegra_rtc_suspend, & tegra_rtc_resume, {"tegra_rtc", 0, & __this_module, 0, (_Bool)0, 0, 0, 0, 0, 0, 0, 0, 0, 0}, 0}; [L2226-L2227] static struct platform_driver tegra_rtc_driver = {0, & tegra_rtc_remove, & tegra_rtc_shutdown, & tegra_rtc_suspend, & tegra_rtc_resume, {"tegra_rtc", 0, & __this_module, 0, (_Bool)0, 0, 0, 0, 0, 0, 0, 0, 0, 0}, 0}; [L2226-L2227] static struct platform_driver tegra_rtc_driver = {0, & tegra_rtc_remove, & tegra_rtc_shutdown, & tegra_rtc_suspend, & tegra_rtc_resume, {"tegra_rtc", 0, & __this_module, 0, (_Bool)0, 0, 0, 0, 0, 0, 0, 0, 0, 0}, 0}; [L2226-L2227] static struct platform_driver tegra_rtc_driver = {0, & tegra_rtc_remove, & tegra_rtc_shutdown, & tegra_rtc_suspend, & tegra_rtc_resume, {"tegra_rtc", 0, & __this_module, 0, (_Bool)0, 0, 0, 0, 0, 0, 0, 0, 0, 0}, 0}; [L2226-L2227] static struct platform_driver tegra_rtc_driver = {0, & tegra_rtc_remove, & tegra_rtc_shutdown, & tegra_rtc_suspend, & tegra_rtc_resume, {"tegra_rtc", 0, & __this_module, 0, (_Bool)0, 0, 0, 0, 0, 0, 0, 0, 0, 0}, 0}; [L2226-L2227] static struct platform_driver tegra_rtc_driver = {0, & tegra_rtc_remove, & tegra_rtc_shutdown, & tegra_rtc_suspend, & tegra_rtc_resume, {"tegra_rtc", 0, & __this_module, 0, (_Bool)0, 0, 0, 0, 0, 0, 0, 0, 0, 0}, 0}; [L2226-L2227] static struct platform_driver tegra_rtc_driver = {0, & tegra_rtc_remove, & tegra_rtc_shutdown, & tegra_rtc_suspend, & tegra_rtc_resume, {"tegra_rtc", 0, & __this_module, 0, (_Bool)0, 0, 0, 0, 0, 0, 0, 0, 0, 0}, 0}; [L2226-L2227] static struct platform_driver tegra_rtc_driver = {0, & tegra_rtc_remove, & tegra_rtc_shutdown, & tegra_rtc_suspend, & tegra_rtc_resume, {"tegra_rtc", 0, & __this_module, 0, (_Bool)0, 0, 0, 0, 0, 0, 0, 0, 0, 0}, 0}; [L2226-L2227] static struct platform_driver tegra_rtc_driver = {0, & tegra_rtc_remove, & tegra_rtc_shutdown, & tegra_rtc_suspend, & tegra_rtc_resume, {"tegra_rtc", 0, & __this_module, 0, (_Bool)0, 0, 0, 0, 0, 0, 0, 0, 0, 0}, 0}; [L2226-L2227] static struct platform_driver tegra_rtc_driver = {0, & tegra_rtc_remove, & tegra_rtc_shutdown, & tegra_rtc_suspend, & tegra_rtc_resume, {"tegra_rtc", 0, & __this_module, 0, (_Bool)0, 0, 0, 0, 0, 0, 0, 0, 0, 0}, 0}; [L2243] int ldv_retval_2 ; [L2244] int ldv_retval_0 ; [L2246] int ldv_retval_1 ; [L2769] int ldv_init = 0; [L2398] struct seq_file *ldvarg1 ; [L2399] void *tmp ; [L2400] unsigned int ldvarg0 ; [L2401] unsigned int tmp___0 ; [L2402] pm_message_t ldvarg2 ; [L2403] int tmp___1 ; [L2404] int tmp___2 ; [L2405] int tmp___3 ; [L2406] int tmp___4 ; VAL [LDV_IN_INTERRUPT=1, __this_module={184:161}, ldv_init=0, ldv_irq_1_0=0, ldv_irq_1_1=0, ldv_irq_1_2=0, ldv_irq_1_3=0, ldv_irq_data_1_0={0:0}, ldv_irq_data_1_1={0:0}, ldv_irq_data_1_2={0:0}, ldv_irq_data_1_3={0:0}, ldv_irq_line_1_0=0, ldv_irq_line_1_1=0, ldv_irq_line_1_2=0, ldv_irq_line_1_3=0, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ldv_state_variable_3=0, ldvarg2={17:0}, ref_cnt=0, tegra_rtc_driver={15:0}, tegra_rtc_driver_group0={0:0}, tegra_rtc_ops={14:0}, tegra_rtc_ops_group0={0:0}, tegra_rtc_ops_group1={0:0}, tegra_rtc_ops_group2={0:0}] [L2408] CALL, EXPR ldv_zalloc(136U) VAL [LDV_IN_INTERRUPT=1, __this_module={184:161}, ldv_init=0, ldv_irq_1_0=0, ldv_irq_1_1=0, ldv_irq_1_2=0, ldv_irq_1_3=0, ldv_irq_data_1_0={0:0}, ldv_irq_data_1_1={0:0}, ldv_irq_data_1_2={0:0}, ldv_irq_data_1_3={0:0}, ldv_irq_line_1_0=0, ldv_irq_line_1_1=0, ldv_irq_line_1_2=0, ldv_irq_line_1_3=0, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ldv_state_variable_3=0, ref_cnt=0, tegra_rtc_driver={15:0}, tegra_rtc_driver_group0={0:0}, tegra_rtc_ops={14:0}, tegra_rtc_ops_group0={0:0}, tegra_rtc_ops_group1={0:0}, tegra_rtc_ops_group2={0:0}] [L1636] void *p ; [L1637] void *tmp ; [L1638] int tmp___0 ; [L1640] tmp___0 = __VERIFIER_nondet_int() [L1641] COND FALSE !(tmp___0 != 0) [L1644] EXPR, FCALL calloc(1U, size) [L1644] tmp = calloc(1U, size) [L1645] p = tmp VAL [LDV_IN_INTERRUPT=1, \old(size)=136, __this_module={184:161}, ldv_init=0, ldv_irq_1_0=0, ldv_irq_1_1=0, ldv_irq_1_2=0, ldv_irq_1_3=0, ldv_irq_data_1_0={0:0}, ldv_irq_data_1_1={0:0}, ldv_irq_data_1_2={0:0}, ldv_irq_data_1_3={0:0}, ldv_irq_line_1_0=0, ldv_irq_line_1_1=0, ldv_irq_line_1_2=0, ldv_irq_line_1_3=0, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ldv_state_variable_3=0, p={-(((__int128) 0 << 64) | 18446744073709549604U):0}, ref_cnt=0, tegra_rtc_driver={15:0}, tegra_rtc_driver_group0={0:0}, tegra_rtc_ops={14:0}, tegra_rtc_ops_group0={0:0}, tegra_rtc_ops_group1={0:0}, tegra_rtc_ops_group2={0:0}] [L1646] CALL assume_abort_if_not((unsigned long )p != (unsigned long )((void *)0)) VAL [LDV_IN_INTERRUPT=1, \old(cond)=1, __this_module={184:161}, ldv_init=0, ldv_irq_1_0=0, ldv_irq_1_1=0, ldv_irq_1_2=0, ldv_irq_1_3=0, ldv_irq_data_1_0={0:0}, ldv_irq_data_1_1={0:0}, ldv_irq_data_1_2={0:0}, ldv_irq_data_1_3={0:0}, ldv_irq_line_1_0=0, ldv_irq_line_1_1=0, ldv_irq_line_1_2=0, ldv_irq_line_1_3=0, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ldv_state_variable_3=0, ref_cnt=0, tegra_rtc_driver={15:0}, tegra_rtc_driver_group0={0:0}, tegra_rtc_ops={14:0}, tegra_rtc_ops_group0={0:0}, tegra_rtc_ops_group1={0:0}, tegra_rtc_ops_group2={0:0}] [L1613] COND FALSE !(!cond) VAL [LDV_IN_INTERRUPT=1, \old(cond)=1, __this_module={184:161}, ldv_init=0, ldv_irq_1_0=0, ldv_irq_1_1=0, ldv_irq_1_2=0, ldv_irq_1_3=0, ldv_irq_data_1_0={0:0}, ldv_irq_data_1_1={0:0}, ldv_irq_data_1_2={0:0}, ldv_irq_data_1_3={0:0}, ldv_irq_line_1_0=0, ldv_irq_line_1_1=0, ldv_irq_line_1_2=0, ldv_irq_line_1_3=0, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ldv_state_variable_3=0, ref_cnt=0, tegra_rtc_driver={15:0}, tegra_rtc_driver_group0={0:0}, tegra_rtc_ops={14:0}, tegra_rtc_ops_group0={0:0}, tegra_rtc_ops_group1={0:0}, tegra_rtc_ops_group2={0:0}] [L1646] RET assume_abort_if_not((unsigned long )p != (unsigned long )((void *)0)) VAL [LDV_IN_INTERRUPT=1, \old(size)=136, __this_module={184:161}, ldv_init=0, ldv_irq_1_0=0, ldv_irq_1_1=0, ldv_irq_1_2=0, ldv_irq_1_3=0, ldv_irq_data_1_0={0:0}, ldv_irq_data_1_1={0:0}, ldv_irq_data_1_2={0:0}, ldv_irq_data_1_3={0:0}, ldv_irq_line_1_0=0, ldv_irq_line_1_1=0, ldv_irq_line_1_2=0, ldv_irq_line_1_3=0, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ldv_state_variable_3=0, p={-(((__int128) 0 << 64) | 18446744073709549604U):0}, ref_cnt=0, tegra_rtc_driver={15:0}, tegra_rtc_driver_group0={0:0}, tegra_rtc_ops={14:0}, tegra_rtc_ops_group0={0:0}, tegra_rtc_ops_group1={0:0}, tegra_rtc_ops_group2={0:0}] [L1647] CALL, EXPR ldv_is_err(p) VAL [LDV_IN_INTERRUPT=1, \old(ptr)={-(((__int128) 0 << 64) | 18446744073709549604U):0}, __this_module={184:161}, ldv_init=0, ldv_irq_1_0=0, ldv_irq_1_1=0, ldv_irq_1_2=0, ldv_irq_1_3=0, ldv_irq_data_1_0={0:0}, ldv_irq_data_1_1={0:0}, ldv_irq_data_1_2={0:0}, ldv_irq_data_1_3={0:0}, ldv_irq_line_1_0=0, ldv_irq_line_1_1=0, ldv_irq_line_1_2=0, ldv_irq_line_1_3=0, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ldv_state_variable_3=0, ref_cnt=0, tegra_rtc_driver={15:0}, tegra_rtc_driver_group0={0:0}, tegra_rtc_ops={14:0}, tegra_rtc_ops_group0={0:0}, tegra_rtc_ops_group1={0:0}, tegra_rtc_ops_group2={0:0}] [L2736] return ((unsigned long )ptr > 2012UL); VAL [LDV_IN_INTERRUPT=1, \old(ptr)={-(((__int128) 0 << 64) | 18446744073709549604U):0}, \result=0, __this_module={184:161}, ldv_init=0, ldv_irq_1_0=0, ldv_irq_1_1=0, ldv_irq_1_2=0, ldv_irq_1_3=0, ldv_irq_data_1_0={0:0}, ldv_irq_data_1_1={0:0}, ldv_irq_data_1_2={0:0}, ldv_irq_data_1_3={0:0}, ldv_irq_line_1_0=0, ldv_irq_line_1_1=0, ldv_irq_line_1_2=0, ldv_irq_line_1_3=0, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ldv_state_variable_3=0, ref_cnt=0, tegra_rtc_driver={15:0}, tegra_rtc_driver_group0={0:0}, tegra_rtc_ops={14:0}, tegra_rtc_ops_group0={0:0}, tegra_rtc_ops_group1={0:0}, tegra_rtc_ops_group2={0:0}] [L1647] RET, EXPR ldv_is_err(p) VAL [LDV_IN_INTERRUPT=1, \old(size)=136, __this_module={184:161}, ldv_init=0, ldv_irq_1_0=0, ldv_irq_1_1=0, ldv_irq_1_2=0, ldv_irq_1_3=0, ldv_irq_data_1_0={0:0}, ldv_irq_data_1_1={0:0}, ldv_irq_data_1_2={0:0}, ldv_irq_data_1_3={0:0}, ldv_irq_line_1_0=0, ldv_irq_line_1_1=0, ldv_irq_line_1_2=0, ldv_irq_line_1_3=0, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ldv_state_variable_3=0, p={-(((__int128) 0 << 64) | 18446744073709549604U):0}, ref_cnt=0, tegra_rtc_driver={15:0}, tegra_rtc_driver_group0={0:0}, tegra_rtc_ops={14:0}, tegra_rtc_ops_group0={0:0}, tegra_rtc_ops_group1={0:0}, tegra_rtc_ops_group2={0:0}] [L1647] CALL assume_abort_if_not(ldv_is_err(p) == 0) VAL [LDV_IN_INTERRUPT=1, \old(cond)=1, __this_module={184:161}, ldv_init=0, ldv_irq_1_0=0, ldv_irq_1_1=0, ldv_irq_1_2=0, ldv_irq_1_3=0, ldv_irq_data_1_0={0:0}, ldv_irq_data_1_1={0:0}, ldv_irq_data_1_2={0:0}, ldv_irq_data_1_3={0:0}, ldv_irq_line_1_0=0, ldv_irq_line_1_1=0, ldv_irq_line_1_2=0, ldv_irq_line_1_3=0, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ldv_state_variable_3=0, ref_cnt=0, tegra_rtc_driver={15:0}, tegra_rtc_driver_group0={0:0}, tegra_rtc_ops={14:0}, tegra_rtc_ops_group0={0:0}, tegra_rtc_ops_group1={0:0}, tegra_rtc_ops_group2={0:0}] [L1613] COND FALSE !(!cond) VAL [LDV_IN_INTERRUPT=1, \old(cond)=1, __this_module={184:161}, ldv_init=0, ldv_irq_1_0=0, ldv_irq_1_1=0, ldv_irq_1_2=0, ldv_irq_1_3=0, ldv_irq_data_1_0={0:0}, ldv_irq_data_1_1={0:0}, ldv_irq_data_1_2={0:0}, ldv_irq_data_1_3={0:0}, ldv_irq_line_1_0=0, ldv_irq_line_1_1=0, ldv_irq_line_1_2=0, ldv_irq_line_1_3=0, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ldv_state_variable_3=0, ref_cnt=0, tegra_rtc_driver={15:0}, tegra_rtc_driver_group0={0:0}, tegra_rtc_ops={14:0}, tegra_rtc_ops_group0={0:0}, tegra_rtc_ops_group1={0:0}, tegra_rtc_ops_group2={0:0}] [L1647] RET assume_abort_if_not(ldv_is_err(p) == 0) VAL [LDV_IN_INTERRUPT=1, \old(size)=136, __this_module={184:161}, ldv_init=0, ldv_irq_1_0=0, ldv_irq_1_1=0, ldv_irq_1_2=0, ldv_irq_1_3=0, ldv_irq_data_1_0={0:0}, ldv_irq_data_1_1={0:0}, ldv_irq_data_1_2={0:0}, ldv_irq_data_1_3={0:0}, ldv_irq_line_1_0=0, ldv_irq_line_1_1=0, ldv_irq_line_1_2=0, ldv_irq_line_1_3=0, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ldv_state_variable_3=0, p={-(((__int128) 0 << 64) | 18446744073709549604U):0}, ref_cnt=0, tegra_rtc_driver={15:0}, tegra_rtc_driver_group0={0:0}, tegra_rtc_ops={14:0}, tegra_rtc_ops_group0={0:0}, tegra_rtc_ops_group1={0:0}, tegra_rtc_ops_group2={0:0}] [L1648] return (p); VAL [LDV_IN_INTERRUPT=1, \old(size)=136, \result={-(((__int128) 0 << 64) | 18446744073709549604U):0}, __this_module={184:161}, ldv_init=0, ldv_irq_1_0=0, ldv_irq_1_1=0, ldv_irq_1_2=0, ldv_irq_1_3=0, ldv_irq_data_1_0={0:0}, ldv_irq_data_1_1={0:0}, ldv_irq_data_1_2={0:0}, ldv_irq_data_1_3={0:0}, ldv_irq_line_1_0=0, ldv_irq_line_1_1=0, ldv_irq_line_1_2=0, ldv_irq_line_1_3=0, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ldv_state_variable_3=0, ref_cnt=0, tegra_rtc_driver={15:0}, tegra_rtc_driver_group0={0:0}, tegra_rtc_ops={14:0}, tegra_rtc_ops_group0={0:0}, tegra_rtc_ops_group1={0:0}, tegra_rtc_ops_group2={0:0}] [L2408] RET, EXPR ldv_zalloc(136U) VAL [LDV_IN_INTERRUPT=1, __this_module={184:161}, ldv_init=0, ldv_irq_1_0=0, ldv_irq_1_1=0, ldv_irq_1_2=0, ldv_irq_1_3=0, ldv_irq_data_1_0={0:0}, ldv_irq_data_1_1={0:0}, ldv_irq_data_1_2={0:0}, ldv_irq_data_1_3={0:0}, ldv_irq_line_1_0=0, ldv_irq_line_1_1=0, ldv_irq_line_1_2=0, ldv_irq_line_1_3=0, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ldv_state_variable_3=0, ldvarg2={17:0}, ref_cnt=0, tegra_rtc_driver={15:0}, tegra_rtc_driver_group0={0:0}, tegra_rtc_ops={14:0}, tegra_rtc_ops_group0={0:0}, tegra_rtc_ops_group1={0:0}, tegra_rtc_ops_group2={0:0}] [L2408] tmp = ldv_zalloc(136U) [L2409] ldvarg1 = (struct seq_file *)tmp [L2410] tmp___0 = __VERIFIER_nondet_uint() [L2411] ldvarg0 = tmp___0 [L2412] FCALL ldv_initialize() [L2413] FCALL memset((void *)(& ldvarg2), 0, 4U) [L2414] ldv_state_variable_1 = 1 [L2415] ref_cnt = 0 [L2416] ldv_state_variable_0 = 1 [L2417] ldv_state_variable_3 = 0 [L2418] ldv_state_variable_2 = 0 VAL [LDV_IN_INTERRUPT=1, __this_module={184:161}, ldv_init=0, ldv_irq_1_0=0, ldv_irq_1_1=0, ldv_irq_1_2=0, ldv_irq_1_3=0, ldv_irq_data_1_0={0:0}, ldv_irq_data_1_1={0:0}, ldv_irq_data_1_2={0:0}, ldv_irq_data_1_3={0:0}, ldv_irq_line_1_0=0, ldv_irq_line_1_1=0, ldv_irq_line_1_2=0, ldv_irq_line_1_3=0, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_state_variable_0=1, ldv_state_variable_1=1, ldv_state_variable_2=0, ldv_state_variable_3=0, ldvarg0=165, ldvarg1={-(((__int128) 0 << 64) | 18446744073709549604U):0}, ldvarg2={17:0}, ref_cnt=0, tegra_rtc_driver={15:0}, tegra_rtc_driver_group0={0:0}, tegra_rtc_ops={14:0}, tegra_rtc_ops_group0={0:0}, tegra_rtc_ops_group1={0:0}, tegra_rtc_ops_group2={0:0}] [L2420] tmp___1 = __VERIFIER_nondet_int() [L2422] case 0: [L2428] case 1: [L2430] tmp___2 = __VERIFIER_nondet_int() [L2432] case 0: VAL [LDV_IN_INTERRUPT=1, __this_module={184:161}, ldv_init=0, ldv_irq_1_0=0, ldv_irq_1_1=0, ldv_irq_1_2=0, ldv_irq_1_3=0, ldv_irq_data_1_0={0:0}, ldv_irq_data_1_1={0:0}, ldv_irq_data_1_2={0:0}, ldv_irq_data_1_3={0:0}, ldv_irq_line_1_0=0, ldv_irq_line_1_1=0, ldv_irq_line_1_2=0, ldv_irq_line_1_3=0, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_state_variable_0=1, ldv_state_variable_1=1, ldv_state_variable_2=0, ldv_state_variable_3=0, ldvarg0=165, ldvarg1={-(((__int128) 0 << 64) | 18446744073709549604U):0}, ldvarg2={17:0}, ref_cnt=0, tegra_rtc_driver={15:0}, tegra_rtc_driver_group0={0:0}, tegra_rtc_ops={14:0}, tegra_rtc_ops_group0={0:0}, tegra_rtc_ops_group1={0:0}, tegra_rtc_ops_group2={0:0}, tmp___1=1, tmp___2=1] [L2428] case 1: [L2440] case 1: VAL [LDV_IN_INTERRUPT=1, __this_module={184:161}, ldv_init=0, ldv_irq_1_0=0, ldv_irq_1_1=0, ldv_irq_1_2=0, ldv_irq_1_3=0, ldv_irq_data_1_0={0:0}, ldv_irq_data_1_1={0:0}, ldv_irq_data_1_2={0:0}, ldv_irq_data_1_3={0:0}, ldv_irq_line_1_0=0, ldv_irq_line_1_1=0, ldv_irq_line_1_2=0, ldv_irq_line_1_3=0, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_state_variable_0=1, ldv_state_variable_1=1, ldv_state_variable_2=0, ldv_state_variable_3=0, ldvarg0=165, ldvarg1={-(((__int128) 0 << 64) | 18446744073709549604U):0}, ldvarg2={17:0}, ref_cnt=0, tegra_rtc_driver={15:0}, tegra_rtc_driver_group0={0:0}, tegra_rtc_ops={14:0}, tegra_rtc_ops_group0={0:0}, tegra_rtc_ops_group1={0:0}, tegra_rtc_ops_group2={0:0}, tmp___1=1] [L2428] case 1: [L2442] CALL, EXPR tegra_rtc_init() [L2230] int tmp ; [L2232] CALL, EXPR platform_driver_probe(& tegra_rtc_driver, & tegra_rtc_probe) [L2848] return __VERIFIER_nondet_int(); [L2232] RET, EXPR platform_driver_probe(& tegra_rtc_driver, & tegra_rtc_probe) [L2232] tmp = platform_driver_probe(& tegra_rtc_driver, & tegra_rtc_probe) [L2233] return (tmp); [L2442] RET, EXPR tegra_rtc_init() [L2442] ldv_retval_0 = tegra_rtc_init() [L2428] case 1: [L2450] ldv_state_variable_0 = 2 VAL [LDV_IN_INTERRUPT=1, __this_module={184:161}, ldv_init=0, ldv_irq_1_0=0, ldv_irq_1_1=0, ldv_irq_1_2=0, ldv_irq_1_3=0, ldv_irq_data_1_0={0:0}, ldv_irq_data_1_1={0:0}, ldv_irq_data_1_2={0:0}, ldv_irq_data_1_3={0:0}, ldv_irq_line_1_0=0, ldv_irq_line_1_1=0, ldv_irq_line_1_2=0, ldv_irq_line_1_3=0, ldv_retval_0=1, ldv_retval_1=0, ldv_retval_2=0, ldv_state_variable_0=2, ldv_state_variable_1=1, ldv_state_variable_2=0, ldv_state_variable_3=0, ldvarg0=165, ldvarg1={-(((__int128) 0 << 64) | 18446744073709549604U):0}, ldvarg2={17:0}, ref_cnt=0, tegra_rtc_driver={15:0}, tegra_rtc_driver_group0={0:0}, tegra_rtc_ops={14:0}, tegra_rtc_ops_group0={0:0}, tegra_rtc_ops_group1={0:0}, tegra_rtc_ops_group2={0:0}, tmp___1=1] [L2635] FCALL ldv_check_final_state() [L2636] return 0; [L2636] return 0; VAL [LDV_IN_INTERRUPT=1, \result=0, __this_module={184:161}, ldv_init=0, ldv_irq_1_0=0, ldv_irq_1_1=0, ldv_irq_1_2=0, ldv_irq_1_3=0, ldv_irq_data_1_0={0:0}, ldv_irq_data_1_1={0:0}, ldv_irq_data_1_2={0:0}, ldv_irq_data_1_3={0:0}, ldv_irq_line_1_0=0, ldv_irq_line_1_1=0, ldv_irq_line_1_2=0, ldv_irq_line_1_3=0, ldv_retval_0=1, ldv_retval_1=0, ldv_retval_2=0, ldv_state_variable_0=2, ldv_state_variable_1=1, ldv_state_variable_2=0, ldv_state_variable_3=0, ldvarg0=165, ldvarg1={-(((__int128) 0 << 64) | 18446744073709549604U):0}, ref_cnt=0, tegra_rtc_driver={15:0}, tegra_rtc_driver_group0={0:0}, tegra_rtc_ops={14:0}, tegra_rtc_ops_group0={0:0}, tegra_rtc_ops_group1={0:0}, tegra_rtc_ops_group2={0:0}, tmp___1=1] - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 2896]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 2896]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 2896]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 12]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 33 procedures, 564 locations, 789 edges, 111 error locations. Started 1 CEGAR loops. OverallTime: 65.5s, OverallIterations: 16, TraceHistogramMax: 4, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 59.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 13 mSolverCounterUnknown, 6749 SdHoareTripleChecker+Valid, 58.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 6591 mSDsluCounter, 21232 SdHoareTripleChecker+Invalid, 57.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 13888 mSDsCounter, 997 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 6976 IncrementalHoareTripleChecker+Invalid, 7986 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 997 mSolverCounterUnsat, 7344 mSDtfsCounter, 6976 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 160 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=6035occurred in iteration=15, InterpolantAutomatonStates: 78, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.6s AutomataMinimizationTime, 15 MinimizatonAttempts, 1250 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 2.2s InterpolantComputationTime, 503 NumberOfCodeBlocks, 503 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 483 ConstructedInterpolants, 0 QuantifiedInterpolants, 1265 SizeOfPredicates, 0 NumberOfNonLiveVariables, 593 ConjunctsInSsa, 8 ConjunctsInUnsatCore, 17 InterpolantComputations, 14 PerfectInterpolantSequences, 32/35 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 RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-03-17 13:28:42,146 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### 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/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/ldv-validator-v0.6/linux-stable-9ec4f65-1-110_1a-drivers--rtc--rtc-tegra.ko-entry_point.cil.out.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Bitvector.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 valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 440f273968b34677cc4ba81db9f48373d3cac4b8a75ac1f970ae3fdbbff89c17 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 13:28:43,960 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 13:28:44,039 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Bitvector.epf [2025-03-17 13:28:44,045 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 13:28:44,045 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 13:28:44,064 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 13:28:44,064 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 13:28:44,064 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 13:28:44,065 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 13:28:44,065 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 13:28:44,065 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 13:28:44,065 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 13:28:44,065 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 13:28:44,065 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 13:28:44,065 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 13:28:44,065 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 13:28:44,065 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 13:28:44,065 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 13:28:44,065 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-17 13:28:44,067 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-17 13:28:44,067 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-17 13:28:44,067 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 13:28:44,067 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-17 13:28:44,067 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-17 13:28:44,067 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-17 13:28:44,067 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-17 13:28:44,067 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 13:28:44,067 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 13:28:44,067 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 13:28:44,068 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 13:28:44,068 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 13:28:44,068 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 13:28:44,068 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 13:28:44,068 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 13:28:44,068 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 13:28:44,068 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-17 13:28:44,068 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-17 13:28:44,068 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 13:28:44,068 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 13:28:44,068 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 13:28:44,068 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 13:28:44,068 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 valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) 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 -> 440f273968b34677cc4ba81db9f48373d3cac4b8a75ac1f970ae3fdbbff89c17 [2025-03-17 13:28:44,304 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 13:28:44,309 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 13:28:44,311 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 13:28:44,311 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 13:28:44,311 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 13:28:44,312 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-validator-v0.6/linux-stable-9ec4f65-1-110_1a-drivers--rtc--rtc-tegra.ko-entry_point.cil.out.i [2025-03-17 13:28:45,449 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/df32d7e97/b31ff9b734f7490a913e3658674d90a7/FLAG573862c9e [2025-03-17 13:28:45,729 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 13:28:45,731 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-validator-v0.6/linux-stable-9ec4f65-1-110_1a-drivers--rtc--rtc-tegra.ko-entry_point.cil.out.i [2025-03-17 13:28:45,753 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/df32d7e97/b31ff9b734f7490a913e3658674d90a7/FLAG573862c9e [2025-03-17 13:28:46,014 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/df32d7e97/b31ff9b734f7490a913e3658674d90a7 [2025-03-17 13:28:46,015 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 13:28:46,016 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 13:28:46,017 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 13:28:46,017 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 13:28:46,020 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 13:28:46,021 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 01:28:46" (1/1) ... [2025-03-17 13:28:46,021 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@20245914 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:28:46, skipping insertion in model container [2025-03-17 13:28:46,022 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 01:28:46" (1/1) ... [2025-03-17 13:28:46,067 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 13:28:46,427 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-17 13:28:46,432 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-17 13:28:46,438 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-17 13:28:46,439 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-17 13:28:46,441 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-17 13:28:46,444 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-17 13:28:46,447 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-17 13:28:46,451 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-17 13:28:46,451 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-17 13:28:46,453 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-17 13:28:46,460 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-17 13:28:46,460 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-17 13:28:46,461 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-17 13:28:46,464 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-17 13:28:46,466 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-17 13:28:46,475 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-17 13:28:46,475 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-17 13:28:46,476 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-17 13:28:46,480 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-17 13:28:46,493 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-17 13:28:46,495 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-17 13:28:46,496 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-17 13:28:46,497 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-17 13:28:46,499 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-17 13:28:46,501 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-17 13:28:46,506 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-17 13:28:46,508 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-17 13:28:46,509 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-17 13:28:46,509 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-17 13:28:46,512 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-17 13:28:46,514 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-17 13:28:46,537 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-17 13:28:46,538 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-17 13:28:46,538 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-17 13:28:46,539 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-17 13:28:46,543 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-17 13:28:46,544 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-17 13:28:46,557 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-17 13:28:46,573 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-17 13:28:46,574 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 13:28:46,592 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 13:28:46,723 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 13:28:46,756 INFO L204 MainTranslator]: Completed translation [2025-03-17 13:28:46,757 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:28:46 WrapperNode [2025-03-17 13:28:46,758 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 13:28:46,758 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 13:28:46,758 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 13:28:46,759 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 13:28:46,763 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:28:46" (1/1) ... [2025-03-17 13:28:46,782 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:28:46" (1/1) ... [2025-03-17 13:28:46,820 INFO L138 Inliner]: procedures = 122, calls = 369, calls flagged for inlining = 54, calls inlined = 37, statements flattened = 836 [2025-03-17 13:28:46,823 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 13:28:46,824 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 13:28:46,824 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 13:28:46,824 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 13:28:46,830 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:28:46" (1/1) ... [2025-03-17 13:28:46,830 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:28:46" (1/1) ... [2025-03-17 13:28:46,843 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:28:46" (1/1) ... [2025-03-17 13:28:46,912 INFO L175 MemorySlicer]: Split 91 memory accesses to 9 slices as follows [2, 3, 2, 10, 4, 26, 10, 12, 22]. 29 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0, 0, 0, 0, 0, 0]. The 50 writes are split as follows [0, 2, 0, 9, 1, 1, 3, 12, 22]. [2025-03-17 13:28:46,913 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:28:46" (1/1) ... [2025-03-17 13:28:46,913 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:28:46" (1/1) ... [2025-03-17 13:28:46,940 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:28:46" (1/1) ... [2025-03-17 13:28:46,942 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:28:46" (1/1) ... [2025-03-17 13:28:46,955 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:28:46" (1/1) ... [2025-03-17 13:28:46,959 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:28:46" (1/1) ... [2025-03-17 13:28:46,975 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 13:28:46,976 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 13:28:46,976 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 13:28:46,976 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 13:28:46,977 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:28:46" (1/1) ... [2025-03-17 13:28:46,982 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 13:28:46,992 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 13:28:47,002 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-17 13:28:47,005 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-17 13:28:47,026 INFO L130 BoogieDeclarations]: Found specification of procedure dev_get_drvdata [2025-03-17 13:28:47,026 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_get_drvdata [2025-03-17 13:28:47,026 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2025-03-17 13:28:47,026 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2025-03-17 13:28:47,026 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2025-03-17 13:28:47,026 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2025-03-17 13:28:47,027 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#4 [2025-03-17 13:28:47,027 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#5 [2025-03-17 13:28:47,027 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#6 [2025-03-17 13:28:47,027 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#7 [2025-03-17 13:28:47,027 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#8 [2025-03-17 13:28:47,027 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE8#0 [2025-03-17 13:28:47,027 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE8#1 [2025-03-17 13:28:47,027 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE8#2 [2025-03-17 13:28:47,027 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE8#3 [2025-03-17 13:28:47,027 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE8#4 [2025-03-17 13:28:47,027 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE8#5 [2025-03-17 13:28:47,027 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE8#6 [2025-03-17 13:28:47,027 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE8#7 [2025-03-17 13:28:47,027 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE8#8 [2025-03-17 13:28:47,027 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2025-03-17 13:28:47,028 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2025-03-17 13:28:47,028 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2025-03-17 13:28:47,028 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2025-03-17 13:28:47,028 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#4 [2025-03-17 13:28:47,028 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#5 [2025-03-17 13:28:47,028 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#6 [2025-03-17 13:28:47,028 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#7 [2025-03-17 13:28:47,028 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#8 [2025-03-17 13:28:47,028 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#0 [2025-03-17 13:28:47,028 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#1 [2025-03-17 13:28:47,028 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#2 [2025-03-17 13:28:47,028 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#3 [2025-03-17 13:28:47,028 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#4 [2025-03-17 13:28:47,028 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#5 [2025-03-17 13:28:47,028 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#6 [2025-03-17 13:28:47,028 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#7 [2025-03-17 13:28:47,029 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#8 [2025-03-17 13:28:47,029 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2025-03-17 13:28:47,029 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2025-03-17 13:28:47,029 INFO L130 BoogieDeclarations]: Found specification of procedure rtc_time_to_tm [2025-03-17 13:28:47,029 INFO L138 BoogieDeclarations]: Found implementation of procedure rtc_time_to_tm [2025-03-17 13:28:47,029 INFO L130 BoogieDeclarations]: Found specification of procedure tegra_rtc_proc [2025-03-17 13:28:47,029 INFO L138 BoogieDeclarations]: Found implementation of procedure tegra_rtc_proc [2025-03-17 13:28:47,029 INFO L130 BoogieDeclarations]: Found specification of procedure irq_set_irq_wake [2025-03-17 13:28:47,029 INFO L138 BoogieDeclarations]: Found implementation of procedure irq_set_irq_wake [2025-03-17 13:28:47,029 INFO L130 BoogieDeclarations]: Found specification of procedure outer_sync [2025-03-17 13:28:47,029 INFO L138 BoogieDeclarations]: Found implementation of procedure outer_sync [2025-03-17 13:28:47,029 INFO L130 BoogieDeclarations]: Found specification of procedure tegra_rtc_remove [2025-03-17 13:28:47,029 INFO L138 BoogieDeclarations]: Found implementation of procedure tegra_rtc_remove [2025-03-17 13:28:47,029 INFO L130 BoogieDeclarations]: Found specification of procedure tegra_rtc_shutdown [2025-03-17 13:28:47,029 INFO L138 BoogieDeclarations]: Found implementation of procedure tegra_rtc_shutdown [2025-03-17 13:28:47,029 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2025-03-17 13:28:47,030 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2025-03-17 13:28:47,030 INFO L130 BoogieDeclarations]: Found specification of procedure rtc_tm_to_time [2025-03-17 13:28:47,030 INFO L138 BoogieDeclarations]: Found implementation of procedure rtc_tm_to_time [2025-03-17 13:28:47,030 INFO L130 BoogieDeclarations]: Found specification of procedure __release_region [2025-03-17 13:28:47,030 INFO L138 BoogieDeclarations]: Found implementation of procedure __release_region [2025-03-17 13:28:47,030 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2025-03-17 13:28:47,030 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2025-03-17 13:28:47,030 INFO L130 BoogieDeclarations]: Found specification of procedure tegra_rtc_set_alarm [2025-03-17 13:28:47,030 INFO L138 BoogieDeclarations]: Found implementation of procedure tegra_rtc_set_alarm [2025-03-17 13:28:47,030 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2025-03-17 13:28:47,030 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2025-03-17 13:28:47,030 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#0 [2025-03-17 13:28:47,030 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#1 [2025-03-17 13:28:47,030 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#2 [2025-03-17 13:28:47,031 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#3 [2025-03-17 13:28:47,031 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#4 [2025-03-17 13:28:47,031 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#5 [2025-03-17 13:28:47,031 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#6 [2025-03-17 13:28:47,031 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#7 [2025-03-17 13:28:47,031 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#8 [2025-03-17 13:28:47,031 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_lock_check [2025-03-17 13:28:47,031 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_lock_check [2025-03-17 13:28:47,031 INFO L130 BoogieDeclarations]: Found specification of procedure tegra_rtc_alarm_irq_enable [2025-03-17 13:28:47,031 INFO L138 BoogieDeclarations]: Found implementation of procedure tegra_rtc_alarm_irq_enable [2025-03-17 13:28:47,031 INFO L130 BoogieDeclarations]: Found specification of procedure tegra_iounmap [2025-03-17 13:28:47,031 INFO L138 BoogieDeclarations]: Found implementation of procedure tegra_iounmap [2025-03-17 13:28:47,031 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 13:28:47,031 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 13:28:47,031 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-17 13:28:47,031 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 13:28:47,031 INFO L130 BoogieDeclarations]: Found specification of procedure rtc_device_unregister [2025-03-17 13:28:47,032 INFO L138 BoogieDeclarations]: Found implementation of procedure rtc_device_unregister [2025-03-17 13:28:47,032 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-17 13:28:47,032 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_irq_1 [2025-03-17 13:28:47,032 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_irq_1 [2025-03-17 13:28:47,032 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-17 13:28:47,032 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-17 13:28:47,032 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-17 13:28:47,032 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-03-17 13:28:47,032 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2025-03-17 13:28:47,032 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2025-03-17 13:28:47,032 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2025-03-17 13:28:47,032 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#7 [2025-03-17 13:28:47,032 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#8 [2025-03-17 13:28:47,032 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_err [2025-03-17 13:28:47,032 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_err [2025-03-17 13:28:47,032 INFO L130 BoogieDeclarations]: Found specification of procedure device_may_wakeup [2025-03-17 13:28:47,033 INFO L138 BoogieDeclarations]: Found implementation of procedure device_may_wakeup [2025-03-17 13:28:47,033 INFO L130 BoogieDeclarations]: Found specification of procedure spin_unlock_irqrestore [2025-03-17 13:28:47,033 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_unlock_irqrestore [2025-03-17 13:28:47,033 INFO L130 BoogieDeclarations]: Found specification of procedure platform_get_resource [2025-03-17 13:28:47,033 INFO L138 BoogieDeclarations]: Found implementation of procedure platform_get_resource [2025-03-17 13:28:47,033 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE8#0 [2025-03-17 13:28:47,033 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE8#1 [2025-03-17 13:28:47,033 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE8#2 [2025-03-17 13:28:47,033 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE8#3 [2025-03-17 13:28:47,033 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE8#4 [2025-03-17 13:28:47,033 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE8#5 [2025-03-17 13:28:47,033 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE8#6 [2025-03-17 13:28:47,033 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE8#7 [2025-03-17 13:28:47,033 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE8#8 [2025-03-17 13:28:47,033 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2025-03-17 13:28:47,033 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2025-03-17 13:28:47,033 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2025-03-17 13:28:47,034 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2025-03-17 13:28:47,034 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#4 [2025-03-17 13:28:47,034 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#5 [2025-03-17 13:28:47,034 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#6 [2025-03-17 13:28:47,034 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#7 [2025-03-17 13:28:47,034 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#8 [2025-03-17 13:28:47,034 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2025-03-17 13:28:47,034 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2025-03-17 13:28:47,034 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2025-03-17 13:28:47,034 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2025-03-17 13:28:47,034 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#4 [2025-03-17 13:28:47,034 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#5 [2025-03-17 13:28:47,034 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#6 [2025-03-17 13:28:47,034 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#7 [2025-03-17 13:28:47,034 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#8 [2025-03-17 13:28:47,034 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-17 13:28:47,034 INFO L130 BoogieDeclarations]: Found specification of procedure platform_set_drvdata [2025-03-17 13:28:47,034 INFO L138 BoogieDeclarations]: Found implementation of procedure platform_set_drvdata [2025-03-17 13:28:47,035 INFO L130 BoogieDeclarations]: Found specification of procedure platform_get_drvdata [2025-03-17 13:28:47,035 INFO L138 BoogieDeclarations]: Found implementation of procedure platform_get_drvdata [2025-03-17 13:28:47,035 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-17 13:28:47,035 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2025-03-17 13:28:47,035 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2025-03-17 13:28:47,035 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2025-03-17 13:28:47,035 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2025-03-17 13:28:47,035 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#5 [2025-03-17 13:28:47,035 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#6 [2025-03-17 13:28:47,035 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#7 [2025-03-17 13:28:47,035 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#8 [2025-03-17 13:28:47,035 INFO L130 BoogieDeclarations]: Found specification of procedure dev_err [2025-03-17 13:28:47,035 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_err [2025-03-17 13:28:47,035 INFO L130 BoogieDeclarations]: Found specification of procedure tegra_rtc_read_time [2025-03-17 13:28:47,035 INFO L138 BoogieDeclarations]: Found implementation of procedure tegra_rtc_read_time [2025-03-17 13:28:47,035 INFO L130 BoogieDeclarations]: Found specification of procedure tegra_rtc_wait_while_busy [2025-03-17 13:28:47,035 INFO L138 BoogieDeclarations]: Found implementation of procedure tegra_rtc_wait_while_busy [2025-03-17 13:28:47,035 INFO L130 BoogieDeclarations]: Found specification of procedure resource_size [2025-03-17 13:28:47,035 INFO L138 BoogieDeclarations]: Found implementation of procedure resource_size [2025-03-17 13:28:47,035 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2025-03-17 13:28:47,035 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2025-03-17 13:28:47,035 INFO L130 BoogieDeclarations]: Found specification of procedure tegra_rtc_set_time [2025-03-17 13:28:47,035 INFO L138 BoogieDeclarations]: Found implementation of procedure tegra_rtc_set_time [2025-03-17 13:28:47,035 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 13:28:47,035 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 13:28:47,334 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 13:28:47,336 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 13:28:47,372 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2807: havoc #t~ret270.base, #t~ret270.offset; [2025-03-17 13:28:47,375 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2025-03-17 13:28:47,495 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1788: havoc dev_name_#t~mem58#1.base, dev_name_#t~mem58#1.offset; [2025-03-17 13:28:47,496 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2886: havoc seq_printf_#t~nondet285#1; [2025-03-17 13:28:47,496 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1602: havoc kobject_name_#t~mem10#1.base, kobject_name_#t~mem10#1.offset; [2025-03-17 13:28:47,498 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2826: havoc #t~nondet274; [2025-03-17 13:28:47,641 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2875: havoc #t~nondet283; [2025-03-17 13:28:47,820 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1989: call ULTIMATE.dealloc(~#sec~3.base, ~#sec~3.offset);havoc ~#sec~3.base, ~#sec~3.offset; [2025-03-17 13:28:47,990 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1779: havoc #t~mem52;havoc #t~mem53.base, #t~mem53.offset;havoc #t~short54; [2025-03-17 13:28:47,998 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2858: havoc #t~ret280.base, #t~ret280.offset; [2025-03-17 13:28:48,004 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2815: havoc dev_set_drvdata_#t~nondet272#1; [2025-03-17 13:28:48,010 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2804: havoc #t~nondet269; [2025-03-17 13:28:48,114 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1770: havoc #t~mem42;havoc #t~mem43; [2025-03-17 13:28:48,171 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1903: call ULTIMATE.dealloc(~#sec~1#1.base, ~#sec~1#1.offset);havoc ~#sec~1#1.base, ~#sec~1#1.offset; [2025-03-17 13:28:48,171 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2882: havoc rtc_valid_tm_#t~nondet284#1; [2025-03-17 13:28:53,141 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2844: havoc ldv_release_3_#t~nondet277#1; [2025-03-17 13:28:53,141 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2402: call ULTIMATE.dealloc(main_~#ldvarg2~0#1.base, main_~#ldvarg2~0#1.offset);havoc main_~#ldvarg2~0#1.base, main_~#ldvarg2~0#1.offset; [2025-03-17 13:28:53,141 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2848: havoc platform_driver_probe_#t~nondet278#1; [2025-03-17 13:28:53,141 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2836: havoc ldv_probe_2_#t~nondet275#1; [2025-03-17 13:28:53,141 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2840: havoc ldv_probe_3_#t~nondet276#1; [2025-03-17 13:28:53,273 INFO L? ?]: Removed 515 outVars from TransFormulas that were not future-live. [2025-03-17 13:28:53,273 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 13:28:53,296 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 13:28:53,296 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 13:28:53,296 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 01:28:53 BoogieIcfgContainer [2025-03-17 13:28:53,297 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 13:28:53,303 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 13:28:53,303 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 13:28:53,307 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 13:28:53,307 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 01:28:46" (1/3) ... [2025-03-17 13:28:53,308 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52625bf5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 01:28:53, skipping insertion in model container [2025-03-17 13:28:53,308 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:28:46" (2/3) ... [2025-03-17 13:28:53,309 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52625bf5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 01:28:53, skipping insertion in model container [2025-03-17 13:28:53,309 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 01:28:53" (3/3) ... [2025-03-17 13:28:53,310 INFO L128 eAbstractionObserver]: Analyzing ICFG linux-stable-9ec4f65-1-110_1a-drivers--rtc--rtc-tegra.ko-entry_point.cil.out.i [2025-03-17 13:28:53,320 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 13:28:53,321 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG linux-stable-9ec4f65-1-110_1a-drivers--rtc--rtc-tegra.ko-entry_point.cil.out.i that has 33 procedures, 551 locations, 1 initial locations, 1 loop locations, and 111 error locations. [2025-03-17 13:28:53,362 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 13:28:53,369 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=None, 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;@7183b5ef, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 13:28:53,370 INFO L334 AbstractCegarLoop]: Starting to check reachability of 111 error locations. [2025-03-17 13:28:53,374 INFO L276 IsEmpty]: Start isEmpty. Operand has 550 states, 327 states have (on average 1.620795107033639) internal successors, (530), 447 states have internal predecessors, (530), 80 states have call successors, (80), 32 states have call predecessors, (80), 31 states have return successors, (74), 74 states have call predecessors, (74), 74 states have call successors, (74) [2025-03-17 13:28:53,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-17 13:28:53,378 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 13:28:53,378 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 13:28:53,379 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_DEREFERENCE === [tegra_rtc_procErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, tegra_rtc_procErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, tegra_rtc_procErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 108 more)] === [2025-03-17 13:28:53,382 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:28:53,382 INFO L85 PathProgramCache]: Analyzing trace with hash -2044207854, now seen corresponding path program 1 times [2025-03-17 13:28:53,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 13:28:53,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [121199836] [2025-03-17 13:28:53,390 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:28:53,390 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 13:28:53,390 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 13:28:53,392 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-17 13:28:53,393 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-17 13:28:53,670 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-17 13:28:53,728 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-17 13:28:53,729 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:28:53,729 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:28:53,736 INFO L256 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-17 13:28:53,739 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 13:28:53,776 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2025-03-17 13:28:53,978 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-17 13:28:53,978 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 13:28:53,979 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 13:28:53,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [121199836] [2025-03-17 13:28:53,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [121199836] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 13:28:53,979 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 13:28:53,979 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 13:28:53,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [161326607] [2025-03-17 13:28:53,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 13:28:53,983 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 13:28:53,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 13:28:54,000 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 13:28:54,000 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 13:28:54,003 INFO L87 Difference]: Start difference. First operand has 550 states, 327 states have (on average 1.620795107033639) internal successors, (530), 447 states have internal predecessors, (530), 80 states have call successors, (80), 32 states have call predecessors, (80), 31 states have return successors, (74), 74 states have call predecessors, (74), 74 states have call successors, (74) Second operand has 5 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 13:28:58,025 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-17 13:29:02,033 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers []