./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 e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/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-?-e2fb8be-m [2025-03-09 00:23:55,470 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-09 00:23:55,523 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf [2025-03-09 00:23:55,526 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-09 00:23:55,527 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-09 00:23:55,545 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-09 00:23:55,546 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-09 00:23:55,546 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-09 00:23:55,546 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-09 00:23:55,546 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-09 00:23:55,546 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-09 00:23:55,546 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-09 00:23:55,546 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-09 00:23:55,546 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-09 00:23:55,546 INFO L153 SettingsManager]: * Use SBE=true [2025-03-09 00:23:55,546 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-09 00:23:55,547 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-09 00:23:55,547 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-09 00:23:55,547 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-09 00:23:55,547 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-09 00:23:55,547 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-09 00:23:55,547 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-09 00:23:55,547 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-09 00:23:55,547 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-09 00:23:55,547 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-09 00:23:55,547 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-09 00:23:55,547 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-09 00:23:55,547 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-09 00:23:55,547 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-09 00:23:55,547 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-09 00:23:55,547 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 00:23:55,548 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-09 00:23:55,548 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-09 00:23:55,548 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-09 00:23:55,548 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-09 00:23:55,548 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-09 00:23:55,548 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-09 00:23:55,548 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-09 00:23:55,548 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-09 00:23:55,548 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-09 00:23:55,789 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-09 00:23:55,798 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-09 00:23:55,800 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-09 00:23:55,801 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-09 00:23:55,802 INFO L274 PluginConnector]: CDTParser initialized [2025-03-09 00:23:55,803 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-09 00:23:56,909 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/92f391f94/ed193aef67914813824e4c4a687b2add/FLAGb8adc6506 [2025-03-09 00:23:57,288 INFO L384 CDTParser]: Found 1 translation units. [2025-03-09 00:23:57,290 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-09 00:23:57,313 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/92f391f94/ed193aef67914813824e4c4a687b2add/FLAGb8adc6506 [2025-03-09 00:23:57,331 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/92f391f94/ed193aef67914813824e4c4a687b2add [2025-03-09 00:23:57,334 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-09 00:23:57,335 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-09 00:23:57,337 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-09 00:23:57,337 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-09 00:23:57,340 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-09 00:23:57,341 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 12:23:57" (1/1) ... [2025-03-09 00:23:57,343 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@13dfa00a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:23:57, skipping insertion in model container [2025-03-09 00:23:57,344 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 12:23:57" (1/1) ... [2025-03-09 00:23:57,404 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-09 00:23:57,725 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-09 00:23:57,727 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-09 00:23:57,734 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-09 00:23:57,734 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-09 00:23:57,735 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-09 00:23:57,738 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-09 00:23:57,739 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-09 00:23:57,741 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-09 00:23:57,742 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-09 00:23:57,743 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-09 00:23:57,746 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-09 00:23:57,746 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-09 00:23:57,747 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-09 00:23:57,749 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-09 00:23:57,753 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-09 00:23:57,762 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-09 00:23:57,763 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-09 00:23:57,764 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-09 00:23:57,773 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-09 00:23:57,784 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-09 00:23:57,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-09 00:23:57,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-09 00:23:57,786 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-09 00:23:57,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-09 00:23:57,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-09 00:23:57,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-09 00:23:57,798 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-09 00:23:57,799 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-09 00:23:57,799 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-09 00:23:57,804 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-09 00:23:57,807 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-09 00:23:57,830 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-09 00:23:57,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-09 00:23:57,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-09 00:23:57,835 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-09 00:23:57,838 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-09 00:23:57,838 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-09 00:23:57,848 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-09 00:23:57,866 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-09 00:23:57,867 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 00:23:57,880 INFO L200 MainTranslator]: Completed pre-run [2025-03-09 00:23:58,012 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 00:23:58,046 INFO L204 MainTranslator]: Completed translation [2025-03-09 00:23:58,046 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:23:58 WrapperNode [2025-03-09 00:23:58,046 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-09 00:23:58,047 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-09 00:23:58,047 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-09 00:23:58,047 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-09 00:23:58,052 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:23:58" (1/1) ... [2025-03-09 00:23:58,075 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:23:58" (1/1) ... [2025-03-09 00:23:58,112 INFO L138 Inliner]: procedures = 118, calls = 369, calls flagged for inlining = 54, calls inlined = 37, statements flattened = 914 [2025-03-09 00:23:58,113 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-09 00:23:58,113 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-09 00:23:58,113 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-09 00:23:58,113 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-09 00:23:58,120 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:23:58" (1/1) ... [2025-03-09 00:23:58,120 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:23:58" (1/1) ... [2025-03-09 00:23:58,128 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:23:58" (1/1) ... [2025-03-09 00:23:58,171 INFO L175 MemorySlicer]: Split 91 memory accesses to 9 slices as follows [10, 2, 4, 3, 26, 10, 2, 12, 22]. 29 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [0, 2, 0, 0, 0, 0, 0, 0, 0]. The 50 writes are split as follows [9, 0, 1, 2, 1, 3, 0, 12, 22]. [2025-03-09 00:23:58,172 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:23:58" (1/1) ... [2025-03-09 00:23:58,173 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:23:58" (1/1) ... [2025-03-09 00:23:58,195 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:23:58" (1/1) ... [2025-03-09 00:23:58,198 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:23:58" (1/1) ... [2025-03-09 00:23:58,211 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:23:58" (1/1) ... [2025-03-09 00:23:58,234 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:23:58" (1/1) ... [2025-03-09 00:23:58,245 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-09 00:23:58,246 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-09 00:23:58,246 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-09 00:23:58,246 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-09 00:23:58,247 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:23:58" (1/1) ... [2025-03-09 00:23:58,251 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 00:23:58,260 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 00:23:58,273 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-09 00:23:58,275 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-09 00:23:58,295 INFO L130 BoogieDeclarations]: Found specification of procedure dev_get_drvdata [2025-03-09 00:23:58,295 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_get_drvdata [2025-03-09 00:23:58,295 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#0 [2025-03-09 00:23:58,295 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#1 [2025-03-09 00:23:58,295 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#2 [2025-03-09 00:23:58,295 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#3 [2025-03-09 00:23:58,295 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#4 [2025-03-09 00:23:58,296 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#5 [2025-03-09 00:23:58,296 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#6 [2025-03-09 00:23:58,296 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#7 [2025-03-09 00:23:58,296 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#8 [2025-03-09 00:23:58,296 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#0 [2025-03-09 00:23:58,296 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#1 [2025-03-09 00:23:58,296 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#2 [2025-03-09 00:23:58,296 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#3 [2025-03-09 00:23:58,296 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#4 [2025-03-09 00:23:58,296 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#5 [2025-03-09 00:23:58,296 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#6 [2025-03-09 00:23:58,296 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#7 [2025-03-09 00:23:58,296 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#8 [2025-03-09 00:23:58,296 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2025-03-09 00:23:58,297 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2025-03-09 00:23:58,297 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-09 00:23:58,297 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-09 00:23:58,297 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-09 00:23:58,297 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-09 00:23:58,297 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-03-09 00:23:58,297 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-03-09 00:23:58,297 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-03-09 00:23:58,297 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2025-03-09 00:23:58,297 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2025-03-09 00:23:58,297 INFO L130 BoogieDeclarations]: Found specification of procedure rtc_time_to_tm [2025-03-09 00:23:58,297 INFO L138 BoogieDeclarations]: Found implementation of procedure rtc_time_to_tm [2025-03-09 00:23:58,297 INFO L130 BoogieDeclarations]: Found specification of procedure tegra_rtc_proc [2025-03-09 00:23:58,297 INFO L138 BoogieDeclarations]: Found implementation of procedure tegra_rtc_proc [2025-03-09 00:23:58,297 INFO L130 BoogieDeclarations]: Found specification of procedure irq_set_irq_wake [2025-03-09 00:23:58,297 INFO L138 BoogieDeclarations]: Found implementation of procedure irq_set_irq_wake [2025-03-09 00:23:58,298 INFO L130 BoogieDeclarations]: Found specification of procedure outer_sync [2025-03-09 00:23:58,298 INFO L138 BoogieDeclarations]: Found implementation of procedure outer_sync [2025-03-09 00:23:58,298 INFO L130 BoogieDeclarations]: Found specification of procedure tegra_rtc_remove [2025-03-09 00:23:58,298 INFO L138 BoogieDeclarations]: Found implementation of procedure tegra_rtc_remove [2025-03-09 00:23:58,298 INFO L130 BoogieDeclarations]: Found specification of procedure tegra_rtc_shutdown [2025-03-09 00:23:58,298 INFO L138 BoogieDeclarations]: Found implementation of procedure tegra_rtc_shutdown [2025-03-09 00:23:58,298 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2025-03-09 00:23:58,298 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2025-03-09 00:23:58,298 INFO L130 BoogieDeclarations]: Found specification of procedure rtc_tm_to_time [2025-03-09 00:23:58,298 INFO L138 BoogieDeclarations]: Found implementation of procedure rtc_tm_to_time [2025-03-09 00:23:58,298 INFO L130 BoogieDeclarations]: Found specification of procedure __release_region [2025-03-09 00:23:58,298 INFO L138 BoogieDeclarations]: Found implementation of procedure __release_region [2025-03-09 00:23:58,298 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2025-03-09 00:23:58,299 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2025-03-09 00:23:58,299 INFO L130 BoogieDeclarations]: Found specification of procedure tegra_rtc_set_alarm [2025-03-09 00:23:58,299 INFO L138 BoogieDeclarations]: Found implementation of procedure tegra_rtc_set_alarm [2025-03-09 00:23:58,299 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-09 00:23:58,300 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-09 00:23:58,300 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-09 00:23:58,300 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-09 00:23:58,300 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-03-09 00:23:58,300 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-03-09 00:23:58,300 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-03-09 00:23:58,300 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2025-03-09 00:23:58,300 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2025-03-09 00:23:58,300 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2025-03-09 00:23:58,300 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2025-03-09 00:23:58,300 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_lock_check [2025-03-09 00:23:58,300 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_lock_check [2025-03-09 00:23:58,300 INFO L130 BoogieDeclarations]: Found specification of procedure tegra_rtc_alarm_irq_enable [2025-03-09 00:23:58,300 INFO L138 BoogieDeclarations]: Found implementation of procedure tegra_rtc_alarm_irq_enable [2025-03-09 00:23:58,300 INFO L130 BoogieDeclarations]: Found specification of procedure tegra_iounmap [2025-03-09 00:23:58,300 INFO L138 BoogieDeclarations]: Found implementation of procedure tegra_iounmap [2025-03-09 00:23:58,300 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-09 00:23:58,300 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-09 00:23:58,300 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-09 00:23:58,300 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-09 00:23:58,300 INFO L130 BoogieDeclarations]: Found specification of procedure rtc_device_unregister [2025-03-09 00:23:58,300 INFO L138 BoogieDeclarations]: Found implementation of procedure rtc_device_unregister [2025-03-09 00:23:58,300 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-09 00:23:58,300 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_irq_1 [2025-03-09 00:23:58,300 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_irq_1 [2025-03-09 00:23:58,300 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-09 00:23:58,300 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-09 00:23:58,300 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-09 00:23:58,300 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-03-09 00:23:58,300 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2025-03-09 00:23:58,300 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2025-03-09 00:23:58,300 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2025-03-09 00:23:58,300 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#7 [2025-03-09 00:23:58,300 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#8 [2025-03-09 00:23:58,300 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_err [2025-03-09 00:23:58,300 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_err [2025-03-09 00:23:58,300 INFO L130 BoogieDeclarations]: Found specification of procedure device_may_wakeup [2025-03-09 00:23:58,300 INFO L138 BoogieDeclarations]: Found implementation of procedure device_may_wakeup [2025-03-09 00:23:58,300 INFO L130 BoogieDeclarations]: Found specification of procedure spin_unlock_irqrestore [2025-03-09 00:23:58,300 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_unlock_irqrestore [2025-03-09 00:23:58,300 INFO L130 BoogieDeclarations]: Found specification of procedure platform_get_resource [2025-03-09 00:23:58,301 INFO L138 BoogieDeclarations]: Found implementation of procedure platform_get_resource [2025-03-09 00:23:58,301 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-09 00:23:58,301 INFO L130 BoogieDeclarations]: Found specification of procedure platform_set_drvdata [2025-03-09 00:23:58,301 INFO L138 BoogieDeclarations]: Found implementation of procedure platform_set_drvdata [2025-03-09 00:23:58,301 INFO L130 BoogieDeclarations]: Found specification of procedure platform_get_drvdata [2025-03-09 00:23:58,301 INFO L138 BoogieDeclarations]: Found implementation of procedure platform_get_drvdata [2025-03-09 00:23:58,301 INFO L130 BoogieDeclarations]: Found specification of procedure dev_err [2025-03-09 00:23:58,301 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_err [2025-03-09 00:23:58,301 INFO L130 BoogieDeclarations]: Found specification of procedure tegra_rtc_read_time [2025-03-09 00:23:58,301 INFO L138 BoogieDeclarations]: Found implementation of procedure tegra_rtc_read_time [2025-03-09 00:23:58,301 INFO L130 BoogieDeclarations]: Found specification of procedure tegra_rtc_wait_while_busy [2025-03-09 00:23:58,301 INFO L138 BoogieDeclarations]: Found implementation of procedure tegra_rtc_wait_while_busy [2025-03-09 00:23:58,301 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-09 00:23:58,301 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-09 00:23:58,301 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-09 00:23:58,301 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-09 00:23:58,301 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-09 00:23:58,301 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-03-09 00:23:58,301 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-03-09 00:23:58,301 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-03-09 00:23:58,301 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-03-09 00:23:58,301 INFO L130 BoogieDeclarations]: Found specification of procedure resource_size [2025-03-09 00:23:58,301 INFO L138 BoogieDeclarations]: Found implementation of procedure resource_size [2025-03-09 00:23:58,301 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2025-03-09 00:23:58,301 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2025-03-09 00:23:58,301 INFO L130 BoogieDeclarations]: Found specification of procedure tegra_rtc_set_time [2025-03-09 00:23:58,301 INFO L138 BoogieDeclarations]: Found implementation of procedure tegra_rtc_set_time [2025-03-09 00:23:58,301 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-09 00:23:58,301 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-09 00:23:58,526 INFO L256 CfgBuilder]: Building ICFG [2025-03-09 00:23:58,528 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-09 00:23:58,553 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2807: havoc #t~ret273.base, #t~ret273.offset; [2025-03-09 00:23:58,645 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2025-03-09 00:23:58,687 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1788: havoc dev_name_#t~mem58#1.base, dev_name_#t~mem58#1.offset; [2025-03-09 00:23:58,687 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2886: havoc seq_printf_#t~nondet288#1; [2025-03-09 00:23:58,687 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1602: havoc kobject_name_#t~mem10#1.base, kobject_name_#t~mem10#1.offset; [2025-03-09 00:23:58,690 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2826: havoc #t~nondet277; [2025-03-09 00:23:58,769 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1779: havoc #t~mem52;havoc #t~mem53.base, #t~mem53.offset;havoc #t~short54; [2025-03-09 00:23:58,785 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2875: havoc #t~nondet286; [2025-03-09 00:23:58,788 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2858: havoc #t~ret283.base, #t~ret283.offset; [2025-03-09 00:23:58,793 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2815: havoc dev_set_drvdata_#t~nondet275#1; [2025-03-09 00:23:58,836 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1989: call ULTIMATE.dealloc(~#sec~3.base, ~#sec~3.offset);havoc ~#sec~3.base, ~#sec~3.offset; [2025-03-09 00:23:58,839 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2804: havoc #t~nondet272; [2025-03-09 00:23:58,909 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1770: havoc #t~mem42;havoc #t~mem43; [2025-03-09 00:23:58,947 INFO L1307 $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-09 00:23:58,947 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2882: havoc rtc_valid_tm_#t~nondet287#1; [2025-03-09 00:24:03,257 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2844: havoc ldv_release_3_#t~nondet280#1; [2025-03-09 00:24:03,257 INFO L1307 $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-09 00:24:03,258 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2848: havoc platform_driver_probe_#t~nondet281#1; [2025-03-09 00:24:03,258 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2836: havoc ldv_probe_2_#t~nondet278#1; [2025-03-09 00:24:03,258 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2840: havoc ldv_probe_3_#t~nondet279#1; [2025-03-09 00:24:03,353 INFO L? ?]: Removed 550 outVars from TransFormulas that were not future-live. [2025-03-09 00:24:03,353 INFO L307 CfgBuilder]: Performing block encoding [2025-03-09 00:24:03,383 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-09 00:24:03,383 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-09 00:24:03,383 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 12:24:03 BoogieIcfgContainer [2025-03-09 00:24:03,383 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-09 00:24:03,385 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-09 00:24:03,385 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-09 00:24:03,389 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-09 00:24:03,389 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.03 12:23:57" (1/3) ... [2025-03-09 00:24:03,389 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20a64f67 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 12:24:03, skipping insertion in model container [2025-03-09 00:24:03,390 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:23:58" (2/3) ... [2025-03-09 00:24:03,390 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20a64f67 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 12:24:03, skipping insertion in model container [2025-03-09 00:24:03,390 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 12:24:03" (3/3) ... [2025-03-09 00:24:03,392 INFO L128 eAbstractionObserver]: Analyzing ICFG linux-stable-9ec4f65-1-110_1a-drivers--rtc--rtc-tegra.ko-entry_point.cil.out.i [2025-03-09 00:24:03,401 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-09 00:24:03,404 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, 588 locations, 1 initial locations, 1 loop locations, and 111 error locations. [2025-03-09 00:24:03,452 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-09 00:24:03,460 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;@30e669b2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-09 00:24:03,460 INFO L334 AbstractCegarLoop]: Starting to check reachability of 111 error locations. [2025-03-09 00:24:03,465 INFO L276 IsEmpty]: Start isEmpty. Operand has 587 states, 364 states have (on average 1.5741758241758241) internal successors, (573), 484 states have internal predecessors, (573), 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-09 00:24:03,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-03-09 00:24:03,469 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:24:03,470 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:24:03,470 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-09 00:24:03,475 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:24:03,476 INFO L85 PathProgramCache]: Analyzing trace with hash -774568941, now seen corresponding path program 1 times [2025-03-09 00:24:03,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:24:03,481 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1028677389] [2025-03-09 00:24:03,481 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:24:03,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:24:03,635 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-09 00:24:03,720 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-09 00:24:03,721 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:24:03,721 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:24:04,040 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-09 00:24:04,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:24:04,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1028677389] [2025-03-09 00:24:04,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1028677389] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:24:04,043 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:24:04,043 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 00:24:04,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1468014472] [2025-03-09 00:24:04,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:24:04,046 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 00:24:04,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:24:04,063 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 00:24:04,064 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-09 00:24:04,067 INFO L87 Difference]: Start difference. First operand has 587 states, 364 states have (on average 1.5741758241758241) internal successors, (573), 484 states have internal predecessors, (573), 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 2.0) internal successors, (8), 5 states have internal predecessors, (8), 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-09 00:24:08,082 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-09 00:24:12,094 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-09 00:24:16,109 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-09 00:24:17,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:24:17,567 INFO L93 Difference]: Finished difference Result 935 states and 1240 transitions. [2025-03-09 00:24:17,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 00:24:17,569 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 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 10 [2025-03-09 00:24:17,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:24:17,580 INFO L225 Difference]: With dead ends: 935 [2025-03-09 00:24:17,580 INFO L226 Difference]: Without dead ends: 921 [2025-03-09 00:24:17,581 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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-09 00:24:17,582 INFO L435 NwaCegarLoop]: 525 mSDtfsCounter, 496 mSDsluCounter, 1154 mSDsCounter, 0 mSdLazyCounter, 1114 mSolverCounterSat, 159 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 517 SdHoareTripleChecker+Valid, 1679 SdHoareTripleChecker+Invalid, 1276 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 159 IncrementalHoareTripleChecker+Valid, 1114 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.3s IncrementalHoareTripleChecker+Time [2025-03-09 00:24:17,583 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [517 Valid, 1679 Invalid, 1276 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [159 Valid, 1114 Invalid, 3 Unknown, 0 Unchecked, 13.3s Time] [2025-03-09 00:24:17,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 921 states. [2025-03-09 00:24:17,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 921 to 825. [2025-03-09 00:24:17,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 825 states, 563 states have (on average 1.5754884547069272) internal successors, (887), 677 states have internal predecessors, (887), 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-09 00:24:17,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 825 states to 825 states and 1163 transitions. [2025-03-09 00:24:17,665 INFO L78 Accepts]: Start accepts. Automaton has 825 states and 1163 transitions. Word has length 10 [2025-03-09 00:24:17,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:24:17,665 INFO L471 AbstractCegarLoop]: Abstraction has 825 states and 1163 transitions. [2025-03-09 00:24:17,665 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 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-09 00:24:17,665 INFO L276 IsEmpty]: Start isEmpty. Operand 825 states and 1163 transitions. [2025-03-09 00:24:17,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-03-09 00:24:17,666 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:24:17,666 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:24:17,666 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-09 00:24:17,666 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-09 00:24:17,667 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:24:17,667 INFO L85 PathProgramCache]: Analyzing trace with hash 1758167362, now seen corresponding path program 1 times [2025-03-09 00:24:17,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:24:17,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1033432153] [2025-03-09 00:24:17,667 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:24:17,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:24:17,755 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-09 00:24:17,782 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-09 00:24:17,783 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:24:17,783 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:24:18,051 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-09 00:24:18,052 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:24:18,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1033432153] [2025-03-09 00:24:18,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1033432153] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:24:18,052 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:24:18,052 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 00:24:18,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1958735605] [2025-03-09 00:24:18,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:24:18,053 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 00:24:18,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:24:18,054 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 00:24:18,054 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-09 00:24:18,054 INFO L87 Difference]: Start difference. First operand 825 states and 1163 transitions. Second operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 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-09 00:24:22,081 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-09 00:24:26,087 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-09 00:24:30,092 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-09 00:24:31,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:24:31,245 INFO L93 Difference]: Finished difference Result 1214 states and 1771 transitions. [2025-03-09 00:24:31,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 00:24:31,245 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 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 11 [2025-03-09 00:24:31,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:24:31,251 INFO L225 Difference]: With dead ends: 1214 [2025-03-09 00:24:31,252 INFO L226 Difference]: Without dead ends: 1214 [2025-03-09 00:24:31,252 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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-09 00:24:31,252 INFO L435 NwaCegarLoop]: 504 mSDtfsCounter, 486 mSDsluCounter, 1133 mSDsCounter, 0 mSdLazyCounter, 1110 mSolverCounterSat, 146 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 509 SdHoareTripleChecker+Valid, 1637 SdHoareTripleChecker+Invalid, 1259 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 146 IncrementalHoareTripleChecker+Valid, 1110 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.1s IncrementalHoareTripleChecker+Time [2025-03-09 00:24:31,253 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [509 Valid, 1637 Invalid, 1259 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [146 Valid, 1110 Invalid, 3 Unknown, 0 Unchecked, 13.1s Time] [2025-03-09 00:24:31,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1214 states. [2025-03-09 00:24:31,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1214 to 1142. [2025-03-09 00:24:31,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1142 states, 827 states have (on average 1.611850060459492) internal successors, (1333), 944 states have internal predecessors, (1333), 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-09 00:24:31,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1142 states to 1142 states and 1759 transitions. [2025-03-09 00:24:31,302 INFO L78 Accepts]: Start accepts. Automaton has 1142 states and 1759 transitions. Word has length 11 [2025-03-09 00:24:31,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:24:31,302 INFO L471 AbstractCegarLoop]: Abstraction has 1142 states and 1759 transitions. [2025-03-09 00:24:31,302 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 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-09 00:24:31,302 INFO L276 IsEmpty]: Start isEmpty. Operand 1142 states and 1759 transitions. [2025-03-09 00:24:31,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-03-09 00:24:31,304 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:24:31,304 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] [2025-03-09 00:24:31,304 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-09 00:24:31,304 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-09 00:24:31,304 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:24:31,304 INFO L85 PathProgramCache]: Analyzing trace with hash -625907500, now seen corresponding path program 1 times [2025-03-09 00:24:31,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:24:31,305 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [619834631] [2025-03-09 00:24:31,305 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:24:31,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:24:31,361 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-09 00:24:31,379 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-09 00:24:31,379 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:24:31,379 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:24:31,446 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-09 00:24:31,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:24:31,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [619834631] [2025-03-09 00:24:31,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [619834631] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:24:31,446 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:24:31,446 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 00:24:31,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1130003003] [2025-03-09 00:24:31,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:24:31,446 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 00:24:31,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:24:31,447 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 00:24:31,447 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 00:24:31,447 INFO L87 Difference]: Start difference. First operand 1142 states and 1759 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 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-09 00:24:35,453 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-09 00:24:35,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:24:35,510 INFO L93 Difference]: Finished difference Result 2225 states and 3430 transitions. [2025-03-09 00:24:35,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 00:24:35,511 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), 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 24 [2025-03-09 00:24:35,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:24:35,522 INFO L225 Difference]: With dead ends: 2225 [2025-03-09 00:24:35,523 INFO L226 Difference]: Without dead ends: 2225 [2025-03-09 00:24:35,523 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-09 00:24:35,524 INFO L435 NwaCegarLoop]: 703 mSDtfsCounter, 659 mSDsluCounter, 687 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 3 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 659 SdHoareTripleChecker+Valid, 1390 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2025-03-09 00:24:35,524 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [659 Valid, 1390 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 17 Invalid, 1 Unknown, 0 Unchecked, 4.0s Time] [2025-03-09 00:24:35,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2225 states. [2025-03-09 00:24:35,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2225 to 2113. [2025-03-09 00:24:35,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2113 states, 1605 states have (on average 1.6174454828660436) internal successors, (2596), 1729 states have internal predecessors, (2596), 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-09 00:24:35,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2113 states to 2113 states and 3426 transitions. [2025-03-09 00:24:35,629 INFO L78 Accepts]: Start accepts. Automaton has 2113 states and 3426 transitions. Word has length 24 [2025-03-09 00:24:35,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:24:35,630 INFO L471 AbstractCegarLoop]: Abstraction has 2113 states and 3426 transitions. [2025-03-09 00:24:35,630 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), 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-09 00:24:35,630 INFO L276 IsEmpty]: Start isEmpty. Operand 2113 states and 3426 transitions. [2025-03-09 00:24:35,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-03-09 00:24:35,632 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:24:35,633 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] [2025-03-09 00:24:35,633 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-09 00:24:35,633 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-09 00:24:35,634 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:24:35,634 INFO L85 PathProgramCache]: Analyzing trace with hash -1422693073, now seen corresponding path program 1 times [2025-03-09 00:24:35,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:24:35,635 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1178361544] [2025-03-09 00:24:35,635 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:24:35,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:24:35,693 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-09 00:24:35,716 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-09 00:24:35,716 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:24:35,716 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:24:35,948 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-09 00:24:35,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:24:35,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1178361544] [2025-03-09 00:24:35,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1178361544] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:24:35,948 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:24:35,948 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-09 00:24:35,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [549467745] [2025-03-09 00:24:35,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:24:35,949 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-09 00:24:35,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:24:35,949 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-09 00:24:35,949 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-09 00:24:35,949 INFO L87 Difference]: Start difference. First operand 2113 states and 3426 transitions. Second operand has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 7 states have internal predecessors, (16), 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-09 00:24:39,958 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-09 00:24:43,964 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-09 00:24:47,971 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-09 00:24:51,976 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-09 00:24:55,980 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-09 00:24:58,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:24:58,009 INFO L93 Difference]: Finished difference Result 2688 states and 4411 transitions. [2025-03-09 00:24:58,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-09 00:24:58,010 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 7 states have internal predecessors, (16), 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 27 [2025-03-09 00:24:58,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:24:58,026 INFO L225 Difference]: With dead ends: 2688 [2025-03-09 00:24:58,026 INFO L226 Difference]: Without dead ends: 2688 [2025-03-09 00:24:58,027 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-09 00:24:58,027 INFO L435 NwaCegarLoop]: 585 mSDtfsCounter, 819 mSDsluCounter, 1792 mSDsCounter, 0 mSdLazyCounter, 1947 mSolverCounterSat, 288 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 21.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 859 SdHoareTripleChecker+Valid, 2377 SdHoareTripleChecker+Invalid, 2240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 288 IncrementalHoareTripleChecker+Valid, 1947 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 21.9s IncrementalHoareTripleChecker+Time [2025-03-09 00:24:58,028 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [859 Valid, 2377 Invalid, 2240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [288 Valid, 1947 Invalid, 5 Unknown, 0 Unchecked, 21.9s Time] [2025-03-09 00:24:58,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2688 states. [2025-03-09 00:24:58,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2688 to 2170. [2025-03-09 00:24:58,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2170 states, 1651 states have (on average 1.6165960024227741) internal successors, (2669), 1776 states have internal predecessors, (2669), 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-09 00:24:58,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2170 states to 2170 states and 3599 transitions. [2025-03-09 00:24:58,092 INFO L78 Accepts]: Start accepts. Automaton has 2170 states and 3599 transitions. Word has length 27 [2025-03-09 00:24:58,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:24:58,093 INFO L471 AbstractCegarLoop]: Abstraction has 2170 states and 3599 transitions. [2025-03-09 00:24:58,093 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 7 states have internal predecessors, (16), 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-09 00:24:58,093 INFO L276 IsEmpty]: Start isEmpty. Operand 2170 states and 3599 transitions. [2025-03-09 00:24:58,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-03-09 00:24:58,094 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:24:58,094 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] [2025-03-09 00:24:58,094 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-09 00:24:58,095 INFO L396 AbstractCegarLoop]: === Iteration 5 === 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-09 00:24:58,095 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:24:58,095 INFO L85 PathProgramCache]: Analyzing trace with hash -1153811546, now seen corresponding path program 1 times [2025-03-09 00:24:58,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:24:58,095 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1149903001] [2025-03-09 00:24:58,095 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:24:58,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:24:58,149 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-09 00:24:58,168 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-09 00:24:58,168 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:24:58,169 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:24:58,575 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-09 00:24:58,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:24:58,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1149903001] [2025-03-09 00:24:58,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1149903001] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:24:58,576 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:24:58,576 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-09 00:24:58,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1828809872] [2025-03-09 00:24:58,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:24:58,577 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-09 00:24:58,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:24:58,577 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-09 00:24:58,577 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-03-09 00:24:58,578 INFO L87 Difference]: Start difference. First operand 2170 states and 3599 transitions. Second operand has 8 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 8 states have internal predecessors, (17), 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-09 00:25:02,584 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-09 00:25:06,587 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-09 00:25:10,590 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-09 00:25:14,597 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-09 00:25:18,600 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-09 00:25:22,604 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-09 00:25:24,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:25:24,695 INFO L93 Difference]: Finished difference Result 3891 states and 6754 transitions. [2025-03-09 00:25:24,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-09 00:25:24,696 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 8 states have internal predecessors, (17), 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 28 [2025-03-09 00:25:24,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:25:24,709 INFO L225 Difference]: With dead ends: 3891 [2025-03-09 00:25:24,709 INFO L226 Difference]: Without dead ends: 3891 [2025-03-09 00:25:24,710 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2025-03-09 00:25:24,711 INFO L435 NwaCegarLoop]: 559 mSDtfsCounter, 905 mSDsluCounter, 2388 mSDsCounter, 0 mSdLazyCounter, 2729 mSolverCounterSat, 238 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 25.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 954 SdHoareTripleChecker+Valid, 2947 SdHoareTripleChecker+Invalid, 2973 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 238 IncrementalHoareTripleChecker+Valid, 2729 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 26.0s IncrementalHoareTripleChecker+Time [2025-03-09 00:25:24,711 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [954 Valid, 2947 Invalid, 2973 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [238 Valid, 2729 Invalid, 6 Unknown, 0 Unchecked, 26.0s Time] [2025-03-09 00:25:24,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3891 states. [2025-03-09 00:25:24,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3891 to 3743. [2025-03-09 00:25:24,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3743 states, 2958 states have (on average 1.6501014198782962) internal successors, (4881), 3092 states have internal predecessors, (4881), 580 states have call successors, (580), 60 states have call predecessors, (580), 96 states have return successors, (1259), 612 states have call predecessors, (1259), 579 states have call successors, (1259) [2025-03-09 00:25:24,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3743 states to 3743 states and 6720 transitions. [2025-03-09 00:25:24,813 INFO L78 Accepts]: Start accepts. Automaton has 3743 states and 6720 transitions. Word has length 28 [2025-03-09 00:25:24,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:25:24,813 INFO L471 AbstractCegarLoop]: Abstraction has 3743 states and 6720 transitions. [2025-03-09 00:25:24,813 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 8 states have internal predecessors, (17), 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-09 00:25:24,814 INFO L276 IsEmpty]: Start isEmpty. Operand 3743 states and 6720 transitions. [2025-03-09 00:25:24,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-03-09 00:25:24,815 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:25:24,815 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] [2025-03-09 00:25:24,815 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-09 00:25:24,815 INFO L396 AbstractCegarLoop]: === Iteration 6 === 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-09 00:25:24,815 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:25:24,815 INFO L85 PathProgramCache]: Analyzing trace with hash 1231222067, now seen corresponding path program 1 times [2025-03-09 00:25:24,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:25:24,816 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [932973106] [2025-03-09 00:25:24,816 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:25:24,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:25:24,905 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-09 00:25:24,925 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-09 00:25:24,926 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:25:24,926 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:25:25,082 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-09 00:25:25,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:25:25,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [932973106] [2025-03-09 00:25:25,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [932973106] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:25:25,082 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:25:25,083 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 00:25:25,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2028803781] [2025-03-09 00:25:25,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:25:25,083 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 00:25:25,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:25:25,083 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 00:25:25,083 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-09 00:25:25,084 INFO L87 Difference]: Start difference. First operand 3743 states and 6720 transitions. Second operand has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 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-09 00:25:29,089 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-09 00:25:33,095 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-09 00:25:37,099 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-09 00:25:38,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:25:38,008 INFO L93 Difference]: Finished difference Result 4120 states and 7336 transitions. [2025-03-09 00:25:38,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 00:25:38,009 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 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 27 [2025-03-09 00:25:38,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:25:38,025 INFO L225 Difference]: With dead ends: 4120 [2025-03-09 00:25:38,025 INFO L226 Difference]: Without dead ends: 4115 [2025-03-09 00:25:38,026 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-09 00:25:38,026 INFO L435 NwaCegarLoop]: 724 mSDtfsCounter, 464 mSDsluCounter, 1458 mSDsCounter, 0 mSdLazyCounter, 1213 mSolverCounterSat, 128 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 485 SdHoareTripleChecker+Valid, 2182 SdHoareTripleChecker+Invalid, 1344 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 128 IncrementalHoareTripleChecker+Valid, 1213 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.9s IncrementalHoareTripleChecker+Time [2025-03-09 00:25:38,026 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [485 Valid, 2182 Invalid, 1344 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [128 Valid, 1213 Invalid, 3 Unknown, 0 Unchecked, 12.9s Time] [2025-03-09 00:25:38,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4115 states. [2025-03-09 00:25:38,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4115 to 4043. [2025-03-09 00:25:38,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4043 states, 3209 states have (on average 1.6512932377687752) internal successors, (5299), 3345 states have internal predecessors, (5299), 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-09 00:25:38,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4043 states to 4043 states and 7305 transitions. [2025-03-09 00:25:38,160 INFO L78 Accepts]: Start accepts. Automaton has 4043 states and 7305 transitions. Word has length 27 [2025-03-09 00:25:38,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:25:38,160 INFO L471 AbstractCegarLoop]: Abstraction has 4043 states and 7305 transitions. [2025-03-09 00:25:38,160 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 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-09 00:25:38,161 INFO L276 IsEmpty]: Start isEmpty. Operand 4043 states and 7305 transitions. [2025-03-09 00:25:38,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-03-09 00:25:38,161 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:25:38,161 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] [2025-03-09 00:25:38,161 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-09 00:25:38,162 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-09 00:25:38,162 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:25:38,162 INFO L85 PathProgramCache]: Analyzing trace with hash -1949680916, now seen corresponding path program 1 times [2025-03-09 00:25:38,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:25:38,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [747787713] [2025-03-09 00:25:38,163 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:25:38,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:25:38,217 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-09 00:25:38,228 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-09 00:25:38,228 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:25:38,228 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:25:38,269 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-09 00:25:38,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:25:38,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [747787713] [2025-03-09 00:25:38,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [747787713] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:25:38,270 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:25:38,270 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 00:25:38,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [840501089] [2025-03-09 00:25:38,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:25:38,270 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 00:25:38,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:25:38,270 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 00:25:38,271 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 00:25:38,271 INFO L87 Difference]: Start difference. First operand 4043 states and 7305 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 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-09 00:25:38,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:25:38,299 INFO L93 Difference]: Finished difference Result 2533 states and 4343 transitions. [2025-03-09 00:25:38,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 00:25:38,300 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 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 28 [2025-03-09 00:25:38,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:25:38,312 INFO L225 Difference]: With dead ends: 2533 [2025-03-09 00:25:38,312 INFO L226 Difference]: Without dead ends: 2533 [2025-03-09 00:25:38,312 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-09 00:25:38,313 INFO L435 NwaCegarLoop]: 444 mSDtfsCounter, 441 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 441 SdHoareTripleChecker+Valid, 444 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-09 00:25:38,314 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [441 Valid, 444 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 00:25:38,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2533 states. [2025-03-09 00:25:38,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2533 to 2533. [2025-03-09 00:25:38,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2533 states, 1999 states have (on average 1.4842421210605303) internal successors, (2967), 2055 states have internal predecessors, (2967), 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-09 00:25:38,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2533 states to 2533 states and 4343 transitions. [2025-03-09 00:25:38,374 INFO L78 Accepts]: Start accepts. Automaton has 2533 states and 4343 transitions. Word has length 28 [2025-03-09 00:25:38,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:25:38,374 INFO L471 AbstractCegarLoop]: Abstraction has 2533 states and 4343 transitions. [2025-03-09 00:25:38,374 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 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-09 00:25:38,375 INFO L276 IsEmpty]: Start isEmpty. Operand 2533 states and 4343 transitions. [2025-03-09 00:25:38,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-03-09 00:25:38,377 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:25:38,377 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-09 00:25:38,377 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-09 00:25:38,378 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-09 00:25:38,378 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:25:38,378 INFO L85 PathProgramCache]: Analyzing trace with hash -234699780, now seen corresponding path program 1 times [2025-03-09 00:25:38,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:25:38,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [993246050] [2025-03-09 00:25:38,378 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:25:38,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:25:38,446 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-09 00:25:38,456 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-09 00:25:38,456 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:25:38,456 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:25:38,513 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-09 00:25:38,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:25:38,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [993246050] [2025-03-09 00:25:38,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [993246050] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:25:38,513 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:25:38,513 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-09 00:25:38,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [319892626] [2025-03-09 00:25:38,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:25:38,514 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 00:25:38,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:25:38,514 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 00:25:38,514 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-09 00:25:38,514 INFO L87 Difference]: Start difference. First operand 2533 states and 4343 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-09 00:25:38,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:25:38,589 INFO L93 Difference]: Finished difference Result 5065 states and 8813 transitions. [2025-03-09 00:25:38,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-09 00:25:38,590 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-09 00:25:38,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:25:38,612 INFO L225 Difference]: With dead ends: 5065 [2025-03-09 00:25:38,612 INFO L226 Difference]: Without dead ends: 5065 [2025-03-09 00:25:38,612 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-09 00:25:38,613 INFO L435 NwaCegarLoop]: 511 mSDtfsCounter, 442 mSDsluCounter, 1440 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 443 SdHoareTripleChecker+Valid, 1951 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-09 00:25:38,613 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [443 Valid, 1951 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 00:25:38,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5065 states. [2025-03-09 00:25:38,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5065 to 4923. [2025-03-09 00:25:38,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4923 states, 3904 states have (on average 1.4938524590163935) internal successors, (5832), 4049 states have internal predecessors, (5832), 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-09 00:25:38,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4923 states to 4923 states and 8720 transitions. [2025-03-09 00:25:38,752 INFO L78 Accepts]: Start accepts. Automaton has 4923 states and 8720 transitions. Word has length 34 [2025-03-09 00:25:38,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:25:38,753 INFO L471 AbstractCegarLoop]: Abstraction has 4923 states and 8720 transitions. [2025-03-09 00:25:38,753 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-09 00:25:38,753 INFO L276 IsEmpty]: Start isEmpty. Operand 4923 states and 8720 transitions. [2025-03-09 00:25:38,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-03-09 00:25:38,754 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:25:38,754 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] [2025-03-09 00:25:38,754 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-09 00:25:38,755 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-09 00:25:38,756 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:25:38,756 INFO L85 PathProgramCache]: Analyzing trace with hash 1588203985, now seen corresponding path program 1 times [2025-03-09 00:25:38,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:25:38,756 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477457378] [2025-03-09 00:25:38,756 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:25:38,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:25:38,825 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-09 00:25:38,834 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-09 00:25:38,835 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:25:38,835 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat