./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 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/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-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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-?-551b009-m [2025-01-10 00:03:11,318 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 00:03:11,368 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf [2025-01-10 00:03:11,371 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 00:03:11,372 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 00:03:11,385 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 00:03:11,385 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 00:03:11,385 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 00:03:11,386 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 00:03:11,386 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 00:03:11,386 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-10 00:03:11,386 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-10 00:03:11,386 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 00:03:11,386 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 00:03:11,386 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 00:03:11,386 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 00:03:11,387 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 00:03:11,387 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 00:03:11,387 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-01-10 00:03:11,387 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-01-10 00:03:11,387 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-01-10 00:03:11,387 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-10 00:03:11,387 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-10 00:03:11,387 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 00:03:11,387 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 00:03:11,387 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 00:03:11,387 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-10 00:03:11,387 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 00:03:11,388 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 00:03:11,388 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 00:03:11,388 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 00:03:11,388 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 00:03:11,388 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 00:03:11,388 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 00:03:11,388 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 00:03:11,388 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 00:03:11,388 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 00:03:11,388 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-10 00:03:11,388 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 00:03:11,388 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-10 00:03:11,388 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-10 00:03:11,388 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-10 00:03:11,388 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-10 00:03:11,388 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-10 00:03:11,388 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-jdk21/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-01-10 00:03:11,598 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 00:03:11,606 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 00:03:11,607 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 00:03:11,608 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 00:03:11,608 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 00:03:11,609 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/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-01-10 00:03:12,735 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/aebd61e26/ff728bf1c81c499082b4eb6d0a019b2d/FLAGc2343ba68 [2025-01-10 00:03:13,097 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 00:03:13,098 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/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-01-10 00:03:13,111 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/aebd61e26/ff728bf1c81c499082b4eb6d0a019b2d/FLAGc2343ba68 [2025-01-10 00:03:13,295 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/aebd61e26/ff728bf1c81c499082b4eb6d0a019b2d [2025-01-10 00:03:13,297 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 00:03:13,298 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 00:03:13,302 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 00:03:13,302 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 00:03:13,305 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 00:03:13,309 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 12:03:13" (1/1) ... [2025-01-10 00:03:13,309 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@755a91b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:03:13, skipping insertion in model container [2025-01-10 00:03:13,309 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 12:03:13" (1/1) ... [2025-01-10 00:03:13,352 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 00:03:13,646 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 00:03:13,648 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 00:03:13,655 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 00:03:13,655 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 00:03:13,656 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 00:03:13,658 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 00:03:13,661 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 00:03:13,662 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 00:03:13,664 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 00:03:13,667 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 00:03:13,670 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 00:03:13,671 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 00:03:13,672 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 00:03:13,675 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 00:03:13,675 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 00:03:13,681 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 00:03:13,681 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 00:03:13,682 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 00:03:13,690 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 00:03:13,697 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 00:03:13,701 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 00:03:13,701 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 00:03:13,702 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 00:03:13,703 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 00:03:13,703 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 00:03:13,708 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 00:03:13,712 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 00:03:13,712 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 00:03:13,713 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 00:03:13,715 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 00:03:13,720 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 00:03:13,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-01-10 00:03:13,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-01-10 00:03:13,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-01-10 00:03:13,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-01-10 00:03:13,745 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 00:03:13,745 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 00:03:13,758 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 00:03:13,774 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 00:03:13,778 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 00:03:13,791 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 00:03:13,906 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 00:03:13,930 INFO L204 MainTranslator]: Completed translation [2025-01-10 00:03:13,931 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:03:13 WrapperNode [2025-01-10 00:03:13,931 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 00:03:13,932 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 00:03:13,932 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 00:03:13,932 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 00:03:13,938 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:03:13" (1/1) ... [2025-01-10 00:03:13,964 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:03:13" (1/1) ... [2025-01-10 00:03:14,010 INFO L138 Inliner]: procedures = 118, calls = 369, calls flagged for inlining = 54, calls inlined = 37, statements flattened = 914 [2025-01-10 00:03:14,010 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 00:03:14,011 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 00:03:14,011 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 00:03:14,011 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 00:03:14,024 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:03:13" (1/1) ... [2025-01-10 00:03:14,024 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:03:13" (1/1) ... [2025-01-10 00:03:14,033 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:03:13" (1/1) ... [2025-01-10 00:03:14,084 INFO L175 MemorySlicer]: Split 91 memory accesses to 9 slices as follows [2, 10, 4, 10, 26, 12, 22, 2, 3]. 29 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0, 0, 0, 0, 0, 0]. The 50 writes are split as follows [0, 9, 1, 3, 1, 12, 22, 0, 2]. [2025-01-10 00:03:14,087 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:03:13" (1/1) ... [2025-01-10 00:03:14,088 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:03:13" (1/1) ... [2025-01-10 00:03:14,111 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:03:13" (1/1) ... [2025-01-10 00:03:14,112 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:03:13" (1/1) ... [2025-01-10 00:03:14,117 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:03:13" (1/1) ... [2025-01-10 00:03:14,121 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:03:13" (1/1) ... [2025-01-10 00:03:14,127 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:03:13" (1/1) ... [2025-01-10 00:03:14,145 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 00:03:14,146 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 00:03:14,146 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 00:03:14,146 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 00:03:14,150 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:03:13" (1/1) ... [2025-01-10 00:03:14,153 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 00:03:14,165 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:03:14,176 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-10 00:03:14,182 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-10 00:03:14,196 INFO L130 BoogieDeclarations]: Found specification of procedure dev_get_drvdata [2025-01-10 00:03:14,196 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_get_drvdata [2025-01-10 00:03:14,196 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#0 [2025-01-10 00:03:14,196 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#1 [2025-01-10 00:03:14,196 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#2 [2025-01-10 00:03:14,196 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#3 [2025-01-10 00:03:14,196 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#4 [2025-01-10 00:03:14,196 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#5 [2025-01-10 00:03:14,196 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#6 [2025-01-10 00:03:14,196 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#7 [2025-01-10 00:03:14,197 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#8 [2025-01-10 00:03:14,197 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#0 [2025-01-10 00:03:14,197 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#1 [2025-01-10 00:03:14,197 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#2 [2025-01-10 00:03:14,197 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#3 [2025-01-10 00:03:14,197 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#4 [2025-01-10 00:03:14,200 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#5 [2025-01-10 00:03:14,200 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#6 [2025-01-10 00:03:14,200 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#7 [2025-01-10 00:03:14,200 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#8 [2025-01-10 00:03:14,200 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2025-01-10 00:03:14,200 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2025-01-10 00:03:14,200 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-10 00:03:14,201 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-10 00:03:14,201 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-01-10 00:03:14,201 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-01-10 00:03:14,201 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-01-10 00:03:14,201 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-01-10 00:03:14,201 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-01-10 00:03:14,201 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2025-01-10 00:03:14,201 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2025-01-10 00:03:14,204 INFO L130 BoogieDeclarations]: Found specification of procedure rtc_time_to_tm [2025-01-10 00:03:14,205 INFO L138 BoogieDeclarations]: Found implementation of procedure rtc_time_to_tm [2025-01-10 00:03:14,205 INFO L130 BoogieDeclarations]: Found specification of procedure tegra_rtc_proc [2025-01-10 00:03:14,205 INFO L138 BoogieDeclarations]: Found implementation of procedure tegra_rtc_proc [2025-01-10 00:03:14,205 INFO L130 BoogieDeclarations]: Found specification of procedure irq_set_irq_wake [2025-01-10 00:03:14,205 INFO L138 BoogieDeclarations]: Found implementation of procedure irq_set_irq_wake [2025-01-10 00:03:14,205 INFO L130 BoogieDeclarations]: Found specification of procedure outer_sync [2025-01-10 00:03:14,205 INFO L138 BoogieDeclarations]: Found implementation of procedure outer_sync [2025-01-10 00:03:14,205 INFO L130 BoogieDeclarations]: Found specification of procedure tegra_rtc_remove [2025-01-10 00:03:14,205 INFO L138 BoogieDeclarations]: Found implementation of procedure tegra_rtc_remove [2025-01-10 00:03:14,205 INFO L130 BoogieDeclarations]: Found specification of procedure tegra_rtc_shutdown [2025-01-10 00:03:14,205 INFO L138 BoogieDeclarations]: Found implementation of procedure tegra_rtc_shutdown [2025-01-10 00:03:14,205 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2025-01-10 00:03:14,205 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2025-01-10 00:03:14,205 INFO L130 BoogieDeclarations]: Found specification of procedure rtc_tm_to_time [2025-01-10 00:03:14,205 INFO L138 BoogieDeclarations]: Found implementation of procedure rtc_tm_to_time [2025-01-10 00:03:14,205 INFO L130 BoogieDeclarations]: Found specification of procedure __release_region [2025-01-10 00:03:14,205 INFO L138 BoogieDeclarations]: Found implementation of procedure __release_region [2025-01-10 00:03:14,205 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2025-01-10 00:03:14,205 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2025-01-10 00:03:14,205 INFO L130 BoogieDeclarations]: Found specification of procedure tegra_rtc_set_alarm [2025-01-10 00:03:14,205 INFO L138 BoogieDeclarations]: Found implementation of procedure tegra_rtc_set_alarm [2025-01-10 00:03:14,205 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-10 00:03:14,205 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-10 00:03:14,205 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-01-10 00:03:14,205 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-01-10 00:03:14,205 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-01-10 00:03:14,205 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-01-10 00:03:14,205 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-01-10 00:03:14,205 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2025-01-10 00:03:14,206 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2025-01-10 00:03:14,206 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2025-01-10 00:03:14,206 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2025-01-10 00:03:14,206 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_lock_check [2025-01-10 00:03:14,206 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_lock_check [2025-01-10 00:03:14,206 INFO L130 BoogieDeclarations]: Found specification of procedure tegra_rtc_alarm_irq_enable [2025-01-10 00:03:14,206 INFO L138 BoogieDeclarations]: Found implementation of procedure tegra_rtc_alarm_irq_enable [2025-01-10 00:03:14,206 INFO L130 BoogieDeclarations]: Found specification of procedure tegra_iounmap [2025-01-10 00:03:14,206 INFO L138 BoogieDeclarations]: Found implementation of procedure tegra_iounmap [2025-01-10 00:03:14,206 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-10 00:03:14,206 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-10 00:03:14,206 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-10 00:03:14,206 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 00:03:14,206 INFO L130 BoogieDeclarations]: Found specification of procedure rtc_device_unregister [2025-01-10 00:03:14,206 INFO L138 BoogieDeclarations]: Found implementation of procedure rtc_device_unregister [2025-01-10 00:03:14,206 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-01-10 00:03:14,206 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_irq_1 [2025-01-10 00:03:14,206 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_irq_1 [2025-01-10 00:03:14,206 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-01-10 00:03:14,206 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-01-10 00:03:14,206 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-01-10 00:03:14,206 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-01-10 00:03:14,206 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2025-01-10 00:03:14,206 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2025-01-10 00:03:14,206 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2025-01-10 00:03:14,206 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#7 [2025-01-10 00:03:14,206 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#8 [2025-01-10 00:03:14,206 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_err [2025-01-10 00:03:14,206 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_err [2025-01-10 00:03:14,206 INFO L130 BoogieDeclarations]: Found specification of procedure device_may_wakeup [2025-01-10 00:03:14,207 INFO L138 BoogieDeclarations]: Found implementation of procedure device_may_wakeup [2025-01-10 00:03:14,207 INFO L130 BoogieDeclarations]: Found specification of procedure spin_unlock_irqrestore [2025-01-10 00:03:14,207 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_unlock_irqrestore [2025-01-10 00:03:14,207 INFO L130 BoogieDeclarations]: Found specification of procedure platform_get_resource [2025-01-10 00:03:14,208 INFO L138 BoogieDeclarations]: Found implementation of procedure platform_get_resource [2025-01-10 00:03:14,208 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-10 00:03:14,208 INFO L130 BoogieDeclarations]: Found specification of procedure platform_set_drvdata [2025-01-10 00:03:14,208 INFO L138 BoogieDeclarations]: Found implementation of procedure platform_set_drvdata [2025-01-10 00:03:14,208 INFO L130 BoogieDeclarations]: Found specification of procedure platform_get_drvdata [2025-01-10 00:03:14,208 INFO L138 BoogieDeclarations]: Found implementation of procedure platform_get_drvdata [2025-01-10 00:03:14,208 INFO L130 BoogieDeclarations]: Found specification of procedure dev_err [2025-01-10 00:03:14,208 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_err [2025-01-10 00:03:14,208 INFO L130 BoogieDeclarations]: Found specification of procedure tegra_rtc_read_time [2025-01-10 00:03:14,208 INFO L138 BoogieDeclarations]: Found implementation of procedure tegra_rtc_read_time [2025-01-10 00:03:14,208 INFO L130 BoogieDeclarations]: Found specification of procedure tegra_rtc_wait_while_busy [2025-01-10 00:03:14,208 INFO L138 BoogieDeclarations]: Found implementation of procedure tegra_rtc_wait_while_busy [2025-01-10 00:03:14,208 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-10 00:03:14,208 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-10 00:03:14,208 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-10 00:03:14,208 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-01-10 00:03:14,209 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-01-10 00:03:14,209 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-01-10 00:03:14,209 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-01-10 00:03:14,209 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-01-10 00:03:14,209 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-01-10 00:03:14,209 INFO L130 BoogieDeclarations]: Found specification of procedure resource_size [2025-01-10 00:03:14,210 INFO L138 BoogieDeclarations]: Found implementation of procedure resource_size [2025-01-10 00:03:14,210 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2025-01-10 00:03:14,210 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2025-01-10 00:03:14,210 INFO L130 BoogieDeclarations]: Found specification of procedure tegra_rtc_set_time [2025-01-10 00:03:14,210 INFO L138 BoogieDeclarations]: Found implementation of procedure tegra_rtc_set_time [2025-01-10 00:03:14,210 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 00:03:14,210 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 00:03:14,456 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 00:03:14,457 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 00:03:14,638 INFO L727 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2025-01-10 00:03:19,367 INFO L? ?]: Removed 550 outVars from TransFormulas that were not future-live. [2025-01-10 00:03:19,367 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 00:03:19,382 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 00:03:19,382 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-10 00:03:19,383 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 12:03:19 BoogieIcfgContainer [2025-01-10 00:03:19,383 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 00:03:19,385 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-10 00:03:19,385 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-10 00:03:19,388 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-10 00:03:19,388 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 12:03:13" (1/3) ... [2025-01-10 00:03:19,389 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74a29f31 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 12:03:19, skipping insertion in model container [2025-01-10 00:03:19,389 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:03:13" (2/3) ... [2025-01-10 00:03:19,389 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74a29f31 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 12:03:19, skipping insertion in model container [2025-01-10 00:03:19,389 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 12:03:19" (3/3) ... [2025-01-10 00:03:19,390 INFO L128 eAbstractionObserver]: Analyzing ICFG linux-stable-9ec4f65-1-110_1a-drivers--rtc--rtc-tegra.ko-entry_point.cil.out.i [2025-01-10 00:03:19,401 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-10 00:03:19,405 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, 587 locations, 1 initial locations, 1 loop locations, and 111 error locations. [2025-01-10 00:03:19,439 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 00:03:19,455 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;@39742d44, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 00:03:19,455 INFO L334 AbstractCegarLoop]: Starting to check reachability of 111 error locations. [2025-01-10 00:03:19,464 INFO L276 IsEmpty]: Start isEmpty. Operand has 586 states, 363 states have (on average 1.5757575757575757) internal successors, (572), 483 states have internal predecessors, (572), 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-01-10 00:03:19,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-01-10 00:03:19,470 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:03:19,470 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:03:19,470 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE === [ldv_irq_1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_irq_1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_irq_1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 108 more)] === [2025-01-10 00:03:19,474 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:03:19,474 INFO L85 PathProgramCache]: Analyzing trace with hash -1089462937, now seen corresponding path program 1 times [2025-01-10 00:03:19,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:03:19,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [135522849] [2025-01-10 00:03:19,483 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:03:19,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:03:19,668 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-10 00:03:19,772 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-10 00:03:19,773 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:03:19,773 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:03:20,071 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:03:20,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:03:20,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [135522849] [2025-01-10 00:03:20,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [135522849] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:03:20,073 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:03:20,073 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 00:03:20,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1219388704] [2025-01-10 00:03:20,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:03:20,077 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 00:03:20,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:03:20,094 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 00:03:20,095 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 00:03:20,098 INFO L87 Difference]: Start difference. First operand has 586 states, 363 states have (on average 1.5757575757575757) internal successors, (572), 483 states have internal predecessors, (572), 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-01-10 00:03:24,116 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-01-10 00:03:28,122 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-01-10 00:03:32,130 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-01-10 00:03:33,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:03:33,504 INFO L93 Difference]: Finished difference Result 934 states and 1239 transitions. [2025-01-10 00:03:33,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 00:03:33,506 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-01-10 00:03:33,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:03:33,528 INFO L225 Difference]: With dead ends: 934 [2025-01-10 00:03:33,534 INFO L226 Difference]: Without dead ends: 920 [2025-01-10 00:03:33,536 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-01-10 00:03:33,543 INFO L435 NwaCegarLoop]: 542 mSDtfsCounter, 495 mSDsluCounter, 1184 mSDsCounter, 0 mSdLazyCounter, 1109 mSolverCounterSat, 158 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 516 SdHoareTripleChecker+Valid, 1726 SdHoareTripleChecker+Invalid, 1270 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 158 IncrementalHoareTripleChecker+Valid, 1109 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.3s IncrementalHoareTripleChecker+Time [2025-01-10 00:03:33,543 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [516 Valid, 1726 Invalid, 1270 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [158 Valid, 1109 Invalid, 3 Unknown, 0 Unchecked, 13.3s Time] [2025-01-10 00:03:33,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 920 states. [2025-01-10 00:03:33,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 920 to 824. [2025-01-10 00:03:33,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 824 states, 562 states have (on average 1.5765124555160142) internal successors, (886), 676 states have internal predecessors, (886), 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-01-10 00:03:33,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 824 states to 824 states and 1162 transitions. [2025-01-10 00:03:33,708 INFO L78 Accepts]: Start accepts. Automaton has 824 states and 1162 transitions. Word has length 10 [2025-01-10 00:03:33,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:03:33,708 INFO L471 AbstractCegarLoop]: Abstraction has 824 states and 1162 transitions. [2025-01-10 00:03:33,708 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-01-10 00:03:33,708 INFO L276 IsEmpty]: Start isEmpty. Operand 824 states and 1162 transitions. [2025-01-10 00:03:33,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-01-10 00:03:33,709 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:03:33,709 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:03:33,709 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-10 00:03:33,709 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE === [ldv_irq_1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_irq_1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_irq_1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 108 more)] === [2025-01-10 00:03:33,710 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:03:33,710 INFO L85 PathProgramCache]: Analyzing trace with hash 586387873, now seen corresponding path program 1 times [2025-01-10 00:03:33,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:03:33,710 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084777243] [2025-01-10 00:03:33,710 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:03:33,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:03:33,845 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-01-10 00:03:33,866 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-01-10 00:03:33,866 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:03:33,866 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:03:34,114 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:03:34,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:03:34,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1084777243] [2025-01-10 00:03:34,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1084777243] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:03:34,114 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:03:34,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 00:03:34,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [166428158] [2025-01-10 00:03:34,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:03:34,115 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 00:03:34,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:03:34,116 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 00:03:34,116 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 00:03:34,116 INFO L87 Difference]: Start difference. First operand 824 states and 1162 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-01-10 00:03:38,123 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-01-10 00:03:42,130 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-01-10 00:03:46,137 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-01-10 00:03:47,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:03:47,040 INFO L93 Difference]: Finished difference Result 1213 states and 1770 transitions. [2025-01-10 00:03:47,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 00:03:47,041 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-01-10 00:03:47,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:03:47,046 INFO L225 Difference]: With dead ends: 1213 [2025-01-10 00:03:47,047 INFO L226 Difference]: Without dead ends: 1213 [2025-01-10 00:03:47,047 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-01-10 00:03:47,047 INFO L435 NwaCegarLoop]: 501 mSDtfsCounter, 485 mSDsluCounter, 1138 mSDsCounter, 0 mSdLazyCounter, 1087 mSolverCounterSat, 146 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 508 SdHoareTripleChecker+Valid, 1639 SdHoareTripleChecker+Invalid, 1236 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 146 IncrementalHoareTripleChecker+Valid, 1087 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.9s IncrementalHoareTripleChecker+Time [2025-01-10 00:03:47,048 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [508 Valid, 1639 Invalid, 1236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [146 Valid, 1087 Invalid, 3 Unknown, 0 Unchecked, 12.9s Time] [2025-01-10 00:03:47,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1213 states. [2025-01-10 00:03:47,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1213 to 1141. [2025-01-10 00:03:47,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1141 states, 826 states have (on average 1.612590799031477) internal successors, (1332), 943 states have internal predecessors, (1332), 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-01-10 00:03:47,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1141 states to 1141 states and 1758 transitions. [2025-01-10 00:03:47,095 INFO L78 Accepts]: Start accepts. Automaton has 1141 states and 1758 transitions. Word has length 11 [2025-01-10 00:03:47,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:03:47,097 INFO L471 AbstractCegarLoop]: Abstraction has 1141 states and 1758 transitions. [2025-01-10 00:03:47,099 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-01-10 00:03:47,100 INFO L276 IsEmpty]: Start isEmpty. Operand 1141 states and 1758 transitions. [2025-01-10 00:03:47,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-01-10 00:03:47,101 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:03:47,101 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-01-10 00:03:47,101 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-10 00:03:47,102 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK === [ldv_irq_1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_irq_1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_irq_1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 108 more)] === [2025-01-10 00:03:47,102 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:03:47,102 INFO L85 PathProgramCache]: Analyzing trace with hash 1415478865, now seen corresponding path program 1 times [2025-01-10 00:03:47,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:03:47,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [108456419] [2025-01-10 00:03:47,102 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:03:47,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:03:47,171 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-01-10 00:03:47,184 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-01-10 00:03:47,186 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:03:47,187 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:03:47,251 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:03:47,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:03:47,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [108456419] [2025-01-10 00:03:47,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [108456419] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:03:47,252 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:03:47,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 00:03:47,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1590713916] [2025-01-10 00:03:47,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:03:47,252 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:03:47,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:03:47,252 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:03:47,252 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:03:47,253 INFO L87 Difference]: Start difference. First operand 1141 states and 1758 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-01-10 00:03:51,260 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-01-10 00:03:51,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:03:51,301 INFO L93 Difference]: Finished difference Result 2223 states and 3428 transitions. [2025-01-10 00:03:51,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:03:51,302 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-01-10 00:03:51,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:03:51,311 INFO L225 Difference]: With dead ends: 2223 [2025-01-10 00:03:51,311 INFO L226 Difference]: Without dead ends: 2223 [2025-01-10 00:03:51,311 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-01-10 00:03:51,313 INFO L435 NwaCegarLoop]: 705 mSDtfsCounter, 658 mSDsluCounter, 689 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 3 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 658 SdHoareTripleChecker+Valid, 1394 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2025-01-10 00:03:51,313 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [658 Valid, 1394 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 11 Invalid, 1 Unknown, 0 Unchecked, 4.0s Time] [2025-01-10 00:03:51,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2223 states. [2025-01-10 00:03:51,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2223 to 2111. [2025-01-10 00:03:51,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2111 states, 1603 states have (on average 1.618215845290081) internal successors, (2594), 1727 states have internal predecessors, (2594), 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-01-10 00:03:51,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2111 states to 2111 states and 3424 transitions. [2025-01-10 00:03:51,393 INFO L78 Accepts]: Start accepts. Automaton has 2111 states and 3424 transitions. Word has length 24 [2025-01-10 00:03:51,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:03:51,393 INFO L471 AbstractCegarLoop]: Abstraction has 2111 states and 3424 transitions. [2025-01-10 00:03:51,393 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-01-10 00:03:51,394 INFO L276 IsEmpty]: Start isEmpty. Operand 2111 states and 3424 transitions. [2025-01-10 00:03:51,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-01-10 00:03:51,395 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:03:51,395 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-01-10 00:03:51,395 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-10 00:03:51,395 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE === [ldv_irq_1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_irq_1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_irq_1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 108 more)] === [2025-01-10 00:03:51,395 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:03:51,395 INFO L85 PathProgramCache]: Analyzing trace with hash 526955571, now seen corresponding path program 1 times [2025-01-10 00:03:51,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:03:51,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1997651349] [2025-01-10 00:03:51,395 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:03:51,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:03:51,448 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-01-10 00:03:51,464 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-01-10 00:03:51,465 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:03:51,466 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:03:51,708 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 00:03:51,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:03:51,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1997651349] [2025-01-10 00:03:51,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1997651349] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:03:51,708 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:03:51,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-10 00:03:51,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1246164220] [2025-01-10 00:03:51,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:03:51,709 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-10 00:03:51,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:03:51,709 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-10 00:03:51,709 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-01-10 00:03:51,709 INFO L87 Difference]: Start difference. First operand 2111 states and 3424 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-01-10 00:03:55,715 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-01-10 00:03:59,727 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-01-10 00:04:03,731 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-01-10 00:04:07,736 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-01-10 00:04:11,741 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-01-10 00:04:13,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:04:13,364 INFO L93 Difference]: Finished difference Result 2686 states and 4409 transitions. [2025-01-10 00:04:13,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-10 00:04:13,365 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-01-10 00:04:13,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:04:13,378 INFO L225 Difference]: With dead ends: 2686 [2025-01-10 00:04:13,378 INFO L226 Difference]: Without dead ends: 2686 [2025-01-10 00:04:13,379 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-01-10 00:04:13,379 INFO L435 NwaCegarLoop]: 564 mSDtfsCounter, 823 mSDsluCounter, 1556 mSDsCounter, 0 mSdLazyCounter, 1721 mSolverCounterSat, 300 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 21.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 863 SdHoareTripleChecker+Valid, 2120 SdHoareTripleChecker+Invalid, 2026 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 300 IncrementalHoareTripleChecker+Valid, 1721 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 21.5s IncrementalHoareTripleChecker+Time [2025-01-10 00:04:13,380 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [863 Valid, 2120 Invalid, 2026 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [300 Valid, 1721 Invalid, 5 Unknown, 0 Unchecked, 21.5s Time] [2025-01-10 00:04:13,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2686 states. [2025-01-10 00:04:13,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2686 to 2168. [2025-01-10 00:04:13,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2168 states, 1649 states have (on average 1.6173438447543966) internal successors, (2667), 1774 states have internal predecessors, (2667), 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-01-10 00:04:13,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2168 states to 2168 states and 3597 transitions. [2025-01-10 00:04:13,447 INFO L78 Accepts]: Start accepts. Automaton has 2168 states and 3597 transitions. Word has length 27 [2025-01-10 00:04:13,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:04:13,447 INFO L471 AbstractCegarLoop]: Abstraction has 2168 states and 3597 transitions. [2025-01-10 00:04:13,447 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-01-10 00:04:13,447 INFO L276 IsEmpty]: Start isEmpty. Operand 2168 states and 3597 transitions. [2025-01-10 00:04:13,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-01-10 00:04:13,450 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:04:13,450 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-01-10 00:04:13,451 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-10 00:04:13,451 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE === [ldv_irq_1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_irq_1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_irq_1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 108 more)] === [2025-01-10 00:04:13,451 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:04:13,451 INFO L85 PathProgramCache]: Analyzing trace with hash -844245931, now seen corresponding path program 1 times [2025-01-10 00:04:13,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:04:13,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [83106653] [2025-01-10 00:04:13,451 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:04:13,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:04:13,536 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-01-10 00:04:13,557 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-01-10 00:04:13,557 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:04:13,557 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:04:13,957 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 00:04:13,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:04:13,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [83106653] [2025-01-10 00:04:13,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [83106653] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:04:13,957 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:04:13,958 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-10 00:04:13,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1396571037] [2025-01-10 00:04:13,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:04:13,958 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-10 00:04:13,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:04:13,960 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-10 00:04:13,960 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-01-10 00:04:13,960 INFO L87 Difference]: Start difference. First operand 2168 states and 3597 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-01-10 00:04:17,968 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-01-10 00:04:21,979 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-01-10 00:04:25,982 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-01-10 00:04:29,992 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-01-10 00:04:34,002 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-01-10 00:04:38,011 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-01-10 00:04:40,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:04:40,380 INFO L93 Difference]: Finished difference Result 3889 states and 6752 transitions. [2025-01-10 00:04:40,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-10 00:04:40,381 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-01-10 00:04:40,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:04:40,439 INFO L225 Difference]: With dead ends: 3889 [2025-01-10 00:04:40,439 INFO L226 Difference]: Without dead ends: 3889 [2025-01-10 00:04:40,439 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-01-10 00:04:40,441 INFO L435 NwaCegarLoop]: 653 mSDtfsCounter, 904 mSDsluCounter, 2659 mSDsCounter, 0 mSdLazyCounter, 3003 mSolverCounterSat, 230 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 26.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 953 SdHoareTripleChecker+Valid, 3312 SdHoareTripleChecker+Invalid, 3239 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 230 IncrementalHoareTripleChecker+Valid, 3003 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 26.3s IncrementalHoareTripleChecker+Time [2025-01-10 00:04:40,441 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [953 Valid, 3312 Invalid, 3239 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [230 Valid, 3003 Invalid, 6 Unknown, 0 Unchecked, 26.3s Time] [2025-01-10 00:04:40,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3889 states. [2025-01-10 00:04:40,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3889 to 3741. [2025-01-10 00:04:40,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3741 states, 2956 states have (on average 1.6505412719891746) internal successors, (4879), 3090 states have internal predecessors, (4879), 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-01-10 00:04:40,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3741 states to 3741 states and 6718 transitions. [2025-01-10 00:04:40,660 INFO L78 Accepts]: Start accepts. Automaton has 3741 states and 6718 transitions. Word has length 28 [2025-01-10 00:04:40,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:04:40,661 INFO L471 AbstractCegarLoop]: Abstraction has 3741 states and 6718 transitions. [2025-01-10 00:04:40,661 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-01-10 00:04:40,661 INFO L276 IsEmpty]: Start isEmpty. Operand 3741 states and 6718 transitions. [2025-01-10 00:04:40,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-01-10 00:04:40,662 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:04:40,662 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-01-10 00:04:40,663 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-10 00:04:40,663 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting tegra_rtc_procErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ldv_irq_1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_irq_1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_irq_1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 108 more)] === [2025-01-10 00:04:40,664 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:04:40,667 INFO L85 PathProgramCache]: Analyzing trace with hash -45831897, now seen corresponding path program 1 times [2025-01-10 00:04:40,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:04:40,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1094334053] [2025-01-10 00:04:40,668 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:04:40,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:04:40,778 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-01-10 00:04:40,801 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-01-10 00:04:40,801 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:04:40,801 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:04:40,903 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:04:40,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:04:40,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1094334053] [2025-01-10 00:04:40,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1094334053] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:04:40,904 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:04:40,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 00:04:40,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1801191597] [2025-01-10 00:04:40,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:04:40,905 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:04:40,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:04:40,905 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:04:40,905 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:04:40,905 INFO L87 Difference]: Start difference. First operand 3741 states and 6718 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-01-10 00:04:40,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:04:40,927 INFO L93 Difference]: Finished difference Result 2349 states and 4002 transitions. [2025-01-10 00:04:40,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:04:40,928 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-01-10 00:04:40,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:04:40,938 INFO L225 Difference]: With dead ends: 2349 [2025-01-10 00:04:40,938 INFO L226 Difference]: Without dead ends: 2349 [2025-01-10 00:04:40,938 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-01-10 00:04:40,940 INFO L435 NwaCegarLoop]: 447 mSDtfsCounter, 441 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 441 SdHoareTripleChecker+Valid, 447 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 00:04:40,941 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [441 Valid, 447 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 00:04:40,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2349 states. [2025-01-10 00:04:40,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2349 to 2349. [2025-01-10 00:04:40,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2349 states, 1848 states have (on average 1.4864718614718615) internal successors, (2747), 1904 states have internal predecessors, (2747), 374 states have call successors, (374), 48 states have call predecessors, (374), 78 states have return successors, (881), 400 states have call predecessors, (881), 373 states have call successors, (881) [2025-01-10 00:04:41,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2349 states to 2349 states and 4002 transitions. [2025-01-10 00:04:41,001 INFO L78 Accepts]: Start accepts. Automaton has 2349 states and 4002 transitions. Word has length 28 [2025-01-10 00:04:41,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:04:41,001 INFO L471 AbstractCegarLoop]: Abstraction has 2349 states and 4002 transitions. [2025-01-10 00:04:41,001 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-01-10 00:04:41,001 INFO L276 IsEmpty]: Start isEmpty. Operand 2349 states and 4002 transitions. [2025-01-10 00:04:41,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-01-10 00:04:41,002 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:04:41,002 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-01-10 00:04:41,002 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-10 00:04:41,002 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK === [ldv_irq_1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_irq_1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_irq_1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 108 more)] === [2025-01-10 00:04:41,003 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:04:41,003 INFO L85 PathProgramCache]: Analyzing trace with hash 1792258725, now seen corresponding path program 1 times [2025-01-10 00:04:41,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:04:41,003 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1506740859] [2025-01-10 00:04:41,003 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:04:41,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:04:41,057 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-01-10 00:04:41,102 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-01-10 00:04:41,102 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:04:41,102 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:04:41,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-01-10 00:04:41,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:04:41,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1506740859] [2025-01-10 00:04:41,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1506740859] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:04:41,269 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:04:41,269 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 00:04:41,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2069215528] [2025-01-10 00:04:41,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:04:41,270 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 00:04:41,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:04:41,270 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 00:04:41,270 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 00:04:41,270 INFO L87 Difference]: Start difference. First operand 2349 states and 4002 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-01-10 00:04:45,280 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-01-10 00:04:49,287 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-01-10 00:04:53,299 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-01-10 00:04:54,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:04:54,020 INFO L93 Difference]: Finished difference Result 2568 states and 4350 transitions. [2025-01-10 00:04:54,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 00:04:54,021 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-01-10 00:04:54,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:04:54,033 INFO L225 Difference]: With dead ends: 2568 [2025-01-10 00:04:54,033 INFO L226 Difference]: Without dead ends: 2563 [2025-01-10 00:04:54,034 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-01-10 00:04:54,034 INFO L435 NwaCegarLoop]: 471 mSDtfsCounter, 316 mSDsluCounter, 970 mSDsCounter, 0 mSdLazyCounter, 725 mSolverCounterSat, 84 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 331 SdHoareTripleChecker+Valid, 1441 SdHoareTripleChecker+Invalid, 812 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 725 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.7s IncrementalHoareTripleChecker+Time [2025-01-10 00:04:54,035 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [331 Valid, 1441 Invalid, 812 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 725 Invalid, 3 Unknown, 0 Unchecked, 12.7s Time] [2025-01-10 00:04:54,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2563 states. [2025-01-10 00:04:54,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2563 to 2533. [2025-01-10 00:04:54,102 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-01-10 00:04:54,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2533 states to 2533 states and 4343 transitions. [2025-01-10 00:04:54,112 INFO L78 Accepts]: Start accepts. Automaton has 2533 states and 4343 transitions. Word has length 27 [2025-01-10 00:04:54,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:04:54,113 INFO L471 AbstractCegarLoop]: Abstraction has 2533 states and 4343 transitions. [2025-01-10 00:04:54,113 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-01-10 00:04:54,113 INFO L276 IsEmpty]: Start isEmpty. Operand 2533 states and 4343 transitions. [2025-01-10 00:04:54,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-01-10 00:04:54,115 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:04:54,115 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-01-10 00:04:54,115 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-10 00:04:54,116 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_irq_1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ldv_irq_1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_irq_1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_irq_1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 108 more)] === [2025-01-10 00:04:54,116 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:04:54,116 INFO L85 PathProgramCache]: Analyzing trace with hash -1546565995, now seen corresponding path program 1 times [2025-01-10 00:04:54,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:04:54,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [478377776] [2025-01-10 00:04:54,116 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:04:54,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:04:54,201 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-01-10 00:04:54,209 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-01-10 00:04:54,209 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:04:54,209 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:04:54,277 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:04:54,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:04:54,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [478377776] [2025-01-10 00:04:54,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [478377776] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:04:54,278 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:04:54,278 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 00:04:54,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1928611883] [2025-01-10 00:04:54,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:04:54,278 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 00:04:54,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:04:54,279 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 00:04:54,279 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 00:04:54,279 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-01-10 00:04:54,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:04:54,368 INFO L93 Difference]: Finished difference Result 5065 states and 8813 transitions. [2025-01-10 00:04:54,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-10 00:04:54,368 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-01-10 00:04:54,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:04:54,397 INFO L225 Difference]: With dead ends: 5065 [2025-01-10 00:04:54,397 INFO L226 Difference]: Without dead ends: 5065 [2025-01-10 00:04:54,397 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-01-10 00:04:54,398 INFO L435 NwaCegarLoop]: 514 mSDtfsCounter, 442 mSDsluCounter, 1449 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 443 SdHoareTripleChecker+Valid, 1963 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 00:04:54,398 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [443 Valid, 1963 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 00:04:54,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5065 states. [2025-01-10 00:04:54,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5065 to 4923. [2025-01-10 00:04:54,526 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-01-10 00:04:54,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4923 states to 4923 states and 8720 transitions. [2025-01-10 00:04:54,550 INFO L78 Accepts]: Start accepts. Automaton has 4923 states and 8720 transitions. Word has length 34 [2025-01-10 00:04:54,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:04:54,551 INFO L471 AbstractCegarLoop]: Abstraction has 4923 states and 8720 transitions. [2025-01-10 00:04:54,551 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-01-10 00:04:54,551 INFO L276 IsEmpty]: Start isEmpty. Operand 4923 states and 8720 transitions. [2025-01-10 00:04:54,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-01-10 00:04:54,551 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:04:54,552 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] [2025-01-10 00:04:54,552 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-10 00:04:54,552 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_irq_1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ldv_irq_1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_irq_1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_irq_1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 108 more)] === [2025-01-10 00:04:54,552 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:04:54,552 INFO L85 PathProgramCache]: Analyzing trace with hash 732702859, now seen corresponding path program 1 times [2025-01-10 00:04:54,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:04:54,552 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [21805039] [2025-01-10 00:04:54,552 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:04:54,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:04:54,643 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-01-10 00:04:54,652 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-01-10 00:04:54,653 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:04:54,653 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:04:54,722 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:04:54,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:04:54,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [21805039] [2025-01-10 00:04:54,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [21805039] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:04:54,723 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:04:54,723 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 00:04:54,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [774589266] [2025-01-10 00:04:54,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:04:54,724 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 00:04:54,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:04:54,724 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 00:04:54,724 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 00:04:54,725 INFO L87 Difference]: Start difference. First operand 4923 states and 8720 transitions. Second operand has 5 states, 5 states have (on average 5.6) internal successors, (28), 4 states have internal predecessors, (28), 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-01-10 00:04:54,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:04:54,796 INFO L93 Difference]: Finished difference Result 4947 states and 8648 transitions. [2025-01-10 00:04:54,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 00:04:54,797 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 4 states have internal predecessors, (28), 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 35 [2025-01-10 00:04:54,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:04:54,821 INFO L225 Difference]: With dead ends: 4947 [2025-01-10 00:04:54,821 INFO L226 Difference]: Without dead ends: 4947 [2025-01-10 00:04:54,821 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-01-10 00:04:54,822 INFO L435 NwaCegarLoop]: 445 mSDtfsCounter, 437 mSDsluCounter, 877 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 438 SdHoareTripleChecker+Valid, 1322 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 00:04:54,822 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [438 Valid, 1322 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 00:04:54,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4947 states. [2025-01-10 00:04:54,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4947 to 4913. [2025-01-10 00:04:54,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4913 states, 3912 states have (on average 1.4897750511247443) internal successors, (5828), 4037 states have internal predecessors, (5828), 792 states have call successors, (792), 99 states have call predecessors, (792), 160 states have return successors, (1976), 784 states have call predecessors, (1976), 791 states have call successors, (1976) [2025-01-10 00:04:54,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4913 states to 4913 states and 8596 transitions. [2025-01-10 00:04:54,952 INFO L78 Accepts]: Start accepts. Automaton has 4913 states and 8596 transitions. Word has length 35 [2025-01-10 00:04:54,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:04:54,952 INFO L471 AbstractCegarLoop]: Abstraction has 4913 states and 8596 transitions. [2025-01-10 00:04:54,953 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 4 states have internal predecessors, (28), 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-01-10 00:04:54,953 INFO L276 IsEmpty]: Start isEmpty. Operand 4913 states and 8596 transitions. [2025-01-10 00:04:54,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-01-10 00:04:54,955 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:04:54,955 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] [2025-01-10 00:04:54,955 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-10 00:04:54,955 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_irq_1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ldv_irq_1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_irq_1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_irq_1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 108 more)] === [2025-01-10 00:04:54,956 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:04:54,956 INFO L85 PathProgramCache]: Analyzing trace with hash 391818226, now seen corresponding path program 1 times [2025-01-10 00:04:54,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:04:54,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [522286742] [2025-01-10 00:04:54,956 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:04:54,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:04:55,045 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-01-10 00:04:55,052 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-01-10 00:04:55,052 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:04:55,052 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:04:55,136 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:04:55,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:04:55,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [522286742] [2025-01-10 00:04:55,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [522286742] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:04:55,137 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:04:55,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 00:04:55,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2086084286] [2025-01-10 00:04:55,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:04:55,137 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 00:04:55,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:04:55,138 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 00:04:55,138 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 00:04:55,139 INFO L87 Difference]: Start difference. First operand 4913 states and 8596 transitions. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 4 states have internal predecessors, (29), 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-01-10 00:04:55,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:04:55,207 INFO L93 Difference]: Finished difference Result 4937 states and 8524 transitions. [2025-01-10 00:04:55,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 00:04:55,208 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 4 states have internal predecessors, (29), 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 36 [2025-01-10 00:04:55,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:04:55,227 INFO L225 Difference]: With dead ends: 4937 [2025-01-10 00:04:55,227 INFO L226 Difference]: Without dead ends: 4937 [2025-01-10 00:04:55,227 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-01-10 00:04:55,228 INFO L435 NwaCegarLoop]: 444 mSDtfsCounter, 435 mSDsluCounter, 875 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 436 SdHoareTripleChecker+Valid, 1319 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 00:04:55,228 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [436 Valid, 1319 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 00:04:55,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4937 states. [2025-01-10 00:04:55,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4937 to 4903. [2025-01-10 00:04:55,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4903 states, 3920 states have (on average 1.4857142857142858) internal successors, (5824), 4025 states have internal predecessors, (5824), 772 states have call successors, (772), 101 states have call predecessors, (772), 162 states have return successors, (1876), 784 states have call predecessors, (1876), 771 states have call successors, (1876) [2025-01-10 00:04:55,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4903 states to 4903 states and 8472 transitions. [2025-01-10 00:04:55,356 INFO L78 Accepts]: Start accepts. Automaton has 4903 states and 8472 transitions. Word has length 36 [2025-01-10 00:04:55,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:04:55,356 INFO L471 AbstractCegarLoop]: Abstraction has 4903 states and 8472 transitions. [2025-01-10 00:04:55,356 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 4 states have internal predecessors, (29), 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-01-10 00:04:55,357 INFO L276 IsEmpty]: Start isEmpty. Operand 4903 states and 8472 transitions. [2025-01-10 00:04:55,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-01-10 00:04:55,358 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:04:55,358 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-01-10 00:04:55,358 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-10 00:04:55,358 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_irq_1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ldv_irq_1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_irq_1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_irq_1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 108 more)] === [2025-01-10 00:04:55,359 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:04:55,359 INFO L85 PathProgramCache]: Analyzing trace with hash 430554120, now seen corresponding path program 1 times [2025-01-10 00:04:55,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:04:55,359 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1567603019] [2025-01-10 00:04:55,359 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:04:55,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:04:55,445 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-01-10 00:04:55,453 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-01-10 00:04:55,455 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:04:55,455 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:04:55,530 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:04:55,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:04:55,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1567603019] [2025-01-10 00:04:55,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1567603019] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:04:55,531 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:04:55,531 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 00:04:55,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [611180928] [2025-01-10 00:04:55,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:04:55,532 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 00:04:55,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:04:55,532 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 00:04:55,532 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 00:04:55,533 INFO L87 Difference]: Start difference. First operand 4903 states and 8472 transitions. Second operand has 5 states, 5 states have (on average 6.0) internal successors, (30), 4 states have internal predecessors, (30), 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-01-10 00:04:55,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:04:55,606 INFO L93 Difference]: Finished difference Result 4753 states and 8134 transitions. [2025-01-10 00:04:55,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 00:04:55,607 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 4 states have internal predecessors, (30), 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 37 [2025-01-10 00:04:55,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:04:55,622 INFO L225 Difference]: With dead ends: 4753 [2025-01-10 00:04:55,622 INFO L226 Difference]: Without dead ends: 4753 [2025-01-10 00:04:55,622 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-01-10 00:04:55,622 INFO L435 NwaCegarLoop]: 443 mSDtfsCounter, 433 mSDsluCounter, 873 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 434 SdHoareTripleChecker+Valid, 1316 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 00:04:55,623 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [434 Valid, 1316 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 00:04:55,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4753 states.