./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/busybox-1.22.0/sleep-3.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/busybox-1.22.0/sleep-3.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 9c7796745953b6206348345fcef2fe39b8cd94bc666f8f6dde12d2e156216f8e --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-09 00:28:12,216 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-09 00:28:12,270 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf [2025-03-09 00:28:12,274 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-09 00:28:12,274 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-09 00:28:12,293 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-09 00:28:12,293 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-09 00:28:12,293 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-09 00:28:12,294 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-09 00:28:12,294 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-09 00:28:12,294 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-09 00:28:12,294 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-09 00:28:12,294 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-09 00:28:12,294 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-09 00:28:12,294 INFO L153 SettingsManager]: * Use SBE=true [2025-03-09 00:28:12,294 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-09 00:28:12,294 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-09 00:28:12,294 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-09 00:28:12,294 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-09 00:28:12,294 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-09 00:28:12,295 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-09 00:28:12,295 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-09 00:28:12,295 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-09 00:28:12,295 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-09 00:28:12,295 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-09 00:28:12,295 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-09 00:28:12,295 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-09 00:28:12,295 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-09 00:28:12,295 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-09 00:28:12,295 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-09 00:28:12,295 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 00:28:12,295 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-09 00:28:12,295 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-09 00:28:12,295 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-09 00:28:12,295 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-09 00:28:12,295 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-09 00:28:12,295 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-09 00:28:12,295 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-09 00:28:12,295 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-09 00:28:12,295 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 9c7796745953b6206348345fcef2fe39b8cd94bc666f8f6dde12d2e156216f8e [2025-03-09 00:28:12,522 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-09 00:28:12,527 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-09 00:28:12,529 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-09 00:28:12,530 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-09 00:28:12,530 INFO L274 PluginConnector]: CDTParser initialized [2025-03-09 00:28:12,531 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/busybox-1.22.0/sleep-3.i [2025-03-09 00:28:13,637 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/df0093f75/03226fccfae646b7b2776c817f2a039e/FLAG1b01d379b [2025-03-09 00:28:13,973 INFO L384 CDTParser]: Found 1 translation units. [2025-03-09 00:28:13,973 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/busybox-1.22.0/sleep-3.i [2025-03-09 00:28:13,996 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/df0093f75/03226fccfae646b7b2776c817f2a039e/FLAG1b01d379b [2025-03-09 00:28:14,202 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/df0093f75/03226fccfae646b7b2776c817f2a039e [2025-03-09 00:28:14,204 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-09 00:28:14,205 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-09 00:28:14,205 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-09 00:28:14,206 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-09 00:28:14,208 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-09 00:28:14,209 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 12:28:14" (1/1) ... [2025-03-09 00:28:14,210 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4fa3dbda and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:28:14, skipping insertion in model container [2025-03-09 00:28:14,210 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 12:28:14" (1/1) ... [2025-03-09 00:28:14,261 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-09 00:28:14,866 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-09 00:28:14,868 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-09 00:28:14,870 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-09 00:28:14,871 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-09 00:28:14,871 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-09 00:28:14,872 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-09 00:28:14,872 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-09 00:28:14,872 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-09 00:28:14,873 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-09 00:28:14,875 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-09 00:28:14,876 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-09 00:28:14,878 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-09 00:28:14,879 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-09 00:28:14,889 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-09 00:28:14,893 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-09 00:28:14,899 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-09 00:28:14,907 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-09 00:28:14,915 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-09 00:28:14,923 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-09 00:28:14,930 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 00:28:14,962 INFO L200 MainTranslator]: Completed pre-run [2025-03-09 00:28:15,057 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 00:28:15,183 WARN L1212 FunctionHandler]: The following functions are not defined or handled internally: vasprintf [2025-03-09 00:28:15,188 INFO L204 MainTranslator]: Completed translation [2025-03-09 00:28:15,189 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:28:15 WrapperNode [2025-03-09 00:28:15,189 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-09 00:28:15,189 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-09 00:28:15,190 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-09 00:28:15,190 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-09 00:28:15,194 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:28:15" (1/1) ... [2025-03-09 00:28:15,217 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:28:15" (1/1) ... [2025-03-09 00:28:15,259 INFO L138 Inliner]: procedures = 633, calls = 577, calls flagged for inlining = 17, calls inlined = 15, statements flattened = 1043 [2025-03-09 00:28:15,260 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-09 00:28:15,261 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-09 00:28:15,261 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-09 00:28:15,261 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-09 00:28:15,268 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:28:15" (1/1) ... [2025-03-09 00:28:15,268 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:28:15" (1/1) ... [2025-03-09 00:28:15,276 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:28:15" (1/1) ... [2025-03-09 00:28:15,294 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2025-03-09 00:28:15,295 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:28:15" (1/1) ... [2025-03-09 00:28:15,295 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:28:15" (1/1) ... [2025-03-09 00:28:15,324 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:28:15" (1/1) ... [2025-03-09 00:28:15,327 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:28:15" (1/1) ... [2025-03-09 00:28:15,332 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:28:15" (1/1) ... [2025-03-09 00:28:15,335 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:28:15" (1/1) ... [2025-03-09 00:28:15,342 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-09 00:28:15,343 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-09 00:28:15,343 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-09 00:28:15,343 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-09 00:28:15,344 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:28:15" (1/1) ... [2025-03-09 00:28:15,349 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 00:28:15,360 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 00:28:15,373 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-09 00:28:15,376 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-09 00:28:15,393 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-09 00:28:15,393 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2025-03-09 00:28:15,393 INFO L130 BoogieDeclarations]: Found specification of procedure xatoul_sfx [2025-03-09 00:28:15,393 INFO L138 BoogieDeclarations]: Found implementation of procedure xatoul_sfx [2025-03-09 00:28:15,393 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2025-03-09 00:28:15,394 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-09 00:28:15,394 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-09 00:28:15,394 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-09 00:28:15,394 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2025-03-09 00:28:15,394 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-09 00:28:15,394 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-09 00:28:15,394 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy [2025-03-09 00:28:15,394 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy [2025-03-09 00:28:15,394 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2025-03-09 00:28:15,394 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2025-03-09 00:28:15,394 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-09 00:28:15,394 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-09 00:28:15,394 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-09 00:28:15,394 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2025-03-09 00:28:15,394 INFO L130 BoogieDeclarations]: Found specification of procedure bb_show_usage [2025-03-09 00:28:15,394 INFO L138 BoogieDeclarations]: Found implementation of procedure bb_show_usage [2025-03-09 00:28:15,394 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-09 00:28:15,394 INFO L130 BoogieDeclarations]: Found specification of procedure bb_error_msg_and_die [2025-03-09 00:28:15,394 INFO L138 BoogieDeclarations]: Found implementation of procedure bb_error_msg_and_die [2025-03-09 00:28:15,394 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-09 00:28:15,688 INFO L256 CfgBuilder]: Building ICFG [2025-03-09 00:28:15,690 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-09 00:28:20,570 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2513: call ULTIMATE.dealloc(__main_~#ts~0#1.base, __main_~#ts~0#1.offset);havoc __main_~#ts~0#1.base, __main_~#ts~0#1.offset; [2025-03-09 00:28:20,570 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2689: havoc nanosleep_~tv_nsec~0#1, nanosleep_~tv_sec~0#1; [2025-03-09 00:28:20,806 INFO L? ?]: Removed 538 outVars from TransFormulas that were not future-live. [2025-03-09 00:28:20,806 INFO L307 CfgBuilder]: Performing block encoding [2025-03-09 00:28:20,844 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-09 00:28:20,847 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-09 00:28:20,847 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 12:28:20 BoogieIcfgContainer [2025-03-09 00:28:20,848 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-09 00:28:20,849 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-09 00:28:20,850 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-09 00:28:20,853 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-09 00:28:20,853 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.03 12:28:14" (1/3) ... [2025-03-09 00:28:20,854 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43baf57f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 12:28:20, skipping insertion in model container [2025-03-09 00:28:20,854 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:28:15" (2/3) ... [2025-03-09 00:28:20,854 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43baf57f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 12:28:20, skipping insertion in model container [2025-03-09 00:28:20,854 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 12:28:20" (3/3) ... [2025-03-09 00:28:20,855 INFO L128 eAbstractionObserver]: Analyzing ICFG sleep-3.i [2025-03-09 00:28:20,866 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-09 00:28:20,868 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG sleep-3.i that has 6 procedures, 500 locations, 1 initial locations, 14 loop locations, and 211 error locations. [2025-03-09 00:28:20,899 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-09 00:28:20,907 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;@70e8a555, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-09 00:28:20,909 INFO L334 AbstractCegarLoop]: Starting to check reachability of 211 error locations. [2025-03-09 00:28:20,913 INFO L276 IsEmpty]: Start isEmpty. Operand has 500 states, 269 states have (on average 1.9925650557620818) internal successors, (536), 482 states have internal predecessors, (536), 14 states have call successors, (14), 5 states have call predecessors, (14), 5 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-09 00:28:20,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2025-03-09 00:28:20,919 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:28:20,920 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2025-03-09 00:28:20,920 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr101REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [bb_error_msg_and_dieErr0ASSERT_VIOLATIONMEMORY_FREE, bb_error_msg_and_dieErr1ASSERT_VIOLATIONMEMORY_FREE, bb_error_msg_and_dieErr2ASSERT_VIOLATIONMEMORY_FREE (and 208 more)] === [2025-03-09 00:28:20,923 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:28:20,923 INFO L85 PathProgramCache]: Analyzing trace with hash 496467, now seen corresponding path program 1 times [2025-03-09 00:28:20,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:28:20,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [770050223] [2025-03-09 00:28:20,928 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:28:20,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:28:21,247 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-09 00:28:21,355 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-09 00:28:21,356 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:28:21,356 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:28:21,682 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:28:21,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:28:21,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [770050223] [2025-03-09 00:28:21,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [770050223] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:28:21,684 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:28:21,685 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 00:28:21,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2068004124] [2025-03-09 00:28:21,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:28:21,690 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 00:28:21,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:28:21,708 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 00:28:21,708 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 00:28:21,711 INFO L87 Difference]: Start difference. First operand has 500 states, 269 states have (on average 1.9925650557620818) internal successors, (536), 482 states have internal predecessors, (536), 14 states have call successors, (14), 5 states have call predecessors, (14), 5 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:28:25,740 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-09 00:28:26,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:28:26,075 INFO L93 Difference]: Finished difference Result 388 states and 424 transitions. [2025-03-09 00:28:26,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 00:28:26,077 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2025-03-09 00:28:26,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:28:26,083 INFO L225 Difference]: With dead ends: 388 [2025-03-09 00:28:26,084 INFO L226 Difference]: Without dead ends: 382 [2025-03-09 00:28:26,085 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 00:28:26,086 INFO L435 NwaCegarLoop]: 311 mSDtfsCounter, 102 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 190 mSolverCounterSat, 5 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 484 SdHoareTripleChecker+Invalid, 196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 190 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2025-03-09 00:28:26,087 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 484 Invalid, 196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 190 Invalid, 1 Unknown, 0 Unchecked, 4.3s Time] [2025-03-09 00:28:26,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2025-03-09 00:28:26,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 329. [2025-03-09 00:28:26,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 329 states, 175 states have (on average 1.9657142857142857) internal successors, (344), 319 states have internal predecessors, (344), 8 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-09 00:28:26,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 358 transitions. [2025-03-09 00:28:26,141 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 358 transitions. Word has length 3 [2025-03-09 00:28:26,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:28:26,141 INFO L471 AbstractCegarLoop]: Abstraction has 329 states and 358 transitions. [2025-03-09 00:28:26,141 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:28:26,143 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 358 transitions. [2025-03-09 00:28:26,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2025-03-09 00:28:26,144 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:28:26,144 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2025-03-09 00:28:26,144 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-09 00:28:26,144 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr102REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [bb_error_msg_and_dieErr0ASSERT_VIOLATIONMEMORY_FREE, bb_error_msg_and_dieErr1ASSERT_VIOLATIONMEMORY_FREE, bb_error_msg_and_dieErr2ASSERT_VIOLATIONMEMORY_FREE (and 208 more)] === [2025-03-09 00:28:26,145 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:28:26,146 INFO L85 PathProgramCache]: Analyzing trace with hash 496468, now seen corresponding path program 1 times [2025-03-09 00:28:26,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:28:26,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1137442599] [2025-03-09 00:28:26,146 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:28:26,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:28:26,296 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-09 00:28:26,343 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-09 00:28:26,343 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:28:26,343 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:28:26,615 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:28:26,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:28:26,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1137442599] [2025-03-09 00:28:26,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1137442599] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:28:26,616 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:28:26,616 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 00:28:26,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [128013414] [2025-03-09 00:28:26,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:28:26,617 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 00:28:26,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:28:26,618 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 00:28:26,618 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 00:28:26,618 INFO L87 Difference]: Start difference. First operand 329 states and 358 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:28:30,635 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-09 00:28:30,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:28:30,877 INFO L93 Difference]: Finished difference Result 328 states and 357 transitions. [2025-03-09 00:28:30,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 00:28:30,877 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2025-03-09 00:28:30,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:28:30,879 INFO L225 Difference]: With dead ends: 328 [2025-03-09 00:28:30,879 INFO L226 Difference]: Without dead ends: 328 [2025-03-09 00:28:30,879 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 00:28:30,879 INFO L435 NwaCegarLoop]: 350 mSDtfsCounter, 10 mSDsluCounter, 204 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 554 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2025-03-09 00:28:30,879 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 554 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 147 Invalid, 1 Unknown, 0 Unchecked, 4.2s Time] [2025-03-09 00:28:30,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2025-03-09 00:28:30,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 328. [2025-03-09 00:28:30,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 328 states, 175 states have (on average 1.96) internal successors, (343), 318 states have internal predecessors, (343), 8 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-09 00:28:30,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 357 transitions. [2025-03-09 00:28:30,894 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 357 transitions. Word has length 3 [2025-03-09 00:28:30,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:28:30,894 INFO L471 AbstractCegarLoop]: Abstraction has 328 states and 357 transitions. [2025-03-09 00:28:30,895 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:28:30,895 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 357 transitions. [2025-03-09 00:28:30,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-03-09 00:28:30,895 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:28:30,895 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-09 00:28:30,895 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-09 00:28:30,895 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr100REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [bb_error_msg_and_dieErr0ASSERT_VIOLATIONMEMORY_FREE, bb_error_msg_and_dieErr1ASSERT_VIOLATIONMEMORY_FREE, bb_error_msg_and_dieErr2ASSERT_VIOLATIONMEMORY_FREE (and 208 more)] === [2025-03-09 00:28:30,896 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:28:30,896 INFO L85 PathProgramCache]: Analyzing trace with hash 1905778430, now seen corresponding path program 1 times [2025-03-09 00:28:30,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:28:30,896 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1997426636] [2025-03-09 00:28:30,896 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:28:30,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:28:31,046 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-09 00:28:31,063 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-09 00:28:31,064 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:28:31,064 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:28:31,387 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:28:31,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:28:31,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1997426636] [2025-03-09 00:28:31,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1997426636] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:28:31,387 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:28:31,387 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 00:28:31,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [118308397] [2025-03-09 00:28:31,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:28:31,388 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 00:28:31,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:28:31,388 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 00:28:31,388 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-09 00:28:31,388 INFO L87 Difference]: Start difference. First operand 328 states and 357 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:28:35,407 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-09 00:28:39,425 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-09 00:28:39,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:28:39,655 INFO L93 Difference]: Finished difference Result 331 states and 360 transitions. [2025-03-09 00:28:39,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 00:28:39,655 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2025-03-09 00:28:39,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:28:39,657 INFO L225 Difference]: With dead ends: 331 [2025-03-09 00:28:39,657 INFO L226 Difference]: Without dead ends: 331 [2025-03-09 00:28:39,657 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-09 00:28:39,657 INFO L435 NwaCegarLoop]: 348 mSDtfsCounter, 11 mSDsluCounter, 206 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 1 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 554 SdHoareTripleChecker+Invalid, 161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.2s IncrementalHoareTripleChecker+Time [2025-03-09 00:28:39,657 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 554 Invalid, 161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 158 Invalid, 2 Unknown, 0 Unchecked, 8.2s Time] [2025-03-09 00:28:39,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2025-03-09 00:28:39,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 330. [2025-03-09 00:28:39,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 330 states, 177 states have (on average 1.9491525423728813) internal successors, (345), 320 states have internal predecessors, (345), 8 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-09 00:28:39,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 359 transitions. [2025-03-09 00:28:39,673 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 359 transitions. Word has length 6 [2025-03-09 00:28:39,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:28:39,673 INFO L471 AbstractCegarLoop]: Abstraction has 330 states and 359 transitions. [2025-03-09 00:28:39,673 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:28:39,673 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 359 transitions. [2025-03-09 00:28:39,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-03-09 00:28:39,673 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:28:39,674 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:28:39,674 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-09 00:28:39,674 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr100REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [bb_error_msg_and_dieErr0ASSERT_VIOLATIONMEMORY_FREE, bb_error_msg_and_dieErr1ASSERT_VIOLATIONMEMORY_FREE, bb_error_msg_and_dieErr2ASSERT_VIOLATIONMEMORY_FREE (and 208 more)] === [2025-03-09 00:28:39,674 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:28:39,674 INFO L85 PathProgramCache]: Analyzing trace with hash -127080369, now seen corresponding path program 1 times [2025-03-09 00:28:39,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:28:39,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [911690086] [2025-03-09 00:28:39,674 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:28:39,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:28:39,811 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-09 00:28:39,837 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-09 00:28:39,838 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:28:39,838 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:28:40,227 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:28:40,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:28:40,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [911690086] [2025-03-09 00:28:40,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [911690086] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 00:28:40,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1848129562] [2025-03-09 00:28:40,227 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:28:40,227 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:28:40,227 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 00:28:40,231 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 00:28:40,232 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-09 00:28:40,541 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-09 00:28:40,661 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-09 00:28:40,662 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:28:40,662 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:28:40,670 INFO L256 TraceCheckSpWp]: Trace formula consists of 1170 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-09 00:28:40,675 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 00:28:40,760 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:28:40,760 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 00:28:40,866 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2025-03-09 00:28:40,879 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:28:40,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1848129562] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 00:28:40,880 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 00:28:40,880 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 13 [2025-03-09 00:28:40,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1004325793] [2025-03-09 00:28:40,880 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 00:28:40,880 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-09 00:28:40,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:28:40,881 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-09 00:28:40,881 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2025-03-09 00:28:40,881 INFO L87 Difference]: Start difference. First operand 330 states and 359 transitions. Second operand has 14 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 14 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:28:44,902 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-09 00:28:48,906 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-09 00:28:52,909 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-09 00:28:56,918 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-09 00:29:00,921 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-09 00:29:04,927 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-09 00:29:08,942 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-09 00:29:12,945 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-09 00:29:16,952 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-09 00:29:20,963 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-09 00:29:21,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:29:21,695 INFO L93 Difference]: Finished difference Result 334 states and 363 transitions. [2025-03-09 00:29:21,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-09 00:29:21,696 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 14 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2025-03-09 00:29:21,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:29:21,697 INFO L225 Difference]: With dead ends: 334 [2025-03-09 00:29:21,697 INFO L226 Difference]: Without dead ends: 334 [2025-03-09 00:29:21,697 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=150, Unknown=0, NotChecked=0, Total=240 [2025-03-09 00:29:21,698 INFO L435 NwaCegarLoop]: 346 mSDtfsCounter, 221 mSDsluCounter, 1456 mSDsCounter, 0 mSdLazyCounter, 918 mSolverCounterSat, 6 mSolverCounterUnsat, 10 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 40.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 227 SdHoareTripleChecker+Valid, 1802 SdHoareTripleChecker+Invalid, 934 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 918 IncrementalHoareTripleChecker+Invalid, 10 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 40.7s IncrementalHoareTripleChecker+Time [2025-03-09 00:29:21,698 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [227 Valid, 1802 Invalid, 934 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 918 Invalid, 10 Unknown, 0 Unchecked, 40.7s Time] [2025-03-09 00:29:21,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2025-03-09 00:29:21,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 334. [2025-03-09 00:29:21,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 334 states, 182 states have (on average 1.9175824175824177) internal successors, (349), 324 states have internal predecessors, (349), 8 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-09 00:29:21,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 363 transitions. [2025-03-09 00:29:21,714 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 363 transitions. Word has length 9 [2025-03-09 00:29:21,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:29:21,715 INFO L471 AbstractCegarLoop]: Abstraction has 334 states and 363 transitions. [2025-03-09 00:29:21,715 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 14 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:29:21,716 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 363 transitions. [2025-03-09 00:29:21,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-03-09 00:29:21,716 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:29:21,717 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1] [2025-03-09 00:29:21,729 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-09 00:29:21,917 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:29:21,917 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr97REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [bb_error_msg_and_dieErr0ASSERT_VIOLATIONMEMORY_FREE, bb_error_msg_and_dieErr1ASSERT_VIOLATIONMEMORY_FREE, bb_error_msg_and_dieErr2ASSERT_VIOLATIONMEMORY_FREE (and 208 more)] === [2025-03-09 00:29:21,918 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:29:21,918 INFO L85 PathProgramCache]: Analyzing trace with hash -1313400498, now seen corresponding path program 1 times [2025-03-09 00:29:21,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:29:21,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [933347073] [2025-03-09 00:29:21,918 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:29:21,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:29:22,060 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-09 00:29:22,077 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-09 00:29:22,077 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:29:22,077 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:29:22,253 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:29:22,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:29:22,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [933347073] [2025-03-09 00:29:22,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [933347073] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 00:29:22,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1140977569] [2025-03-09 00:29:22,253 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:29:22,253 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:29:22,253 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 00:29:22,255 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 00:29:22,257 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-09 00:29:22,510 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-09 00:29:22,627 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-09 00:29:22,627 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:29:22,627 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:29:22,632 INFO L256 TraceCheckSpWp]: Trace formula consists of 1216 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-09 00:29:22,633 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 00:29:22,661 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:29:22,661 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 00:29:22,709 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:29:22,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1140977569] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 00:29:22,710 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 00:29:22,710 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2025-03-09 00:29:22,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [795514557] [2025-03-09 00:29:22,710 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 00:29:22,710 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-09 00:29:22,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:29:22,711 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-09 00:29:22,711 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2025-03-09 00:29:22,711 INFO L87 Difference]: Start difference. First operand 334 states and 363 transitions. Second operand has 11 states, 11 states have (on average 2.727272727272727) internal successors, (30), 11 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:29:22,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:29:22,754 INFO L93 Difference]: Finished difference Result 349 states and 378 transitions. [2025-03-09 00:29:22,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-09 00:29:22,755 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.727272727272727) internal successors, (30), 11 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2025-03-09 00:29:22,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:29:22,756 INFO L225 Difference]: With dead ends: 349 [2025-03-09 00:29:22,756 INFO L226 Difference]: Without dead ends: 349 [2025-03-09 00:29:22,756 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2025-03-09 00:29:22,756 INFO L435 NwaCegarLoop]: 353 mSDtfsCounter, 4 mSDsluCounter, 1050 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 1403 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 00:29:22,756 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 1403 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 00:29:22,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2025-03-09 00:29:22,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 349. [2025-03-09 00:29:22,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 349 states, 197 states have (on average 1.8477157360406091) internal successors, (364), 339 states have internal predecessors, (364), 8 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-09 00:29:22,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 378 transitions. [2025-03-09 00:29:22,765 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 378 transitions. Word has length 15 [2025-03-09 00:29:22,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:29:22,765 INFO L471 AbstractCegarLoop]: Abstraction has 349 states and 378 transitions. [2025-03-09 00:29:22,765 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.727272727272727) internal successors, (30), 11 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:29:22,766 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 378 transitions. [2025-03-09 00:29:22,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-03-09 00:29:22,766 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:29:22,766 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1] [2025-03-09 00:29:22,776 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-09 00:29:22,971 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:29:22,971 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr97REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [bb_error_msg_and_dieErr0ASSERT_VIOLATIONMEMORY_FREE, bb_error_msg_and_dieErr1ASSERT_VIOLATIONMEMORY_FREE, bb_error_msg_and_dieErr2ASSERT_VIOLATIONMEMORY_FREE (and 208 more)] === [2025-03-09 00:29:22,971 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:29:22,971 INFO L85 PathProgramCache]: Analyzing trace with hash -246089763, now seen corresponding path program 2 times [2025-03-09 00:29:22,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:29:22,971 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [959555653] [2025-03-09 00:29:22,971 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 00:29:22,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:29:23,154 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 30 statements into 2 equivalence classes. [2025-03-09 00:29:23,169 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 6 of 30 statements. [2025-03-09 00:29:23,169 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 00:29:23,169 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:29:23,393 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2025-03-09 00:29:23,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:29:23,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [959555653] [2025-03-09 00:29:23,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [959555653] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:29:23,394 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:29:23,394 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 00:29:23,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [554472040] [2025-03-09 00:29:23,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:29:23,394 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 00:29:23,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:29:23,395 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 00:29:23,395 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-03-09 00:29:23,395 INFO L87 Difference]: Start difference. First operand 349 states and 378 transitions. Second operand has 6 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:29:23,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:29:23,758 INFO L93 Difference]: Finished difference Result 497 states and 543 transitions. [2025-03-09 00:29:23,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 00:29:23,758 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2025-03-09 00:29:23,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:29:23,760 INFO L225 Difference]: With dead ends: 497 [2025-03-09 00:29:23,760 INFO L226 Difference]: Without dead ends: 497 [2025-03-09 00:29:23,760 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-03-09 00:29:23,760 INFO L435 NwaCegarLoop]: 259 mSDtfsCounter, 399 mSDsluCounter, 350 mSDsCounter, 0 mSdLazyCounter, 353 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 399 SdHoareTripleChecker+Valid, 609 SdHoareTripleChecker+Invalid, 376 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 353 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-09 00:29:23,761 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [399 Valid, 609 Invalid, 376 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 353 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-09 00:29:23,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 497 states. [2025-03-09 00:29:23,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 497 to 352. [2025-03-09 00:29:23,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 352 states, 200 states have (on average 1.83) internal successors, (366), 341 states have internal predecessors, (366), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-09 00:29:23,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 380 transitions. [2025-03-09 00:29:23,772 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 380 transitions. Word has length 30 [2025-03-09 00:29:23,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:29:23,772 INFO L471 AbstractCegarLoop]: Abstraction has 352 states and 380 transitions. [2025-03-09 00:29:23,772 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:29:23,772 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 380 transitions. [2025-03-09 00:29:23,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-03-09 00:29:23,773 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:29:23,773 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1] [2025-03-09 00:29:23,773 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-09 00:29:23,773 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr98REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [bb_error_msg_and_dieErr0ASSERT_VIOLATIONMEMORY_FREE, bb_error_msg_and_dieErr1ASSERT_VIOLATIONMEMORY_FREE, bb_error_msg_and_dieErr2ASSERT_VIOLATIONMEMORY_FREE (and 208 more)] === [2025-03-09 00:29:23,773 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:29:23,773 INFO L85 PathProgramCache]: Analyzing trace with hash -246089762, now seen corresponding path program 1 times [2025-03-09 00:29:23,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:29:23,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1372644443] [2025-03-09 00:29:23,776 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:29:23,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:29:23,913 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-09 00:29:23,932 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-09 00:29:23,933 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:29:23,933 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:29:24,209 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:29:24,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:29:24,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1372644443] [2025-03-09 00:29:24,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1372644443] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 00:29:24,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [740069144] [2025-03-09 00:29:24,210 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:29:24,210 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:29:24,210 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 00:29:24,212 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 00:29:24,213 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-09 00:29:24,466 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-09 00:29:24,582 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-09 00:29:24,582 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:29:24,582 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:29:24,587 INFO L256 TraceCheckSpWp]: Trace formula consists of 1321 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-09 00:29:24,589 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 00:29:24,645 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:29:24,645 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 00:29:24,748 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:29:24,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [740069144] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 00:29:24,749 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 00:29:24,749 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 13 [2025-03-09 00:29:24,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1537038032] [2025-03-09 00:29:24,749 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 00:29:24,749 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-09 00:29:24,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:29:24,750 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-09 00:29:24,750 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-03-09 00:29:24,750 INFO L87 Difference]: Start difference. First operand 352 states and 380 transitions. Second operand has 13 states, 13 states have (on average 3.0) internal successors, (39), 13 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:29:24,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:29:24,807 INFO L93 Difference]: Finished difference Result 358 states and 386 transitions. [2025-03-09 00:29:24,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-09 00:29:24,808 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.0) internal successors, (39), 13 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2025-03-09 00:29:24,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:29:24,809 INFO L225 Difference]: With dead ends: 358 [2025-03-09 00:29:24,809 INFO L226 Difference]: Without dead ends: 358 [2025-03-09 00:29:24,809 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 50 SyntacticMatches, 8 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-03-09 00:29:24,811 INFO L435 NwaCegarLoop]: 352 mSDtfsCounter, 2 mSDsluCounter, 1047 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1399 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 00:29:24,811 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1399 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 00:29:24,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2025-03-09 00:29:24,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 358. [2025-03-09 00:29:24,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 358 states, 206 states have (on average 1.8058252427184467) internal successors, (372), 347 states have internal predecessors, (372), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-09 00:29:24,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 358 states to 358 states and 386 transitions. [2025-03-09 00:29:24,819 INFO L78 Accepts]: Start accepts. Automaton has 358 states and 386 transitions. Word has length 30 [2025-03-09 00:29:24,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:29:24,820 INFO L471 AbstractCegarLoop]: Abstraction has 358 states and 386 transitions. [2025-03-09 00:29:24,820 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.0) internal successors, (39), 13 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:29:24,820 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 386 transitions. [2025-03-09 00:29:24,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-03-09 00:29:24,820 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:29:24,820 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1] [2025-03-09 00:29:24,830 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-09 00:29:25,020 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:29:25,021 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr98REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [bb_error_msg_and_dieErr0ASSERT_VIOLATIONMEMORY_FREE, bb_error_msg_and_dieErr1ASSERT_VIOLATIONMEMORY_FREE, bb_error_msg_and_dieErr2ASSERT_VIOLATIONMEMORY_FREE (and 208 more)] === [2025-03-09 00:29:25,021 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:29:25,021 INFO L85 PathProgramCache]: Analyzing trace with hash 1989675582, now seen corresponding path program 2 times [2025-03-09 00:29:25,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:29:25,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [567777949] [2025-03-09 00:29:25,021 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 00:29:25,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:29:25,151 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 36 statements into 2 equivalence classes. [2025-03-09 00:29:25,167 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 6 of 36 statements. [2025-03-09 00:29:25,167 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 00:29:25,167 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:29:25,384 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-09 00:29:25,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:29:25,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [567777949] [2025-03-09 00:29:25,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [567777949] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:29:25,385 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:29:25,385 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 00:29:25,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [540041821] [2025-03-09 00:29:25,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:29:25,385 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 00:29:25,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:29:25,386 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 00:29:25,386 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-09 00:29:25,386 INFO L87 Difference]: Start difference. First operand 358 states and 386 transitions. Second operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:29:29,403 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-09 00:29:29,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:29:29,982 INFO L93 Difference]: Finished difference Result 646 states and 701 transitions. [2025-03-09 00:29:29,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 00:29:29,983 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2025-03-09 00:29:29,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:29:29,985 INFO L225 Difference]: With dead ends: 646 [2025-03-09 00:29:29,985 INFO L226 Difference]: Without dead ends: 646 [2025-03-09 00:29:29,985 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-03-09 00:29:29,986 INFO L435 NwaCegarLoop]: 167 mSDtfsCounter, 539 mSDsluCounter, 404 mSDsCounter, 0 mSdLazyCounter, 548 mSolverCounterSat, 32 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 542 SdHoareTripleChecker+Valid, 571 SdHoareTripleChecker+Invalid, 581 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 548 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2025-03-09 00:29:29,986 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [542 Valid, 571 Invalid, 581 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 548 Invalid, 1 Unknown, 0 Unchecked, 4.6s Time] [2025-03-09 00:29:29,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 646 states. [2025-03-09 00:29:29,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 646 to 357. [2025-03-09 00:29:29,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 357 states, 206 states have (on average 1.8009708737864079) internal successors, (371), 346 states have internal predecessors, (371), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-09 00:29:29,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 385 transitions. [2025-03-09 00:29:29,998 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 385 transitions. Word has length 36 [2025-03-09 00:29:29,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:29:29,998 INFO L471 AbstractCegarLoop]: Abstraction has 357 states and 385 transitions. [2025-03-09 00:29:29,998 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:29:29,998 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 385 transitions. [2025-03-09 00:29:29,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-03-09 00:29:29,999 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:29:29,999 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:29:29,999 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-09 00:29:29,999 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr95REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [bb_error_msg_and_dieErr0ASSERT_VIOLATIONMEMORY_FREE, bb_error_msg_and_dieErr1ASSERT_VIOLATIONMEMORY_FREE, bb_error_msg_and_dieErr2ASSERT_VIOLATIONMEMORY_FREE (and 208 more)] === [2025-03-09 00:29:29,999 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:29:29,999 INFO L85 PathProgramCache]: Analyzing trace with hash 68005191, now seen corresponding path program 1 times [2025-03-09 00:29:29,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:29:29,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1730588179] [2025-03-09 00:29:29,999 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:29:29,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:29:30,164 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-09 00:29:30,198 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-09 00:29:30,199 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:29:30,199 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:29:30,394 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-09 00:29:30,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:29:30,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1730588179] [2025-03-09 00:29:30,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1730588179] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:29:30,394 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:29:30,394 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 00:29:30,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1011458908] [2025-03-09 00:29:30,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:29:30,394 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 00:29:30,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:29:30,395 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 00:29:30,395 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 00:29:30,395 INFO L87 Difference]: Start difference. First operand 357 states and 385 transitions. Second operand has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:29:34,411 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-09 00:29:34,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:29:34,633 INFO L93 Difference]: Finished difference Result 405 states and 438 transitions. [2025-03-09 00:29:34,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 00:29:34,634 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 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 44 [2025-03-09 00:29:34,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:29:34,635 INFO L225 Difference]: With dead ends: 405 [2025-03-09 00:29:34,635 INFO L226 Difference]: Without dead ends: 405 [2025-03-09 00:29:34,635 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 00:29:34,636 INFO L435 NwaCegarLoop]: 304 mSDtfsCounter, 80 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 185 mSolverCounterSat, 7 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 482 SdHoareTripleChecker+Invalid, 193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 185 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2025-03-09 00:29:34,636 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 482 Invalid, 193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 185 Invalid, 1 Unknown, 0 Unchecked, 4.2s Time] [2025-03-09 00:29:34,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 405 states. [2025-03-09 00:29:34,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 405 to 352. [2025-03-09 00:29:34,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 352 states, 206 states have (on average 1.7766990291262137) internal successors, (366), 341 states have internal predecessors, (366), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-09 00:29:34,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 380 transitions. [2025-03-09 00:29:34,646 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 380 transitions. Word has length 44 [2025-03-09 00:29:34,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:29:34,646 INFO L471 AbstractCegarLoop]: Abstraction has 352 states and 380 transitions. [2025-03-09 00:29:34,646 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:29:34,646 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 380 transitions. [2025-03-09 00:29:34,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-03-09 00:29:34,648 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:29:34,648 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:29:34,649 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-09 00:29:34,649 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr96REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [bb_error_msg_and_dieErr0ASSERT_VIOLATIONMEMORY_FREE, bb_error_msg_and_dieErr1ASSERT_VIOLATIONMEMORY_FREE, bb_error_msg_and_dieErr2ASSERT_VIOLATIONMEMORY_FREE (and 208 more)] === [2025-03-09 00:29:34,649 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:29:34,649 INFO L85 PathProgramCache]: Analyzing trace with hash 68005192, now seen corresponding path program 1 times [2025-03-09 00:29:34,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:29:34,649 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [341017119] [2025-03-09 00:29:34,649 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:29:34,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:29:34,791 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-09 00:29:34,878 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-09 00:29:34,878 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:29:34,878 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:29:35,429 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-09 00:29:35,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:29:35,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [341017119] [2025-03-09 00:29:35,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [341017119] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:29:35,429 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:29:35,429 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-09 00:29:35,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2057362103] [2025-03-09 00:29:35,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:29:35,430 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 00:29:35,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:29:35,430 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 00:29:35,430 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-09 00:29:35,430 INFO L87 Difference]: Start difference. First operand 352 states and 380 transitions. Second operand has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:29:39,446 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-09 00:29:39,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:29:39,659 INFO L93 Difference]: Finished difference Result 352 states and 381 transitions. [2025-03-09 00:29:39,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 00:29:39,659 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 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 44 [2025-03-09 00:29:39,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:29:39,660 INFO L225 Difference]: With dead ends: 352 [2025-03-09 00:29:39,660 INFO L226 Difference]: Without dead ends: 352 [2025-03-09 00:29:39,660 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-09 00:29:39,661 INFO L435 NwaCegarLoop]: 337 mSDtfsCounter, 191 mSDsluCounter, 1006 mSDsCounter, 0 mSdLazyCounter, 194 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 196 SdHoareTripleChecker+Valid, 1343 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 194 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2025-03-09 00:29:39,661 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [196 Valid, 1343 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 194 Invalid, 1 Unknown, 0 Unchecked, 4.2s Time] [2025-03-09 00:29:39,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352 states. [2025-03-09 00:29:39,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352 to 351. [2025-03-09 00:29:39,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 351 states, 206 states have (on average 1.7718446601941749) internal successors, (365), 340 states have internal predecessors, (365), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-09 00:29:39,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 379 transitions. [2025-03-09 00:29:39,667 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 379 transitions. Word has length 44 [2025-03-09 00:29:39,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:29:39,668 INFO L471 AbstractCegarLoop]: Abstraction has 351 states and 379 transitions. [2025-03-09 00:29:39,668 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:29:39,668 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 379 transitions. [2025-03-09 00:29:39,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-03-09 00:29:39,671 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:29:39,671 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:29:39,671 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-09 00:29:39,671 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr94REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [bb_error_msg_and_dieErr0ASSERT_VIOLATIONMEMORY_FREE, bb_error_msg_and_dieErr1ASSERT_VIOLATIONMEMORY_FREE, bb_error_msg_and_dieErr2ASSERT_VIOLATIONMEMORY_FREE (and 208 more)] === [2025-03-09 00:29:39,672 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:29:39,672 INFO L85 PathProgramCache]: Analyzing trace with hash -1281502598, now seen corresponding path program 1 times [2025-03-09 00:29:39,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:29:39,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [870634046] [2025-03-09 00:29:39,672 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:29:39,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:29:39,794 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-09 00:29:39,829 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-09 00:29:39,829 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:29:39,830 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:29:40,153 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-09 00:29:40,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:29:40,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [870634046] [2025-03-09 00:29:40,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [870634046] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:29:40,154 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:29:40,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-09 00:29:40,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1622237356] [2025-03-09 00:29:40,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:29:40,154 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 00:29:40,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:29:40,155 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 00:29:40,155 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-03-09 00:29:40,155 INFO L87 Difference]: Start difference. First operand 351 states and 379 transitions. Second operand has 6 states, 5 states have (on average 3.6) internal successors, (18), 6 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:29:44,172 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-09 00:29:44,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:29:44,613 INFO L93 Difference]: Finished difference Result 422 states and 458 transitions. [2025-03-09 00:29:44,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 00:29:44,614 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 6 states have internal predecessors, (18), 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 47 [2025-03-09 00:29:44,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:29:44,615 INFO L225 Difference]: With dead ends: 422 [2025-03-09 00:29:44,615 INFO L226 Difference]: Without dead ends: 422 [2025-03-09 00:29:44,615 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-03-09 00:29:44,616 INFO L435 NwaCegarLoop]: 284 mSDtfsCounter, 345 mSDsluCounter, 415 mSDsCounter, 0 mSdLazyCounter, 508 mSolverCounterSat, 11 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 350 SdHoareTripleChecker+Valid, 699 SdHoareTripleChecker+Invalid, 520 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 508 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2025-03-09 00:29:44,616 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [350 Valid, 699 Invalid, 520 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 508 Invalid, 1 Unknown, 0 Unchecked, 4.4s Time] [2025-03-09 00:29:44,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 422 states. [2025-03-09 00:29:44,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 422 to 364. [2025-03-09 00:29:44,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 364 states, 220 states have (on average 1.7545454545454546) internal successors, (386), 353 states have internal predecessors, (386), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-09 00:29:44,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 400 transitions. [2025-03-09 00:29:44,623 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 400 transitions. Word has length 47 [2025-03-09 00:29:44,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:29:44,624 INFO L471 AbstractCegarLoop]: Abstraction has 364 states and 400 transitions. [2025-03-09 00:29:44,624 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 6 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:29:44,624 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 400 transitions. [2025-03-09 00:29:44,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-03-09 00:29:44,624 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:29:44,624 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:29:44,624 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-09 00:29:44,625 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr79REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [bb_error_msg_and_dieErr0ASSERT_VIOLATIONMEMORY_FREE, bb_error_msg_and_dieErr1ASSERT_VIOLATIONMEMORY_FREE, bb_error_msg_and_dieErr2ASSERT_VIOLATIONMEMORY_FREE (and 208 more)] === [2025-03-09 00:29:44,625 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:29:44,625 INFO L85 PathProgramCache]: Analyzing trace with hash -1281503527, now seen corresponding path program 1 times [2025-03-09 00:29:44,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:29:44,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1974446256] [2025-03-09 00:29:44,626 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:29:44,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:29:44,752 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-09 00:29:44,775 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-09 00:29:44,776 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:29:44,776 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:29:44,969 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-09 00:29:44,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:29:44,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1974446256] [2025-03-09 00:29:44,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1974446256] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:29:44,970 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:29:44,970 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 00:29:44,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1823546446] [2025-03-09 00:29:44,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:29:44,971 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 00:29:44,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:29:44,971 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 00:29:44,971 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 00:29:44,972 INFO L87 Difference]: Start difference. First operand 364 states and 400 transitions. Second operand has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:29:48,989 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers []