./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/busybox-1.22.0/head-2.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/busybox-1.22.0/head-2.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 215d23787da0121fe1d31fb918e95ec539d610f21ad7af0cf3de67b0df205419 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 09:13:54,949 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 09:13:55,011 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf [2025-03-04 09:13:55,016 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 09:13:55,017 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 09:13:55,040 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 09:13:55,041 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 09:13:55,041 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 09:13:55,042 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 09:13:55,042 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 09:13:55,042 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 09:13:55,043 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 09:13:55,043 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 09:13:55,043 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 09:13:55,043 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 09:13:55,044 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 09:13:55,044 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 09:13:55,044 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 09:13:55,044 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-04 09:13:55,044 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-04 09:13:55,044 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-04 09:13:55,044 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 09:13:55,044 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-04 09:13:55,044 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 09:13:55,044 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 09:13:55,045 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 09:13:55,045 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 09:13:55,045 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 09:13:55,045 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 09:13:55,045 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 09:13:55,045 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 09:13:55,045 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 09:13:55,046 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 09:13:55,046 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 09:13:55,046 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 09:13:55,046 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 09:13:55,046 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 09:13:55,046 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 09:13:55,046 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 09:13:55,046 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 -> 215d23787da0121fe1d31fb918e95ec539d610f21ad7af0cf3de67b0df205419 [2025-03-04 09:13:55,293 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 09:13:55,302 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 09:13:55,304 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 09:13:55,309 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 09:13:55,310 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 09:13:55,311 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/busybox-1.22.0/head-2.i [2025-03-04 09:13:56,572 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/49bab613e/c9cbfcfaf46c48f395b77f0d01f74806/FLAG49f3bb25b [2025-03-04 09:13:56,932 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 09:13:56,933 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/busybox-1.22.0/head-2.i [2025-03-04 09:13:56,960 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/49bab613e/c9cbfcfaf46c48f395b77f0d01f74806/FLAG49f3bb25b [2025-03-04 09:13:57,133 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/49bab613e/c9cbfcfaf46c48f395b77f0d01f74806 [2025-03-04 09:13:57,135 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 09:13:57,136 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 09:13:57,137 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 09:13:57,137 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 09:13:57,140 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 09:13:57,141 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 09:13:57" (1/1) ... [2025-03-04 09:13:57,142 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@866fe6e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:13:57, skipping insertion in model container [2025-03-04 09:13:57,142 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 09:13:57" (1/1) ... [2025-03-04 09:13:57,191 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 09:13:57,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-04 09:13:57,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-04 09:13:57,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-04 09:13:57,882 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-04 09:13:57,882 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-04 09:13:57,883 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-04 09:13:57,885 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-04 09:13:57,885 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-04 09:13:57,886 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-04 09:13:57,886 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-04 09:13:57,888 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-04 09:13:57,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-04 09:13:57,897 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-04 09:13:57,898 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-04 09:13:57,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-04 09:13:57,900 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-04 09:13:57,900 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-04 09:13:57,901 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-04 09:13:57,901 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-04 09:13:57,905 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-04 09:13:57,906 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-04 09:13:57,908 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-04 09:13:57,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-04 09:13:57,920 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-04 09:13:57,920 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-04 09:13:57,932 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-04 09:13:57,937 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-04 09:13:57,939 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-04 09:13:57,944 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-04 09:13:57,945 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-04 09:13:57,947 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-04 09:13:57,952 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-04 09:13:57,952 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-04 09:13:57,953 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-04 09:13:57,954 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-04 09:13:57,954 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-04 09:13:57,957 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-04 09:13:57,964 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-04 09:13:57,968 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-04 09:13:57,984 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-04 09:13:57,991 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 09:13:58,024 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 09:13:58,173 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 09:13:58,342 WARN L1212 FunctionHandler]: The following functions are not defined or handled internally: vasprintf [2025-03-04 09:13:58,350 INFO L204 MainTranslator]: Completed translation [2025-03-04 09:13:58,351 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:13:58 WrapperNode [2025-03-04 09:13:58,351 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 09:13:58,352 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 09:13:58,352 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 09:13:58,352 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 09:13:58,357 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:13:58" (1/1) ... [2025-03-04 09:13:58,399 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:13:58" (1/1) ... [2025-03-04 09:13:58,476 INFO L138 Inliner]: procedures = 581, calls = 697, calls flagged for inlining = 30, calls inlined = 28, statements flattened = 1394 [2025-03-04 09:13:58,477 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 09:13:58,477 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 09:13:58,477 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 09:13:58,478 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 09:13:58,484 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:13:58" (1/1) ... [2025-03-04 09:13:58,484 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:13:58" (1/1) ... [2025-03-04 09:13:58,496 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:13:58" (1/1) ... [2025-03-04 09:13:58,553 INFO L175 MemorySlicer]: Split 566 memory accesses to 19 slices as follows [47, 2, 4, 18, 3, 2, 15, 32, 9, 7, 3, 24, 20, 9, 3, 10, 355, 2, 1]. 63 percent of accesses are in the largest equivalence class. The 379 initializations are split as follows [2, 2, 1, 0, 3, 2, 0, 2, 1, 0, 0, 0, 4, 0, 0, 7, 355, 0, 0]. The 120 writes are split as follows [35, 0, 1, 4, 0, 0, 1, 21, 4, 7, 0, 21, 15, 6, 3, 0, 0, 1, 1]. [2025-03-04 09:13:58,553 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:13:58" (1/1) ... [2025-03-04 09:13:58,553 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:13:58" (1/1) ... [2025-03-04 09:13:58,609 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:13:58" (1/1) ... [2025-03-04 09:13:58,615 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:13:58" (1/1) ... [2025-03-04 09:13:58,637 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:13:58" (1/1) ... [2025-03-04 09:13:58,649 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:13:58" (1/1) ... [2025-03-04 09:13:58,715 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 09:13:58,718 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 09:13:58,719 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 09:13:58,719 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 09:13:58,720 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:13:58" (1/1) ... [2025-03-04 09:13:58,724 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 09:13:58,734 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 09:13:58,753 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 09:13:58,758 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 09:13:58,775 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#0 [2025-03-04 09:13:58,775 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#1 [2025-03-04 09:13:58,775 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#2 [2025-03-04 09:13:58,775 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#3 [2025-03-04 09:13:58,775 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#4 [2025-03-04 09:13:58,776 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#5 [2025-03-04 09:13:58,776 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#6 [2025-03-04 09:13:58,776 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#7 [2025-03-04 09:13:58,776 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#8 [2025-03-04 09:13:58,776 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#9 [2025-03-04 09:13:58,776 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#10 [2025-03-04 09:13:58,776 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#11 [2025-03-04 09:13:58,776 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#12 [2025-03-04 09:13:58,776 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#13 [2025-03-04 09:13:58,776 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#14 [2025-03-04 09:13:58,776 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#15 [2025-03-04 09:13:58,776 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#16 [2025-03-04 09:13:58,776 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#17 [2025-03-04 09:13:58,778 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#18 [2025-03-04 09:13:58,778 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#0 [2025-03-04 09:13:58,778 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#1 [2025-03-04 09:13:58,778 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#2 [2025-03-04 09:13:58,778 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#3 [2025-03-04 09:13:58,778 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#4 [2025-03-04 09:13:58,778 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#5 [2025-03-04 09:13:58,778 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#6 [2025-03-04 09:13:58,778 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#7 [2025-03-04 09:13:58,778 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#8 [2025-03-04 09:13:58,778 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#9 [2025-03-04 09:13:58,778 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#10 [2025-03-04 09:13:58,778 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#11 [2025-03-04 09:13:58,779 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#12 [2025-03-04 09:13:58,779 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#13 [2025-03-04 09:13:58,779 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#14 [2025-03-04 09:13:58,779 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#15 [2025-03-04 09:13:58,779 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#16 [2025-03-04 09:13:58,779 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#17 [2025-03-04 09:13:58,779 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#18 [2025-03-04 09:13:58,779 INFO L130 BoogieDeclarations]: Found specification of procedure _IO_getc [2025-03-04 09:13:58,779 INFO L138 BoogieDeclarations]: Found implementation of procedure _IO_getc [2025-03-04 09:13:58,779 INFO L130 BoogieDeclarations]: Found specification of procedure xrealloc [2025-03-04 09:13:58,779 INFO L138 BoogieDeclarations]: Found implementation of procedure xrealloc [2025-03-04 09:13:58,779 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-04 09:13:58,779 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#0 [2025-03-04 09:13:58,779 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#1 [2025-03-04 09:13:58,779 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#2 [2025-03-04 09:13:58,779 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#3 [2025-03-04 09:13:58,779 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#4 [2025-03-04 09:13:58,779 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#5 [2025-03-04 09:13:58,779 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#6 [2025-03-04 09:13:58,779 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#7 [2025-03-04 09:13:58,779 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#8 [2025-03-04 09:13:58,779 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#9 [2025-03-04 09:13:58,779 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#10 [2025-03-04 09:13:58,779 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#11 [2025-03-04 09:13:58,779 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#12 [2025-03-04 09:13:58,779 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#13 [2025-03-04 09:13:58,779 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#14 [2025-03-04 09:13:58,779 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#15 [2025-03-04 09:13:58,779 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#16 [2025-03-04 09:13:58,779 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#17 [2025-03-04 09:13:58,779 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#18 [2025-03-04 09:13:58,779 INFO L130 BoogieDeclarations]: Found specification of procedure bb_verror_msg [2025-03-04 09:13:58,779 INFO L138 BoogieDeclarations]: Found implementation of procedure bb_verror_msg [2025-03-04 09:13:58,779 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#0 [2025-03-04 09:13:58,779 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#1 [2025-03-04 09:13:58,779 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#2 [2025-03-04 09:13:58,779 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#3 [2025-03-04 09:13:58,780 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#4 [2025-03-04 09:13:58,780 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#5 [2025-03-04 09:13:58,780 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#6 [2025-03-04 09:13:58,780 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#7 [2025-03-04 09:13:58,780 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#8 [2025-03-04 09:13:58,780 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#9 [2025-03-04 09:13:58,780 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#10 [2025-03-04 09:13:58,780 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#11 [2025-03-04 09:13:58,780 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#12 [2025-03-04 09:13:58,780 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#13 [2025-03-04 09:13:58,780 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#14 [2025-03-04 09:13:58,780 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#15 [2025-03-04 09:13:58,780 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#16 [2025-03-04 09:13:58,780 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#17 [2025-03-04 09:13:58,780 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#18 [2025-03-04 09:13:58,780 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 09:13:58,780 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 09:13:58,780 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-04 09:13:58,780 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-04 09:13:58,780 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-03-04 09:13:58,780 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-03-04 09:13:58,780 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-03-04 09:13:58,780 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2025-03-04 09:13:58,780 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2025-03-04 09:13:58,780 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2025-03-04 09:13:58,782 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2025-03-04 09:13:58,782 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2025-03-04 09:13:58,782 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2025-03-04 09:13:58,783 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#13 [2025-03-04 09:13:58,783 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#14 [2025-03-04 09:13:58,783 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#15 [2025-03-04 09:13:58,783 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#16 [2025-03-04 09:13:58,783 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#17 [2025-03-04 09:13:58,783 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#18 [2025-03-04 09:13:58,783 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-04 09:13:58,783 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 09:13:58,783 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-04 09:13:58,783 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-04 09:13:58,783 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-04 09:13:58,783 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-03-04 09:13:58,783 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2025-03-04 09:13:58,783 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2025-03-04 09:13:58,783 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2025-03-04 09:13:58,783 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#7 [2025-03-04 09:13:58,783 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#8 [2025-03-04 09:13:58,783 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#9 [2025-03-04 09:13:58,783 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#10 [2025-03-04 09:13:58,783 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#11 [2025-03-04 09:13:58,783 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#12 [2025-03-04 09:13:58,783 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#13 [2025-03-04 09:13:58,783 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#14 [2025-03-04 09:13:58,783 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#15 [2025-03-04 09:13:58,783 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#16 [2025-03-04 09:13:58,783 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#17 [2025-03-04 09:13:58,783 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#18 [2025-03-04 09:13:58,783 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 09:13:58,783 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 09:13:58,783 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#0 [2025-03-04 09:13:58,783 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#1 [2025-03-04 09:13:58,783 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#2 [2025-03-04 09:13:58,783 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#3 [2025-03-04 09:13:58,783 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#4 [2025-03-04 09:13:58,783 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#5 [2025-03-04 09:13:58,783 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#6 [2025-03-04 09:13:58,783 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#7 [2025-03-04 09:13:58,783 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#8 [2025-03-04 09:13:58,784 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#9 [2025-03-04 09:13:58,784 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#10 [2025-03-04 09:13:58,784 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#11 [2025-03-04 09:13:58,784 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#12 [2025-03-04 09:13:58,784 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#13 [2025-03-04 09:13:58,784 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#14 [2025-03-04 09:13:58,784 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#15 [2025-03-04 09:13:58,784 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#16 [2025-03-04 09:13:58,784 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#17 [2025-03-04 09:13:58,784 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#18 [2025-03-04 09:13:58,784 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#0 [2025-03-04 09:13:58,784 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#1 [2025-03-04 09:13:58,784 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#2 [2025-03-04 09:13:58,784 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#3 [2025-03-04 09:13:58,784 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#4 [2025-03-04 09:13:58,784 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#5 [2025-03-04 09:13:58,784 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#6 [2025-03-04 09:13:58,784 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#7 [2025-03-04 09:13:58,784 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#8 [2025-03-04 09:13:58,784 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#9 [2025-03-04 09:13:58,784 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#10 [2025-03-04 09:13:58,784 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#11 [2025-03-04 09:13:58,784 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#12 [2025-03-04 09:13:58,784 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#13 [2025-03-04 09:13:58,784 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#14 [2025-03-04 09:13:58,784 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#15 [2025-03-04 09:13:58,784 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#16 [2025-03-04 09:13:58,784 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#17 [2025-03-04 09:13:58,784 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#18 [2025-03-04 09:13:58,784 INFO L130 BoogieDeclarations]: Found specification of procedure xmalloc [2025-03-04 09:13:58,784 INFO L138 BoogieDeclarations]: Found implementation of procedure xmalloc [2025-03-04 09:13:58,784 INFO L130 BoogieDeclarations]: Found specification of procedure getopt [2025-03-04 09:13:58,784 INFO L138 BoogieDeclarations]: Found implementation of procedure getopt [2025-03-04 09:13:58,787 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#0 [2025-03-04 09:13:58,787 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#1 [2025-03-04 09:13:58,787 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#2 [2025-03-04 09:13:58,787 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#3 [2025-03-04 09:13:58,787 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#4 [2025-03-04 09:13:58,787 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#5 [2025-03-04 09:13:58,787 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#6 [2025-03-04 09:13:58,787 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#7 [2025-03-04 09:13:58,787 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#8 [2025-03-04 09:13:58,787 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#9 [2025-03-04 09:13:58,787 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#10 [2025-03-04 09:13:58,787 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#11 [2025-03-04 09:13:58,787 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#12 [2025-03-04 09:13:58,787 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#13 [2025-03-04 09:13:58,788 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#14 [2025-03-04 09:13:58,788 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#15 [2025-03-04 09:13:58,788 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#16 [2025-03-04 09:13:58,788 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#17 [2025-03-04 09:13:58,788 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#18 [2025-03-04 09:13:58,788 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#0 [2025-03-04 09:13:58,788 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#1 [2025-03-04 09:13:58,788 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#2 [2025-03-04 09:13:58,788 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#3 [2025-03-04 09:13:58,788 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#4 [2025-03-04 09:13:58,788 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#5 [2025-03-04 09:13:58,788 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#6 [2025-03-04 09:13:58,788 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#7 [2025-03-04 09:13:58,788 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#8 [2025-03-04 09:13:58,788 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#9 [2025-03-04 09:13:58,788 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#10 [2025-03-04 09:13:58,788 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#11 [2025-03-04 09:13:58,788 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#12 [2025-03-04 09:13:58,788 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#13 [2025-03-04 09:13:58,788 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#14 [2025-03-04 09:13:58,788 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#15 [2025-03-04 09:13:58,788 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#16 [2025-03-04 09:13:58,788 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#17 [2025-03-04 09:13:58,788 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#18 [2025-03-04 09:13:58,788 INFO L130 BoogieDeclarations]: Found specification of procedure bb_simple_perror_msg [2025-03-04 09:13:58,788 INFO L138 BoogieDeclarations]: Found implementation of procedure bb_simple_perror_msg [2025-03-04 09:13:58,788 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 09:13:58,788 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 09:13:58,788 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-04 09:13:58,788 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-04 09:13:58,788 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-04 09:13:58,788 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-04 09:13:58,789 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-03-04 09:13:58,789 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2025-03-04 09:13:58,789 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2025-03-04 09:13:58,789 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2025-03-04 09:13:58,789 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#7 [2025-03-04 09:13:58,789 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#8 [2025-03-04 09:13:58,789 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#9 [2025-03-04 09:13:58,789 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#10 [2025-03-04 09:13:58,789 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#11 [2025-03-04 09:13:58,789 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#12 [2025-03-04 09:13:58,789 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#13 [2025-03-04 09:13:58,789 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#14 [2025-03-04 09:13:58,789 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#15 [2025-03-04 09:13:58,789 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#16 [2025-03-04 09:13:58,789 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#17 [2025-03-04 09:13:58,789 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#18 [2025-03-04 09:13:58,789 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 09:13:58,789 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 09:13:58,789 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-04 09:13:58,789 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-04 09:13:58,789 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-03-04 09:13:58,789 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-03-04 09:13:58,789 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-03-04 09:13:58,789 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2025-03-04 09:13:58,789 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2025-03-04 09:13:58,789 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2025-03-04 09:13:58,789 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2025-03-04 09:13:58,789 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2025-03-04 09:13:58,789 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2025-03-04 09:13:58,789 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#13 [2025-03-04 09:13:58,789 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#14 [2025-03-04 09:13:58,789 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#15 [2025-03-04 09:13:58,789 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#16 [2025-03-04 09:13:58,789 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#17 [2025-03-04 09:13:58,789 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#18 [2025-03-04 09:13:58,789 INFO L130 BoogieDeclarations]: Found specification of procedure xmalloc_fgets [2025-03-04 09:13:58,789 INFO L138 BoogieDeclarations]: Found implementation of procedure xmalloc_fgets [2025-03-04 09:13:58,789 INFO L130 BoogieDeclarations]: Found specification of procedure bb_error_msg_and_die [2025-03-04 09:13:58,789 INFO L138 BoogieDeclarations]: Found implementation of procedure bb_error_msg_and_die [2025-03-04 09:13:58,789 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 09:13:58,789 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 09:13:58,789 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-04 09:13:58,789 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-04 09:13:58,789 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-04 09:13:58,792 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-03-04 09:13:58,792 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-03-04 09:13:58,792 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-03-04 09:13:58,792 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-03-04 09:13:58,792 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-03-04 09:13:58,792 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-03-04 09:13:58,792 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2025-03-04 09:13:58,792 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2025-03-04 09:13:58,792 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2025-03-04 09:13:58,792 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2025-03-04 09:13:58,792 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2025-03-04 09:13:58,792 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#16 [2025-03-04 09:13:58,792 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#17 [2025-03-04 09:13:58,792 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#18 [2025-03-04 09:13:59,234 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 09:13:59,236 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 09:13:59,460 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2863: havoc #t~nondet150; [2025-03-04 09:14:00,071 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2773: call ULTIMATE.dealloc(~#i~0#1.base, ~#i~0#1.offset);havoc ~#i~0#1.base, ~#i~0#1.offset; [2025-03-04 09:14:05,573 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2420: havoc fclose_if_not_stdin_#t~bitwise80#1; [2025-03-04 09:14:05,573 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2492: call ULTIMATE.dealloc(__main_~#negative_N~0#1.base, __main_~#negative_N~0#1.offset);havoc __main_~#negative_N~0#1.base, __main_~#negative_N~0#1.offset; [2025-03-04 09:14:05,812 INFO L? ?]: Removed 962 outVars from TransFormulas that were not future-live. [2025-03-04 09:14:05,815 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 09:14:05,858 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 09:14:05,858 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 09:14:05,858 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 09:14:05 BoogieIcfgContainer [2025-03-04 09:14:05,861 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 09:14:05,862 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 09:14:05,862 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 09:14:05,865 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 09:14:05,865 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 09:13:57" (1/3) ... [2025-03-04 09:14:05,866 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c83fe82 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 09:14:05, skipping insertion in model container [2025-03-04 09:14:05,866 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:13:58" (2/3) ... [2025-03-04 09:14:05,867 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c83fe82 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 09:14:05, skipping insertion in model container [2025-03-04 09:14:05,867 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 09:14:05" (3/3) ... [2025-03-04 09:14:05,868 INFO L128 eAbstractionObserver]: Analyzing ICFG head-2.i [2025-03-04 09:14:05,881 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 09:14:05,887 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG head-2.i that has 48 procedures, 1055 locations, 1 initial locations, 41 loop locations, and 359 error locations. [2025-03-04 09:14:05,920 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 09:14:05,932 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;@366a045d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 09:14:05,932 INFO L334 AbstractCegarLoop]: Starting to check reachability of 359 error locations. [2025-03-04 09:14:05,937 INFO L276 IsEmpty]: Start isEmpty. Operand has 716 states, 424 states have (on average 1.8820754716981132) internal successors, (798), 678 states have internal predecessors, (798), 29 states have call successors, (29), 12 states have call predecessors, (29), 12 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2025-03-04 09:14:05,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2025-03-04 09:14:05,942 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:14:05,942 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2025-03-04 09:14:05,942 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr152REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [getoptErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, getoptErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, getoptErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 356 more)] === [2025-03-04 09:14:05,947 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:14:05,947 INFO L85 PathProgramCache]: Analyzing trace with hash 1342503, now seen corresponding path program 1 times [2025-03-04 09:14:05,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:14:05,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1955830936] [2025-03-04 09:14:05,953 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:14:05,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:14:06,580 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 09:14:06,729 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 09:14:06,729 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:14:06,729 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:14:07,213 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:14:07,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:14:07,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1955830936] [2025-03-04 09:14:07,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1955830936] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:14:07,214 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:14:07,214 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 09:14:07,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1813391333] [2025-03-04 09:14:07,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:14:07,219 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 09:14:07,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:14:07,239 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 09:14:07,239 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 09:14:07,243 INFO L87 Difference]: Start difference. First operand has 716 states, 424 states have (on average 1.8820754716981132) internal successors, (798), 678 states have internal predecessors, (798), 29 states have call successors, (29), 12 states have call predecessors, (29), 12 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) 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-04 09:14:11,320 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 09:14:12,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:14:12,558 INFO L93 Difference]: Finished difference Result 701 states and 837 transitions. [2025-03-04 09:14:12,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 09:14:12,561 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-04 09:14:12,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:14:12,568 INFO L225 Difference]: With dead ends: 701 [2025-03-04 09:14:12,569 INFO L226 Difference]: Without dead ends: 701 [2025-03-04 09:14:12,570 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-04 09:14:12,571 INFO L435 NwaCegarLoop]: 467 mSDtfsCounter, 295 mSDsluCounter, 356 mSDsCounter, 0 mSdLazyCounter, 273 mSolverCounterSat, 9 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 298 SdHoareTripleChecker+Valid, 823 SdHoareTripleChecker+Invalid, 283 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 273 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.2s IncrementalHoareTripleChecker+Time [2025-03-04 09:14:12,571 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [298 Valid, 823 Invalid, 283 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 273 Invalid, 1 Unknown, 0 Unchecked, 5.2s Time] [2025-03-04 09:14:12,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 701 states. [2025-03-04 09:14:12,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 701 to 494. [2025-03-04 09:14:12,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 494 states, 304 states have (on average 1.7763157894736843) internal successors, (540), 466 states have internal predecessors, (540), 23 states have call successors, (23), 10 states have call predecessors, (23), 9 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-04 09:14:12,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 494 states to 494 states and 581 transitions. [2025-03-04 09:14:12,617 INFO L78 Accepts]: Start accepts. Automaton has 494 states and 581 transitions. Word has length 3 [2025-03-04 09:14:12,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:14:12,618 INFO L471 AbstractCegarLoop]: Abstraction has 494 states and 581 transitions. [2025-03-04 09:14:12,618 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-04 09:14:12,618 INFO L276 IsEmpty]: Start isEmpty. Operand 494 states and 581 transitions. [2025-03-04 09:14:12,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2025-03-04 09:14:12,618 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:14:12,618 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2025-03-04 09:14:12,619 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 09:14:12,619 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr153REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [getoptErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, getoptErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, getoptErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 356 more)] === [2025-03-04 09:14:12,619 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:14:12,619 INFO L85 PathProgramCache]: Analyzing trace with hash 1342504, now seen corresponding path program 1 times [2025-03-04 09:14:12,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:14:12,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1078926301] [2025-03-04 09:14:12,619 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:14:12,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:14:13,048 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 09:14:13,078 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 09:14:13,078 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:14:13,078 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:14:13,459 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:14:13,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:14:13,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1078926301] [2025-03-04 09:14:13,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1078926301] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:14:13,459 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:14:13,460 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 09:14:13,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [892226911] [2025-03-04 09:14:13,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:14:13,461 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 09:14:13,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:14:13,464 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 09:14:13,464 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 09:14:13,464 INFO L87 Difference]: Start difference. First operand 494 states and 581 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-04 09:14:17,489 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-04 09:14:18,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:14:18,111 INFO L93 Difference]: Finished difference Result 493 states and 580 transitions. [2025-03-04 09:14:18,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 09:14:18,112 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-04 09:14:18,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:14:18,114 INFO L225 Difference]: With dead ends: 493 [2025-03-04 09:14:18,114 INFO L226 Difference]: Without dead ends: 493 [2025-03-04 09:14:18,114 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-04 09:14:18,115 INFO L435 NwaCegarLoop]: 572 mSDtfsCounter, 10 mSDsluCounter, 411 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 983 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2025-03-04 09:14:18,115 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 983 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 164 Invalid, 1 Unknown, 0 Unchecked, 4.6s Time] [2025-03-04 09:14:18,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 493 states. [2025-03-04 09:14:18,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 493 to 493. [2025-03-04 09:14:18,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 493 states, 304 states have (on average 1.7730263157894737) internal successors, (539), 465 states have internal predecessors, (539), 23 states have call successors, (23), 10 states have call predecessors, (23), 9 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-04 09:14:18,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 493 states to 493 states and 580 transitions. [2025-03-04 09:14:18,126 INFO L78 Accepts]: Start accepts. Automaton has 493 states and 580 transitions. Word has length 3 [2025-03-04 09:14:18,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:14:18,127 INFO L471 AbstractCegarLoop]: Abstraction has 493 states and 580 transitions. [2025-03-04 09:14:18,127 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-04 09:14:18,127 INFO L276 IsEmpty]: Start isEmpty. Operand 493 states and 580 transitions. [2025-03-04 09:14:18,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-03-04 09:14:18,127 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:14:18,127 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-04 09:14:18,127 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 09:14:18,127 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr151REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [getoptErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, getoptErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, getoptErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 356 more)] === [2025-03-04 09:14:18,128 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:14:18,128 INFO L85 PathProgramCache]: Analyzing trace with hash 1341079166, now seen corresponding path program 1 times [2025-03-04 09:14:18,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:14:18,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1402129479] [2025-03-04 09:14:18,128 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:14:18,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:14:18,636 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 09:14:18,661 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 09:14:18,661 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:14:18,661 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:14:19,146 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:14:19,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:14:19,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1402129479] [2025-03-04 09:14:19,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1402129479] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:14:19,147 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:14:19,147 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 09:14:19,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1800432507] [2025-03-04 09:14:19,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:14:19,147 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 09:14:19,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:14:19,149 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 09:14:19,149 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 09:14:19,149 INFO L87 Difference]: Start difference. First operand 493 states and 580 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-04 09:14:23,178 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 09:14:27,253 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 09:14:28,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:14:28,416 INFO L93 Difference]: Finished difference Result 496 states and 583 transitions. [2025-03-04 09:14:28,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 09:14:28,416 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-04 09:14:28,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:14:28,418 INFO L225 Difference]: With dead ends: 496 [2025-03-04 09:14:28,418 INFO L226 Difference]: Without dead ends: 496 [2025-03-04 09:14:28,418 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 09:14:28,419 INFO L435 NwaCegarLoop]: 570 mSDtfsCounter, 10 mSDsluCounter, 824 mSDsCounter, 0 mSdLazyCounter, 331 mSolverCounterSat, 1 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 1394 SdHoareTripleChecker+Invalid, 334 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 331 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.2s IncrementalHoareTripleChecker+Time [2025-03-04 09:14:28,419 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 1394 Invalid, 334 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 331 Invalid, 2 Unknown, 0 Unchecked, 9.2s Time] [2025-03-04 09:14:28,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 496 states. [2025-03-04 09:14:28,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 496 to 495. [2025-03-04 09:14:28,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 495 states, 306 states have (on average 1.7679738562091503) internal successors, (541), 467 states have internal predecessors, (541), 23 states have call successors, (23), 10 states have call predecessors, (23), 9 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-04 09:14:28,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 495 states to 495 states and 582 transitions. [2025-03-04 09:14:28,432 INFO L78 Accepts]: Start accepts. Automaton has 495 states and 582 transitions. Word has length 6 [2025-03-04 09:14:28,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:14:28,432 INFO L471 AbstractCegarLoop]: Abstraction has 495 states and 582 transitions. [2025-03-04 09:14:28,432 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-04 09:14:28,432 INFO L276 IsEmpty]: Start isEmpty. Operand 495 states and 582 transitions. [2025-03-04 09:14:28,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-03-04 09:14:28,432 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:14:28,432 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:14:28,433 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 09:14:28,433 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr151REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [getoptErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, getoptErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, getoptErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 356 more)] === [2025-03-04 09:14:28,433 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:14:28,433 INFO L85 PathProgramCache]: Analyzing trace with hash 304890275, now seen corresponding path program 1 times [2025-03-04 09:14:28,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:14:28,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220693027] [2025-03-04 09:14:28,433 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:14:28,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:14:28,882 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-04 09:14:28,927 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 09:14:28,927 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:14:28,927 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:14:29,517 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-04 09:14:29,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:14:29,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [220693027] [2025-03-04 09:14:29,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [220693027] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 09:14:29,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1458291227] [2025-03-04 09:14:29,518 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:14:29,518 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:14:29,518 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 09:14:29,520 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 09:14:29,522 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 09:14:30,156 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-04 09:14:30,304 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 09:14:30,304 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:14:30,304 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:14:30,310 INFO L256 TraceCheckSpWp]: Trace formula consists of 1659 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-04 09:14:30,314 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 09:14:30,541 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-04 09:14:30,542 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 09:14:30,783 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-04 09:14:30,846 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-04 09:14:30,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1458291227] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 09:14:30,847 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 09:14:30,847 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 13 [2025-03-04 09:14:30,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2131042782] [2025-03-04 09:14:30,847 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 09:14:30,847 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-04 09:14:30,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:14:30,848 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-04 09:14:30,848 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2025-03-04 09:14:30,848 INFO L87 Difference]: Start difference. First operand 495 states and 582 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-04 09:14:34,889 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 09:14:38,891 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-04 09:14:41,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:14:41,096 INFO L93 Difference]: Finished difference Result 499 states and 586 transitions. [2025-03-04 09:14:41,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 09:14:41,097 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-04 09:14:41,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:14:41,098 INFO L225 Difference]: With dead ends: 499 [2025-03-04 09:14:41,098 INFO L226 Difference]: Without dead ends: 499 [2025-03-04 09:14:41,099 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=90, Invalid=150, Unknown=0, NotChecked=0, Total=240 [2025-03-04 09:14:41,099 INFO L435 NwaCegarLoop]: 570 mSDtfsCounter, 799 mSDsluCounter, 1514 mSDsCounter, 0 mSdLazyCounter, 649 mSolverCounterSat, 18 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 810 SdHoareTripleChecker+Valid, 2084 SdHoareTripleChecker+Invalid, 669 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 649 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.1s IncrementalHoareTripleChecker+Time [2025-03-04 09:14:41,099 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [810 Valid, 2084 Invalid, 669 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 649 Invalid, 2 Unknown, 0 Unchecked, 10.1s Time] [2025-03-04 09:14:41,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 499 states. [2025-03-04 09:14:41,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 499 to 499. [2025-03-04 09:14:41,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 499 states, 311 states have (on average 1.752411575562701) internal successors, (545), 471 states have internal predecessors, (545), 23 states have call successors, (23), 10 states have call predecessors, (23), 9 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-04 09:14:41,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 499 states to 499 states and 586 transitions. [2025-03-04 09:14:41,108 INFO L78 Accepts]: Start accepts. Automaton has 499 states and 586 transitions. Word has length 9 [2025-03-04 09:14:41,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:14:41,109 INFO L471 AbstractCegarLoop]: Abstraction has 499 states and 586 transitions. [2025-03-04 09:14:41,109 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-04 09:14:41,109 INFO L276 IsEmpty]: Start isEmpty. Operand 499 states and 586 transitions. [2025-03-04 09:14:41,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-03-04 09:14:41,110 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:14:41,110 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1] [2025-03-04 09:14:41,120 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-04 09:14:41,310 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-04 09:14:41,311 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr148REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [getoptErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, getoptErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, getoptErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 356 more)] === [2025-03-04 09:14:41,311 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:14:41,311 INFO L85 PathProgramCache]: Analyzing trace with hash -2068675806, now seen corresponding path program 1 times [2025-03-04 09:14:41,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:14:41,311 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [527776752] [2025-03-04 09:14:41,311 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:14:41,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:14:41,787 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-04 09:14:41,817 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-04 09:14:41,819 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:14:41,820 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:14:42,175 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-04 09:14:42,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:14:42,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [527776752] [2025-03-04 09:14:42,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [527776752] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 09:14:42,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1260384802] [2025-03-04 09:14:42,176 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:14:42,176 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:14:42,176 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 09:14:42,178 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 09:14:42,180 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-04 09:14:42,917 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-04 09:14:43,064 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-04 09:14:43,065 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:14:43,065 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:14:43,071 INFO L256 TraceCheckSpWp]: Trace formula consists of 1705 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 09:14:43,072 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 09:14:43,150 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-04 09:14:43,150 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 09:14:43,379 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-04 09:14:43,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1260384802] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 09:14:43,379 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 09:14:43,379 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2025-03-04 09:14:43,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1870768318] [2025-03-04 09:14:43,379 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 09:14:43,379 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 09:14:43,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:14:43,380 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 09:14:43,380 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2025-03-04 09:14:43,380 INFO L87 Difference]: Start difference. First operand 499 states and 586 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-04 09:14:43,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:14:43,518 INFO L93 Difference]: Finished difference Result 514 states and 601 transitions. [2025-03-04 09:14:43,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 09:14:43,518 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-04 09:14:43,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:14:43,520 INFO L225 Difference]: With dead ends: 514 [2025-03-04 09:14:43,520 INFO L226 Difference]: Without dead ends: 514 [2025-03-04 09:14:43,520 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2025-03-04 09:14:43,520 INFO L435 NwaCegarLoop]: 575 mSDtfsCounter, 4 mSDsluCounter, 1716 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 2291 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 09:14:43,521 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 2291 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 09:14:43,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 514 states. [2025-03-04 09:14:43,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 514 to 514. [2025-03-04 09:14:43,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 514 states, 326 states have (on average 1.7177914110429449) internal successors, (560), 486 states have internal predecessors, (560), 23 states have call successors, (23), 10 states have call predecessors, (23), 9 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-04 09:14:43,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 514 states to 514 states and 601 transitions. [2025-03-04 09:14:43,530 INFO L78 Accepts]: Start accepts. Automaton has 514 states and 601 transitions. Word has length 15 [2025-03-04 09:14:43,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:14:43,530 INFO L471 AbstractCegarLoop]: Abstraction has 514 states and 601 transitions. [2025-03-04 09:14:43,530 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-04 09:14:43,530 INFO L276 IsEmpty]: Start isEmpty. Operand 514 states and 601 transitions. [2025-03-04 09:14:43,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-03-04 09:14:43,530 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:14:43,531 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1] [2025-03-04 09:14:43,541 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-04 09:14:43,731 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-04 09:14:43,731 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr148REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [getoptErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, getoptErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, getoptErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 356 more)] === [2025-03-04 09:14:43,732 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:14:43,732 INFO L85 PathProgramCache]: Analyzing trace with hash -591293091, now seen corresponding path program 2 times [2025-03-04 09:14:43,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:14:43,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [137212237] [2025-03-04 09:14:43,732 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 09:14:43,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:14:44,116 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 30 statements into 2 equivalence classes. [2025-03-04 09:14:44,151 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 6 of 30 statements. [2025-03-04 09:14:44,152 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 09:14:44,152 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:14:44,520 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-04 09:14:44,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:14:44,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [137212237] [2025-03-04 09:14:44,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [137212237] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:14:44,521 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:14:44,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 09:14:44,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [709056928] [2025-03-04 09:14:44,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:14:44,521 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 09:14:44,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:14:44,521 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 09:14:44,522 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 09:14:44,522 INFO L87 Difference]: Start difference. First operand 514 states and 601 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 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-04 09:14:46,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:14:46,192 INFO L93 Difference]: Finished difference Result 881 states and 1053 transitions. [2025-03-04 09:14:46,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 09:14:46,193 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 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-04 09:14:46,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:14:46,195 INFO L225 Difference]: With dead ends: 881 [2025-03-04 09:14:46,196 INFO L226 Difference]: Without dead ends: 881 [2025-03-04 09:14:46,197 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 09:14:46,198 INFO L435 NwaCegarLoop]: 446 mSDtfsCounter, 483 mSDsluCounter, 728 mSDsCounter, 0 mSdLazyCounter, 459 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 483 SdHoareTripleChecker+Valid, 1174 SdHoareTripleChecker+Invalid, 476 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 459 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-03-04 09:14:46,198 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [483 Valid, 1174 Invalid, 476 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 459 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-03-04 09:14:46,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 881 states. [2025-03-04 09:14:46,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 881 to 560. [2025-03-04 09:14:46,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 560 states, 369 states have (on average 1.7100271002710028) internal successors, (631), 528 states have internal predecessors, (631), 25 states have call successors, (25), 12 states have call predecessors, (25), 11 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-04 09:14:46,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 560 states to 560 states and 676 transitions. [2025-03-04 09:14:46,211 INFO L78 Accepts]: Start accepts. Automaton has 560 states and 676 transitions. Word has length 30 [2025-03-04 09:14:46,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:14:46,211 INFO L471 AbstractCegarLoop]: Abstraction has 560 states and 676 transitions. [2025-03-04 09:14:46,211 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 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-04 09:14:46,211 INFO L276 IsEmpty]: Start isEmpty. Operand 560 states and 676 transitions. [2025-03-04 09:14:46,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-03-04 09:14:46,212 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:14:46,212 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1] [2025-03-04 09:14:46,212 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 09:14:46,212 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr149REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [getoptErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, getoptErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, getoptErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 356 more)] === [2025-03-04 09:14:46,212 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:14:46,212 INFO L85 PathProgramCache]: Analyzing trace with hash -591293090, now seen corresponding path program 1 times [2025-03-04 09:14:46,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:14:46,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [814910221] [2025-03-04 09:14:46,212 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:14:46,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:14:46,627 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-04 09:14:46,666 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-04 09:14:46,667 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:14:46,667 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:14:47,418 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-04 09:14:47,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:14:47,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [814910221] [2025-03-04 09:14:47,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [814910221] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 09:14:47,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [295698800] [2025-03-04 09:14:47,418 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:14:47,418 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:14:47,418 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 09:14:47,421 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-04 09:14:47,421 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-04 09:14:48,123 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-04 09:14:48,272 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-04 09:14:48,273 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:14:48,273 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:14:48,280 INFO L256 TraceCheckSpWp]: Trace formula consists of 1810 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-04 09:14:48,282 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 09:14:48,487 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-04 09:14:48,487 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 09:14:48,997 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-04 09:14:48,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [295698800] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 09:14:48,998 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 09:14:48,998 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 13 [2025-03-04 09:14:48,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [264599155] [2025-03-04 09:14:48,998 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 09:14:48,998 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-04 09:14:48,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:14:48,999 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-04 09:14:48,999 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-03-04 09:14:48,999 INFO L87 Difference]: Start difference. First operand 560 states and 676 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-04 09:14:49,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:14:49,221 INFO L93 Difference]: Finished difference Result 566 states and 682 transitions. [2025-03-04 09:14:49,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 09:14:49,222 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-04 09:14:49,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:14:49,224 INFO L225 Difference]: With dead ends: 566 [2025-03-04 09:14:49,224 INFO L226 Difference]: Without dead ends: 566 [2025-03-04 09:14:49,225 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 50 SyntacticMatches, 8 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-03-04 09:14:49,227 INFO L435 NwaCegarLoop]: 574 mSDtfsCounter, 2 mSDsluCounter, 1713 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 2287 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 09:14:49,228 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 2287 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 09:14:49,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 566 states. [2025-03-04 09:14:49,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 566 to 566. [2025-03-04 09:14:49,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 566 states, 375 states have (on average 1.6986666666666668) internal successors, (637), 534 states have internal predecessors, (637), 25 states have call successors, (25), 12 states have call predecessors, (25), 11 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-04 09:14:49,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 566 states to 566 states and 682 transitions. [2025-03-04 09:14:49,239 INFO L78 Accepts]: Start accepts. Automaton has 566 states and 682 transitions. Word has length 30 [2025-03-04 09:14:49,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:14:49,239 INFO L471 AbstractCegarLoop]: Abstraction has 566 states and 682 transitions. [2025-03-04 09:14:49,239 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-04 09:14:49,239 INFO L276 IsEmpty]: Start isEmpty. Operand 566 states and 682 transitions. [2025-03-04 09:14:49,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-03-04 09:14:49,240 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:14:49,240 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1] [2025-03-04 09:14:49,251 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-04 09:14:49,440 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-04 09:14:49,441 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr149REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [getoptErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, getoptErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, getoptErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 356 more)] === [2025-03-04 09:14:49,441 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:14:49,441 INFO L85 PathProgramCache]: Analyzing trace with hash -1529878722, now seen corresponding path program 2 times [2025-03-04 09:14:49,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:14:49,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796545087] [2025-03-04 09:14:49,441 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 09:14:49,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:14:49,915 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 36 statements into 2 equivalence classes. [2025-03-04 09:14:49,959 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 6 of 36 statements. [2025-03-04 09:14:49,959 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 09:14:49,959 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:14:50,685 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-04 09:14:50,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:14:50,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1796545087] [2025-03-04 09:14:50,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1796545087] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:14:50,685 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:14:50,685 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 09:14:50,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1372141606] [2025-03-04 09:14:50,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:14:50,686 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 09:14:50,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:14:50,686 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 09:14:50,686 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 09:14:50,686 INFO L87 Difference]: Start difference. First operand 566 states and 682 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-04 09:14:54,713 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 09:14:58,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:14:58,382 INFO L93 Difference]: Finished difference Result 1140 states and 1369 transitions. [2025-03-04 09:14:58,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 09:14:58,382 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-04 09:14:58,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:14:58,386 INFO L225 Difference]: With dead ends: 1140 [2025-03-04 09:14:58,386 INFO L226 Difference]: Without dead ends: 1140 [2025-03-04 09:14:58,386 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-03-04 09:14:58,386 INFO L435 NwaCegarLoop]: 395 mSDtfsCounter, 1093 mSDsluCounter, 1059 mSDsCounter, 0 mSdLazyCounter, 808 mSolverCounterSat, 59 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1095 SdHoareTripleChecker+Valid, 1454 SdHoareTripleChecker+Invalid, 868 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 808 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.6s IncrementalHoareTripleChecker+Time [2025-03-04 09:14:58,386 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1095 Valid, 1454 Invalid, 868 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 808 Invalid, 1 Unknown, 0 Unchecked, 7.6s Time] [2025-03-04 09:14:58,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1140 states. [2025-03-04 09:14:58,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1140 to 932. [2025-03-04 09:14:58,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 932 states, 707 states have (on average 1.7284299858557284) internal successors, (1222), 871 states have internal predecessors, (1222), 50 states have call successors, (50), 24 states have call predecessors, (50), 21 states have return successors, (45), 38 states have call predecessors, (45), 40 states have call successors, (45) [2025-03-04 09:14:58,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 932 states to 932 states and 1317 transitions. [2025-03-04 09:14:58,410 INFO L78 Accepts]: Start accepts. Automaton has 932 states and 1317 transitions. Word has length 36 [2025-03-04 09:14:58,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:14:58,412 INFO L471 AbstractCegarLoop]: Abstraction has 932 states and 1317 transitions. [2025-03-04 09:14:58,412 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-04 09:14:58,412 INFO L276 IsEmpty]: Start isEmpty. Operand 932 states and 1317 transitions. [2025-03-04 09:14:58,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-03-04 09:14:58,413 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:14:58,413 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:14:58,414 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 09:14:58,414 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr146REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [getoptErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, getoptErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, getoptErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 356 more)] === [2025-03-04 09:14:58,414 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:14:58,414 INFO L85 PathProgramCache]: Analyzing trace with hash 112172141, now seen corresponding path program 1 times [2025-03-04 09:14:58,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:14:58,414 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [182140466] [2025-03-04 09:14:58,414 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:14:58,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:14:58,800 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-04 09:14:58,838 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-04 09:14:58,838 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:14:58,838 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:14:59,136 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-04 09:14:59,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:14:59,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [182140466] [2025-03-04 09:14:59,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [182140466] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:14:59,137 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:14:59,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 09:14:59,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1688501073] [2025-03-04 09:14:59,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:14:59,137 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 09:14:59,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:14:59,138 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 09:14:59,138 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 09:14:59,138 INFO L87 Difference]: Start difference. First operand 932 states and 1317 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-04 09:15:03,160 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-04 09:15:04,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:15:04,459 INFO L93 Difference]: Finished difference Result 1001 states and 1313 transitions. [2025-03-04 09:15:04,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 09:15:04,460 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-04 09:15:04,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:15:04,466 INFO L225 Difference]: With dead ends: 1001 [2025-03-04 09:15:04,467 INFO L226 Difference]: Without dead ends: 1001 [2025-03-04 09:15:04,467 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-04 09:15:04,467 INFO L435 NwaCegarLoop]: 466 mSDtfsCounter, 275 mSDsluCounter, 363 mSDsCounter, 0 mSdLazyCounter, 271 mSolverCounterSat, 11 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 277 SdHoareTripleChecker+Valid, 829 SdHoareTripleChecker+Invalid, 283 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 271 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.3s IncrementalHoareTripleChecker+Time [2025-03-04 09:15:04,467 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [277 Valid, 829 Invalid, 283 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 271 Invalid, 1 Unknown, 0 Unchecked, 5.3s Time] [2025-03-04 09:15:04,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1001 states. [2025-03-04 09:15:04,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1001 to 927. [2025-03-04 09:15:04,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 927 states, 707 states have (on average 1.7213578500707214) internal successors, (1217), 866 states have internal predecessors, (1217), 50 states have call successors, (50), 24 states have call predecessors, (50), 21 states have return successors, (45), 38 states have call predecessors, (45), 40 states have call successors, (45) [2025-03-04 09:15:04,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 927 states to 927 states and 1312 transitions. [2025-03-04 09:15:04,483 INFO L78 Accepts]: Start accepts. Automaton has 927 states and 1312 transitions. Word has length 44 [2025-03-04 09:15:04,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:15:04,483 INFO L471 AbstractCegarLoop]: Abstraction has 927 states and 1312 transitions. [2025-03-04 09:15:04,483 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-04 09:15:04,483 INFO L276 IsEmpty]: Start isEmpty. Operand 927 states and 1312 transitions. [2025-03-04 09:15:04,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-03-04 09:15:04,483 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:15:04,484 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:15:04,484 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 09:15:04,484 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr147REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [getoptErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, getoptErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, getoptErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 356 more)] === [2025-03-04 09:15:04,484 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:15:04,484 INFO L85 PathProgramCache]: Analyzing trace with hash 112172142, now seen corresponding path program 1 times [2025-03-04 09:15:04,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:15:04,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1872148549] [2025-03-04 09:15:04,484 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:15:04,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:15:04,863 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-04 09:15:05,005 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-04 09:15:05,005 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:15:05,005 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:15:05,965 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-04 09:15:05,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:15:05,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1872148549] [2025-03-04 09:15:05,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1872148549] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:15:05,966 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:15:05,966 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 09:15:05,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1962533379] [2025-03-04 09:15:05,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:15:05,966 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 09:15:05,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:15:05,966 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 09:15:05,966 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 09:15:05,967 INFO L87 Difference]: Start difference. First operand 927 states and 1312 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-04 09:15:09,992 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-04 09:15:10,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:15:10,950 INFO L93 Difference]: Finished difference Result 927 states and 1313 transitions. [2025-03-04 09:15:10,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 09:15:10,951 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-04 09:15:10,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:15:10,954 INFO L225 Difference]: With dead ends: 927 [2025-03-04 09:15:10,954 INFO L226 Difference]: Without dead ends: 927 [2025-03-04 09:15:10,954 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 09:15:10,954 INFO L435 NwaCegarLoop]: 563 mSDtfsCounter, 378 mSDsluCounter, 1696 mSDsCounter, 0 mSdLazyCounter, 201 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 388 SdHoareTripleChecker+Valid, 2259 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 201 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.0s IncrementalHoareTripleChecker+Time [2025-03-04 09:15:10,954 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [388 Valid, 2259 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 201 Invalid, 1 Unknown, 0 Unchecked, 5.0s Time] [2025-03-04 09:15:10,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 927 states. [2025-03-04 09:15:10,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 927 to 926. [2025-03-04 09:15:10,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 926 states, 707 states have (on average 1.71994342291372) internal successors, (1216), 865 states have internal predecessors, (1216), 50 states have call successors, (50), 24 states have call predecessors, (50), 21 states have return successors, (45), 38 states have call predecessors, (45), 40 states have call successors, (45) [2025-03-04 09:15:10,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 926 states to 926 states and 1311 transitions. [2025-03-04 09:15:10,976 INFO L78 Accepts]: Start accepts. Automaton has 926 states and 1311 transitions. Word has length 44 [2025-03-04 09:15:10,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:15:10,976 INFO L471 AbstractCegarLoop]: Abstraction has 926 states and 1311 transitions. [2025-03-04 09:15:10,976 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-04 09:15:10,976 INFO L276 IsEmpty]: Start isEmpty. Operand 926 states and 1311 transitions. [2025-03-04 09:15:10,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-03-04 09:15:10,976 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:15:10,976 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-04 09:15:10,976 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 09:15:10,977 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr145REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [getoptErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, getoptErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, getoptErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 356 more)] === [2025-03-04 09:15:10,977 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:15:10,977 INFO L85 PathProgramCache]: Analyzing trace with hash 236958312, now seen corresponding path program 1 times [2025-03-04 09:15:10,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:15:10,977 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [932668384] [2025-03-04 09:15:10,977 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:15:10,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:15:11,387 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-04 09:15:11,417 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-04 09:15:11,417 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:15:11,417 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:15:12,019 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-04 09:15:12,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:15:12,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [932668384] [2025-03-04 09:15:12,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [932668384] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:15:12,020 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:15:12,020 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 09:15:12,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [434765995] [2025-03-04 09:15:12,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:15:12,020 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 09:15:12,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:15:12,020 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 09:15:12,020 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-04 09:15:12,020 INFO L87 Difference]: Start difference. First operand 926 states and 1311 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-04 09:15:16,043 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-04 09:15:20,084 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 09:15:22,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:15:22,601 INFO L93 Difference]: Finished difference Result 1019 states and 1334 transitions. [2025-03-04 09:15:22,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 09:15:22,602 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-04 09:15:22,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:15:22,605 INFO L225 Difference]: With dead ends: 1019 [2025-03-04 09:15:22,605 INFO L226 Difference]: Without dead ends: 1019 [2025-03-04 09:15:22,605 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2025-03-04 09:15:22,605 INFO L435 NwaCegarLoop]: 419 mSDtfsCounter, 640 mSDsluCounter, 1000 mSDsCounter, 0 mSdLazyCounter, 822 mSolverCounterSat, 16 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 652 SdHoareTripleChecker+Valid, 1419 SdHoareTripleChecker+Invalid, 840 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 822 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.5s IncrementalHoareTripleChecker+Time [2025-03-04 09:15:22,606 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [652 Valid, 1419 Invalid, 840 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 822 Invalid, 2 Unknown, 0 Unchecked, 10.5s Time] [2025-03-04 09:15:22,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1019 states. [2025-03-04 09:15:22,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1019 to 940. [2025-03-04 09:15:22,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 940 states, 721 states have (on average 1.7170596393897364) internal successors, (1238), 879 states have internal predecessors, (1238), 50 states have call successors, (50), 24 states have call predecessors, (50), 21 states have return successors, (45), 38 states have call predecessors, (45), 40 states have call successors, (45) [2025-03-04 09:15:22,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 940 states to 940 states and 1333 transitions. [2025-03-04 09:15:22,618 INFO L78 Accepts]: Start accepts. Automaton has 940 states and 1333 transitions. Word has length 47 [2025-03-04 09:15:22,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:15:22,618 INFO L471 AbstractCegarLoop]: Abstraction has 940 states and 1333 transitions. [2025-03-04 09:15:22,618 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-04 09:15:22,618 INFO L276 IsEmpty]: Start isEmpty. Operand 940 states and 1333 transitions. [2025-03-04 09:15:22,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-03-04 09:15:22,619 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:15:22,619 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-04 09:15:22,619 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 09:15:22,619 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr130REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [getoptErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, getoptErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, getoptErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 356 more)] === [2025-03-04 09:15:22,619 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:15:22,619 INFO L85 PathProgramCache]: Analyzing trace with hash 236957383, now seen corresponding path program 1 times [2025-03-04 09:15:22,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:15:22,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [451277271] [2025-03-04 09:15:22,620 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:15:22,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:15:23,029 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-04 09:15:23,051 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-04 09:15:23,051 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:15:23,051 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:15:23,348 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-04 09:15:23,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:15:23,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [451277271] [2025-03-04 09:15:23,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [451277271] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:15:23,348 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:15:23,348 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 09:15:23,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1819448618] [2025-03-04 09:15:23,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:15:23,349 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 09:15:23,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:15:23,349 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 09:15:23,349 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 09:15:23,349 INFO L87 Difference]: Start difference. First operand 940 states and 1333 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-04 09:15:27,371 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 []