./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 e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/busybox-1.22.0/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-?-e2fb8be-m [2025-03-09 00:26:35,944 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-09 00:26:36,001 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf [2025-03-09 00:26:36,005 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-09 00:26:36,005 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-09 00:26:36,021 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-09 00:26:36,022 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-09 00:26:36,022 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-09 00:26:36,023 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-09 00:26:36,023 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-09 00:26:36,023 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-09 00:26:36,024 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-09 00:26:36,024 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-09 00:26:36,024 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-09 00:26:36,024 INFO L153 SettingsManager]: * Use SBE=true [2025-03-09 00:26:36,024 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-09 00:26:36,024 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-09 00:26:36,024 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-09 00:26:36,024 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-09 00:26:36,024 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-09 00:26:36,024 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-09 00:26:36,024 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-09 00:26:36,024 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-09 00:26:36,024 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-09 00:26:36,024 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-09 00:26:36,024 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-09 00:26:36,025 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-09 00:26:36,025 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-09 00:26:36,025 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-09 00:26:36,025 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-09 00:26:36,025 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 00:26:36,025 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-09 00:26:36,025 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-09 00:26:36,025 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-09 00:26:36,025 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-09 00:26:36,025 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-09 00:26:36,025 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-09 00:26:36,025 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-09 00:26:36,025 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-09 00:26:36,025 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-09 00:26:36,228 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-09 00:26:36,236 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-09 00:26:36,237 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-09 00:26:36,238 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-09 00:26:36,239 INFO L274 PluginConnector]: CDTParser initialized [2025-03-09 00:26:36,239 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-09 00:26:37,399 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/16df96918/a98c1796a573485a82afa8d244dd85e0/FLAG09aef95d7 [2025-03-09 00:26:37,893 INFO L384 CDTParser]: Found 1 translation units. [2025-03-09 00:26:37,894 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/busybox-1.22.0/head-2.i [2025-03-09 00:26:37,923 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/16df96918/a98c1796a573485a82afa8d244dd85e0/FLAG09aef95d7 [2025-03-09 00:26:37,945 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/16df96918/a98c1796a573485a82afa8d244dd85e0 [2025-03-09 00:26:37,947 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-09 00:26:37,951 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-09 00:26:37,952 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-09 00:26:37,953 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-09 00:26:37,956 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-09 00:26:37,957 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 12:26:37" (1/1) ... [2025-03-09 00:26:37,959 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@69348bc8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:26:37, skipping insertion in model container [2025-03-09 00:26:37,960 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 12:26:37" (1/1) ... [2025-03-09 00:26:38,019 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-09 00:26:39,028 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-09 00:26:39,034 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-09 00:26:39,036 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-09 00:26:39,038 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-09 00:26:39,039 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-09 00:26:39,040 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-09 00:26:39,043 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-09 00:26:39,044 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-09 00:26:39,044 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-09 00:26:39,044 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-09 00:26:39,055 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-09 00:26:39,057 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-09 00:26:39,060 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-09 00:26:39,062 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-09 00:26:39,063 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-09 00:26:39,063 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-09 00:26:39,064 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-09 00:26:39,064 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-09 00:26:39,064 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-09 00:26:39,066 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-09 00:26:39,067 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-09 00:26:39,072 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-09 00:26:39,076 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-09 00:26:39,079 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-09 00:26:39,079 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-09 00:26:39,085 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-09 00:26:39,089 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-09 00:26:39,092 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-09 00:26:39,093 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-09 00:26:39,095 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-09 00:26:39,097 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-09 00:26:39,098 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-09 00:26:39,098 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-09 00:26:39,099 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-09 00:26:39,100 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-09 00:26:39,101 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-09 00:26:39,101 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-09 00:26:39,108 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-09 00:26:39,113 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-09 00:26:39,120 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-09 00:26:39,130 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 00:26:39,166 INFO L200 MainTranslator]: Completed pre-run [2025-03-09 00:26:39,309 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 00:26:39,437 WARN L1212 FunctionHandler]: The following functions are not defined or handled internally: vasprintf [2025-03-09 00:26:39,443 INFO L204 MainTranslator]: Completed translation [2025-03-09 00:26:39,444 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:26:39 WrapperNode [2025-03-09 00:26:39,444 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-09 00:26:39,445 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-09 00:26:39,445 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-09 00:26:39,445 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-09 00:26:39,450 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:26:39" (1/1) ... [2025-03-09 00:26:39,479 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:26:39" (1/1) ... [2025-03-09 00:26:39,555 INFO L138 Inliner]: procedures = 581, calls = 697, calls flagged for inlining = 30, calls inlined = 28, statements flattened = 1394 [2025-03-09 00:26:39,556 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-09 00:26:39,556 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-09 00:26:39,557 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-09 00:26:39,557 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-09 00:26:39,565 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:26:39" (1/1) ... [2025-03-09 00:26:39,565 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:26:39" (1/1) ... [2025-03-09 00:26:39,581 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:26:39" (1/1) ... [2025-03-09 00:26:39,641 INFO L175 MemorySlicer]: Split 566 memory accesses to 19 slices as follows [2, 20, 3, 2, 2, 9, 7, 32, 15, 24, 10, 355, 3, 18, 1, 47, 3, 4, 9]. 63 percent of accesses are in the largest equivalence class. The 379 initializations are split as follows [2, 4, 3, 2, 0, 1, 0, 2, 0, 0, 7, 355, 0, 0, 0, 2, 0, 1, 0]. The 120 writes are split as follows [0, 15, 0, 0, 1, 4, 7, 21, 1, 21, 0, 0, 0, 4, 1, 35, 3, 1, 6]. [2025-03-09 00:26:39,644 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:26:39" (1/1) ... [2025-03-09 00:26:39,645 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:26:39" (1/1) ... [2025-03-09 00:26:39,717 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:26:39" (1/1) ... [2025-03-09 00:26:39,722 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:26:39" (1/1) ... [2025-03-09 00:26:39,741 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:26:39" (1/1) ... [2025-03-09 00:26:39,754 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:26:39" (1/1) ... [2025-03-09 00:26:39,783 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-09 00:26:39,784 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-09 00:26:39,784 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-09 00:26:39,784 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-09 00:26:39,788 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:26:39" (1/1) ... [2025-03-09 00:26:39,830 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 00:26:39,844 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 00:26:39,863 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-09 00:26:39,865 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-09 00:26:39,886 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#0 [2025-03-09 00:26:39,886 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#1 [2025-03-09 00:26:39,886 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#2 [2025-03-09 00:26:39,886 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#3 [2025-03-09 00:26:39,886 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#4 [2025-03-09 00:26:39,886 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#5 [2025-03-09 00:26:39,887 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#6 [2025-03-09 00:26:39,887 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#7 [2025-03-09 00:26:39,887 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#8 [2025-03-09 00:26:39,887 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#9 [2025-03-09 00:26:39,887 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#10 [2025-03-09 00:26:39,887 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#11 [2025-03-09 00:26:39,887 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#12 [2025-03-09 00:26:39,887 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#13 [2025-03-09 00:26:39,887 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#14 [2025-03-09 00:26:39,887 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#15 [2025-03-09 00:26:39,888 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#16 [2025-03-09 00:26:39,889 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#17 [2025-03-09 00:26:39,889 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#18 [2025-03-09 00:26:39,889 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#0 [2025-03-09 00:26:39,889 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#1 [2025-03-09 00:26:39,889 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#2 [2025-03-09 00:26:39,889 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#3 [2025-03-09 00:26:39,889 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#4 [2025-03-09 00:26:39,889 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#5 [2025-03-09 00:26:39,889 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#6 [2025-03-09 00:26:39,889 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#7 [2025-03-09 00:26:39,889 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#8 [2025-03-09 00:26:39,889 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#9 [2025-03-09 00:26:39,889 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#10 [2025-03-09 00:26:39,889 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#11 [2025-03-09 00:26:39,889 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#12 [2025-03-09 00:26:39,889 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#13 [2025-03-09 00:26:39,889 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#14 [2025-03-09 00:26:39,889 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#15 [2025-03-09 00:26:39,889 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#16 [2025-03-09 00:26:39,889 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#17 [2025-03-09 00:26:39,889 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#18 [2025-03-09 00:26:39,889 INFO L130 BoogieDeclarations]: Found specification of procedure _IO_getc [2025-03-09 00:26:39,889 INFO L138 BoogieDeclarations]: Found implementation of procedure _IO_getc [2025-03-09 00:26:39,889 INFO L130 BoogieDeclarations]: Found specification of procedure xrealloc [2025-03-09 00:26:39,889 INFO L138 BoogieDeclarations]: Found implementation of procedure xrealloc [2025-03-09 00:26:39,889 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-09 00:26:39,889 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#0 [2025-03-09 00:26:39,890 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#1 [2025-03-09 00:26:39,890 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#2 [2025-03-09 00:26:39,890 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#3 [2025-03-09 00:26:39,890 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#4 [2025-03-09 00:26:39,890 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#5 [2025-03-09 00:26:39,890 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#6 [2025-03-09 00:26:39,890 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#7 [2025-03-09 00:26:39,890 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#8 [2025-03-09 00:26:39,890 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#9 [2025-03-09 00:26:39,890 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#10 [2025-03-09 00:26:39,890 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#11 [2025-03-09 00:26:39,890 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#12 [2025-03-09 00:26:39,890 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#13 [2025-03-09 00:26:39,890 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#14 [2025-03-09 00:26:39,890 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#15 [2025-03-09 00:26:39,890 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#16 [2025-03-09 00:26:39,890 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#17 [2025-03-09 00:26:39,890 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#18 [2025-03-09 00:26:39,890 INFO L130 BoogieDeclarations]: Found specification of procedure bb_verror_msg [2025-03-09 00:26:39,890 INFO L138 BoogieDeclarations]: Found implementation of procedure bb_verror_msg [2025-03-09 00:26:39,890 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#0 [2025-03-09 00:26:39,890 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#1 [2025-03-09 00:26:39,890 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#2 [2025-03-09 00:26:39,890 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#3 [2025-03-09 00:26:39,890 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#4 [2025-03-09 00:26:39,890 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#5 [2025-03-09 00:26:39,890 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#6 [2025-03-09 00:26:39,890 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#7 [2025-03-09 00:26:39,890 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#8 [2025-03-09 00:26:39,890 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#9 [2025-03-09 00:26:39,890 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#10 [2025-03-09 00:26:39,894 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#11 [2025-03-09 00:26:39,894 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#12 [2025-03-09 00:26:39,894 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#13 [2025-03-09 00:26:39,894 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#14 [2025-03-09 00:26:39,894 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#15 [2025-03-09 00:26:39,894 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#16 [2025-03-09 00:26:39,894 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#17 [2025-03-09 00:26:39,894 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#18 [2025-03-09 00:26:39,894 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-09 00:26:39,894 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-09 00:26:39,894 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-09 00:26:39,894 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-09 00:26:39,895 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-03-09 00:26:39,895 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-03-09 00:26:39,895 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-03-09 00:26:39,895 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2025-03-09 00:26:39,895 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2025-03-09 00:26:39,895 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2025-03-09 00:26:39,895 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2025-03-09 00:26:39,895 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2025-03-09 00:26:39,895 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2025-03-09 00:26:39,895 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#13 [2025-03-09 00:26:39,895 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#14 [2025-03-09 00:26:39,895 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#15 [2025-03-09 00:26:39,895 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#16 [2025-03-09 00:26:39,895 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#17 [2025-03-09 00:26:39,895 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#18 [2025-03-09 00:26:39,895 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-09 00:26:39,895 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-09 00:26:39,895 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-09 00:26:39,895 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-09 00:26:39,895 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-09 00:26:39,895 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-03-09 00:26:39,895 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2025-03-09 00:26:39,895 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2025-03-09 00:26:39,895 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2025-03-09 00:26:39,895 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#7 [2025-03-09 00:26:39,895 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#8 [2025-03-09 00:26:39,895 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#9 [2025-03-09 00:26:39,895 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#10 [2025-03-09 00:26:39,895 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#11 [2025-03-09 00:26:39,895 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#12 [2025-03-09 00:26:39,895 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#13 [2025-03-09 00:26:39,896 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#14 [2025-03-09 00:26:39,896 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#15 [2025-03-09 00:26:39,896 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#16 [2025-03-09 00:26:39,896 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#17 [2025-03-09 00:26:39,896 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#18 [2025-03-09 00:26:39,896 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-09 00:26:39,896 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-09 00:26:39,896 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#0 [2025-03-09 00:26:39,896 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#1 [2025-03-09 00:26:39,896 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#2 [2025-03-09 00:26:39,896 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#3 [2025-03-09 00:26:39,896 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#4 [2025-03-09 00:26:39,896 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#5 [2025-03-09 00:26:39,896 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#6 [2025-03-09 00:26:39,896 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#7 [2025-03-09 00:26:39,896 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#8 [2025-03-09 00:26:39,896 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#9 [2025-03-09 00:26:39,896 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#10 [2025-03-09 00:26:39,896 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#11 [2025-03-09 00:26:39,896 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#12 [2025-03-09 00:26:39,896 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#13 [2025-03-09 00:26:39,896 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#14 [2025-03-09 00:26:39,896 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#15 [2025-03-09 00:26:39,896 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#16 [2025-03-09 00:26:39,896 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#17 [2025-03-09 00:26:39,896 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#18 [2025-03-09 00:26:39,896 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#0 [2025-03-09 00:26:39,896 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#1 [2025-03-09 00:26:39,896 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#2 [2025-03-09 00:26:39,896 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#3 [2025-03-09 00:26:39,896 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#4 [2025-03-09 00:26:39,896 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#5 [2025-03-09 00:26:39,896 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#6 [2025-03-09 00:26:39,896 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#7 [2025-03-09 00:26:39,896 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#8 [2025-03-09 00:26:39,896 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#9 [2025-03-09 00:26:39,896 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#10 [2025-03-09 00:26:39,896 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#11 [2025-03-09 00:26:39,896 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#12 [2025-03-09 00:26:39,896 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#13 [2025-03-09 00:26:39,896 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#14 [2025-03-09 00:26:39,896 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#15 [2025-03-09 00:26:39,896 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#16 [2025-03-09 00:26:39,896 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#17 [2025-03-09 00:26:39,896 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#18 [2025-03-09 00:26:39,896 INFO L130 BoogieDeclarations]: Found specification of procedure xmalloc [2025-03-09 00:26:39,896 INFO L138 BoogieDeclarations]: Found implementation of procedure xmalloc [2025-03-09 00:26:39,896 INFO L130 BoogieDeclarations]: Found specification of procedure getopt [2025-03-09 00:26:39,897 INFO L138 BoogieDeclarations]: Found implementation of procedure getopt [2025-03-09 00:26:39,897 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#0 [2025-03-09 00:26:39,898 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#1 [2025-03-09 00:26:39,898 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#2 [2025-03-09 00:26:39,898 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#3 [2025-03-09 00:26:39,898 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#4 [2025-03-09 00:26:39,898 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#5 [2025-03-09 00:26:39,898 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#6 [2025-03-09 00:26:39,898 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#7 [2025-03-09 00:26:39,898 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#8 [2025-03-09 00:26:39,898 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#9 [2025-03-09 00:26:39,898 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#10 [2025-03-09 00:26:39,898 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#11 [2025-03-09 00:26:39,898 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#12 [2025-03-09 00:26:39,898 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#13 [2025-03-09 00:26:39,898 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#14 [2025-03-09 00:26:39,898 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#15 [2025-03-09 00:26:39,898 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#16 [2025-03-09 00:26:39,898 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#17 [2025-03-09 00:26:39,898 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#18 [2025-03-09 00:26:39,898 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#0 [2025-03-09 00:26:39,898 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#1 [2025-03-09 00:26:39,898 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#2 [2025-03-09 00:26:39,898 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#3 [2025-03-09 00:26:39,898 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#4 [2025-03-09 00:26:39,898 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#5 [2025-03-09 00:26:39,898 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#6 [2025-03-09 00:26:39,898 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#7 [2025-03-09 00:26:39,898 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#8 [2025-03-09 00:26:39,898 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#9 [2025-03-09 00:26:39,898 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#10 [2025-03-09 00:26:39,898 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#11 [2025-03-09 00:26:39,898 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#12 [2025-03-09 00:26:39,898 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#13 [2025-03-09 00:26:39,898 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#14 [2025-03-09 00:26:39,898 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#15 [2025-03-09 00:26:39,898 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#16 [2025-03-09 00:26:39,898 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#17 [2025-03-09 00:26:39,898 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#18 [2025-03-09 00:26:39,898 INFO L130 BoogieDeclarations]: Found specification of procedure bb_simple_perror_msg [2025-03-09 00:26:39,898 INFO L138 BoogieDeclarations]: Found implementation of procedure bb_simple_perror_msg [2025-03-09 00:26:39,898 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-09 00:26:39,898 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-09 00:26:39,898 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-09 00:26:39,898 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-09 00:26:39,898 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-09 00:26:39,898 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-09 00:26:39,898 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-03-09 00:26:39,898 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2025-03-09 00:26:39,899 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2025-03-09 00:26:39,899 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2025-03-09 00:26:39,899 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#7 [2025-03-09 00:26:39,899 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#8 [2025-03-09 00:26:39,899 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#9 [2025-03-09 00:26:39,899 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#10 [2025-03-09 00:26:39,899 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#11 [2025-03-09 00:26:39,899 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#12 [2025-03-09 00:26:39,899 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#13 [2025-03-09 00:26:39,899 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#14 [2025-03-09 00:26:39,899 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#15 [2025-03-09 00:26:39,899 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#16 [2025-03-09 00:26:39,899 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#17 [2025-03-09 00:26:39,899 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#18 [2025-03-09 00:26:39,899 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-09 00:26:39,899 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-09 00:26:39,899 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-09 00:26:39,899 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-09 00:26:39,899 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-03-09 00:26:39,899 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-03-09 00:26:39,899 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-03-09 00:26:39,900 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2025-03-09 00:26:39,900 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2025-03-09 00:26:39,900 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2025-03-09 00:26:39,900 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2025-03-09 00:26:39,900 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2025-03-09 00:26:39,900 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2025-03-09 00:26:39,900 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#13 [2025-03-09 00:26:39,900 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#14 [2025-03-09 00:26:39,900 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#15 [2025-03-09 00:26:39,901 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#16 [2025-03-09 00:26:39,901 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#17 [2025-03-09 00:26:39,901 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#18 [2025-03-09 00:26:39,901 INFO L130 BoogieDeclarations]: Found specification of procedure xmalloc_fgets [2025-03-09 00:26:39,901 INFO L138 BoogieDeclarations]: Found implementation of procedure xmalloc_fgets [2025-03-09 00:26:39,901 INFO L130 BoogieDeclarations]: Found specification of procedure bb_error_msg_and_die [2025-03-09 00:26:39,901 INFO L138 BoogieDeclarations]: Found implementation of procedure bb_error_msg_and_die [2025-03-09 00:26:39,901 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-09 00:26:39,901 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-09 00:26:39,901 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-09 00:26:39,901 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-09 00:26:39,901 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-09 00:26:39,901 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-03-09 00:26:39,901 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-03-09 00:26:39,901 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-03-09 00:26:39,901 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-03-09 00:26:39,901 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-03-09 00:26:39,901 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-03-09 00:26:39,902 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2025-03-09 00:26:39,902 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2025-03-09 00:26:39,902 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2025-03-09 00:26:39,902 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2025-03-09 00:26:39,902 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2025-03-09 00:26:39,902 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#16 [2025-03-09 00:26:39,902 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#17 [2025-03-09 00:26:39,902 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#18 [2025-03-09 00:26:40,372 INFO L256 CfgBuilder]: Building ICFG [2025-03-09 00:26:40,374 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-09 00:26:40,706 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2863: havoc #t~nondet150; [2025-03-09 00:26:41,494 INFO L1307 $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-09 00:26:46,959 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2420: havoc fclose_if_not_stdin_#t~bitwise80#1; [2025-03-09 00:26:46,960 INFO L1307 $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-09 00:26:47,212 INFO L? ?]: Removed 962 outVars from TransFormulas that were not future-live. [2025-03-09 00:26:47,212 INFO L307 CfgBuilder]: Performing block encoding [2025-03-09 00:26:47,254 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-09 00:26:47,254 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-09 00:26:47,255 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 12:26:47 BoogieIcfgContainer [2025-03-09 00:26:47,255 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-09 00:26:47,259 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-09 00:26:47,260 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-09 00:26:47,263 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-09 00:26:47,264 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.03 12:26:37" (1/3) ... [2025-03-09 00:26:47,264 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60e52784 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 12:26:47, skipping insertion in model container [2025-03-09 00:26:47,264 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:26:39" (2/3) ... [2025-03-09 00:26:47,264 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60e52784 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 12:26:47, skipping insertion in model container [2025-03-09 00:26:47,264 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 12:26:47" (3/3) ... [2025-03-09 00:26:47,265 INFO L128 eAbstractionObserver]: Analyzing ICFG head-2.i [2025-03-09 00:26:47,282 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-09 00:26:47,286 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-09 00:26:47,345 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-09 00:26:47,358 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;@5540ff2d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-09 00:26:47,359 INFO L334 AbstractCegarLoop]: Starting to check reachability of 359 error locations. [2025-03-09 00:26:47,365 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-09 00:26:47,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2025-03-09 00:26:47,370 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:26:47,370 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2025-03-09 00:26:47,371 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr152REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [getoptErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, getoptErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, getoptErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 356 more)] === [2025-03-09 00:26:47,376 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:26:47,377 INFO L85 PathProgramCache]: Analyzing trace with hash 1342503, now seen corresponding path program 1 times [2025-03-09 00:26:47,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:26:47,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [262554638] [2025-03-09 00:26:47,384 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:26:47,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:26:48,063 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-09 00:26:48,247 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-09 00:26:48,247 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:26:48,247 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:26:48,731 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:26:48,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:26:48,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [262554638] [2025-03-09 00:26:48,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [262554638] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:26:48,734 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:26:48,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 00:26:48,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2029929518] [2025-03-09 00:26:48,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:26:48,744 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 00:26:48,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:26:48,762 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 00:26:48,762 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 00:26:48,766 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-09 00:26:52,822 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-09 00:26:54,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:26:54,410 INFO L93 Difference]: Finished difference Result 701 states and 837 transitions. [2025-03-09 00:26:54,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 00:26:54,414 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2025-03-09 00:26:54,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:26:54,425 INFO L225 Difference]: With dead ends: 701 [2025-03-09 00:26:54,426 INFO L226 Difference]: Without dead ends: 701 [2025-03-09 00:26:54,427 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 00:26:54,429 INFO L435 NwaCegarLoop]: 467 mSDtfsCounter, 295 mSDsluCounter, 356 mSDsCounter, 0 mSdLazyCounter, 273 mSolverCounterSat, 9 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.4s 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.5s IncrementalHoareTripleChecker+Time [2025-03-09 00:26:54,430 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.5s Time] [2025-03-09 00:26:54,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 701 states. [2025-03-09 00:26:54,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 701 to 494. [2025-03-09 00:26:54,479 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-09 00:26:54,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 494 states to 494 states and 581 transitions. [2025-03-09 00:26:54,486 INFO L78 Accepts]: Start accepts. Automaton has 494 states and 581 transitions. Word has length 3 [2025-03-09 00:26:54,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:26:54,486 INFO L471 AbstractCegarLoop]: Abstraction has 494 states and 581 transitions. [2025-03-09 00:26:54,486 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:26:54,486 INFO L276 IsEmpty]: Start isEmpty. Operand 494 states and 581 transitions. [2025-03-09 00:26:54,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2025-03-09 00:26:54,486 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:26:54,486 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2025-03-09 00:26:54,487 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-09 00:26:54,487 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr153REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [getoptErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, getoptErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, getoptErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 356 more)] === [2025-03-09 00:26:54,487 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:26:54,487 INFO L85 PathProgramCache]: Analyzing trace with hash 1342504, now seen corresponding path program 1 times [2025-03-09 00:26:54,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:26:54,487 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [105168866] [2025-03-09 00:26:54,487 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:26:54,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:26:54,928 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-09 00:26:54,969 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-09 00:26:54,970 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:26:54,970 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:26:55,452 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:26:55,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:26:55,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [105168866] [2025-03-09 00:26:55,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [105168866] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:26:55,452 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:26:55,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 00:26:55,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1207292740] [2025-03-09 00:26:55,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:26:55,454 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 00:26:55,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:26:55,454 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 00:26:55,454 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 00:26:55,455 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-09 00:26:59,481 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-09 00:27:00,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:27:00,418 INFO L93 Difference]: Finished difference Result 493 states and 580 transitions. [2025-03-09 00:27:00,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 00:27:00,419 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2025-03-09 00:27:00,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:27:00,420 INFO L225 Difference]: With dead ends: 493 [2025-03-09 00:27:00,421 INFO L226 Difference]: Without dead ends: 493 [2025-03-09 00:27:00,421 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 00:27:00,424 INFO L435 NwaCegarLoop]: 572 mSDtfsCounter, 10 mSDsluCounter, 411 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.8s 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.9s IncrementalHoareTripleChecker+Time [2025-03-09 00:27:00,424 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.9s Time] [2025-03-09 00:27:00,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 493 states. [2025-03-09 00:27:00,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 493 to 493. [2025-03-09 00:27:00,441 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-09 00:27:00,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 493 states to 493 states and 580 transitions. [2025-03-09 00:27:00,445 INFO L78 Accepts]: Start accepts. Automaton has 493 states and 580 transitions. Word has length 3 [2025-03-09 00:27:00,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:27:00,445 INFO L471 AbstractCegarLoop]: Abstraction has 493 states and 580 transitions. [2025-03-09 00:27:00,445 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:27:00,445 INFO L276 IsEmpty]: Start isEmpty. Operand 493 states and 580 transitions. [2025-03-09 00:27:00,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-03-09 00:27:00,445 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:27:00,446 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-09 00:27:00,446 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-09 00:27:00,446 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr151REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [getoptErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, getoptErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, getoptErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 356 more)] === [2025-03-09 00:27:00,446 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:27:00,446 INFO L85 PathProgramCache]: Analyzing trace with hash 1341079166, now seen corresponding path program 1 times [2025-03-09 00:27:00,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:27:00,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1207918369] [2025-03-09 00:27:00,446 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:27:00,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:27:00,910 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-09 00:27:00,940 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-09 00:27:00,940 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:27:00,940 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:27:01,512 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:27:01,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:27:01,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1207918369] [2025-03-09 00:27:01,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1207918369] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:27:01,514 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:27:01,514 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 00:27:01,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [538758913] [2025-03-09 00:27:01,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:27:01,514 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 00:27:01,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:27:01,514 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 00:27:01,514 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-09 00:27:01,515 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-09 00:27:05,539 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-09 00:27:09,624 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-09 00:27:11,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:27:11,313 INFO L93 Difference]: Finished difference Result 496 states and 583 transitions. [2025-03-09 00:27:11,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 00:27:11,314 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2025-03-09 00:27:11,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:27:11,315 INFO L225 Difference]: With dead ends: 496 [2025-03-09 00:27:11,315 INFO L226 Difference]: Without dead ends: 496 [2025-03-09 00:27:11,316 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-09 00:27:11,316 INFO L435 NwaCegarLoop]: 570 mSDtfsCounter, 10 mSDsluCounter, 824 mSDsCounter, 0 mSdLazyCounter, 331 mSolverCounterSat, 1 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.5s 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.8s IncrementalHoareTripleChecker+Time [2025-03-09 00:27:11,316 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.8s Time] [2025-03-09 00:27:11,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 496 states. [2025-03-09 00:27:11,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 496 to 495. [2025-03-09 00:27:11,324 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-09 00:27:11,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 495 states to 495 states and 582 transitions. [2025-03-09 00:27:11,326 INFO L78 Accepts]: Start accepts. Automaton has 495 states and 582 transitions. Word has length 6 [2025-03-09 00:27:11,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:27:11,327 INFO L471 AbstractCegarLoop]: Abstraction has 495 states and 582 transitions. [2025-03-09 00:27:11,327 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:27:11,327 INFO L276 IsEmpty]: Start isEmpty. Operand 495 states and 582 transitions. [2025-03-09 00:27:11,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-03-09 00:27:11,327 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:27:11,327 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:27:11,327 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-09 00:27:11,327 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr151REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [getoptErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, getoptErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, getoptErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 356 more)] === [2025-03-09 00:27:11,328 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:27:11,328 INFO L85 PathProgramCache]: Analyzing trace with hash 304890275, now seen corresponding path program 1 times [2025-03-09 00:27:11,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:27:11,328 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1773033664] [2025-03-09 00:27:11,328 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:27:11,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:27:11,744 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-09 00:27:11,779 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-09 00:27:11,779 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:27:11,779 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:27:12,447 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:27:12,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:27:12,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1773033664] [2025-03-09 00:27:12,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1773033664] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 00:27:12,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1263523119] [2025-03-09 00:27:12,449 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:27:12,449 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:27:12,449 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 00:27:12,452 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 00:27:12,453 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-09 00:27:13,113 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-09 00:27:13,282 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-09 00:27:13,282 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:27:13,282 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:27:13,290 INFO L256 TraceCheckSpWp]: Trace formula consists of 1659 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-09 00:27:13,294 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 00:27:13,685 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:27:13,685 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 00:27:14,070 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2025-03-09 00:27:14,134 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:27:14,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1263523119] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 00:27:14,135 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 00:27:14,135 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 13 [2025-03-09 00:27:14,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [366893730] [2025-03-09 00:27:14,135 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 00:27:14,135 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-09 00:27:14,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:27:14,136 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-09 00:27:14,136 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2025-03-09 00:27:14,136 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-09 00:27:18,162 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-09 00:27:22,213 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-09 00:27:25,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:27:25,839 INFO L93 Difference]: Finished difference Result 499 states and 586 transitions. [2025-03-09 00:27:25,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-09 00:27:25,840 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 14 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2025-03-09 00:27:25,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:27:25,842 INFO L225 Difference]: With dead ends: 499 [2025-03-09 00:27:25,842 INFO L226 Difference]: Without dead ends: 499 [2025-03-09 00:27:25,843 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=90, Invalid=150, Unknown=0, NotChecked=0, Total=240 [2025-03-09 00:27:25,843 INFO L435 NwaCegarLoop]: 570 mSDtfsCounter, 799 mSDsluCounter, 1514 mSDsCounter, 0 mSdLazyCounter, 649 mSolverCounterSat, 18 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.2s 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, 11.5s IncrementalHoareTripleChecker+Time [2025-03-09 00:27:25,843 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [810 Valid, 2084 Invalid, 669 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 649 Invalid, 2 Unknown, 0 Unchecked, 11.5s Time] [2025-03-09 00:27:25,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 499 states. [2025-03-09 00:27:25,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 499 to 499. [2025-03-09 00:27:25,855 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-09 00:27:25,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 499 states to 499 states and 586 transitions. [2025-03-09 00:27:25,857 INFO L78 Accepts]: Start accepts. Automaton has 499 states and 586 transitions. Word has length 9 [2025-03-09 00:27:25,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:27:25,857 INFO L471 AbstractCegarLoop]: Abstraction has 499 states and 586 transitions. [2025-03-09 00:27:25,857 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 14 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:27:25,857 INFO L276 IsEmpty]: Start isEmpty. Operand 499 states and 586 transitions. [2025-03-09 00:27:25,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-03-09 00:27:25,858 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:27:25,858 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1] [2025-03-09 00:27:25,871 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-09 00:27:26,062 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:27:26,062 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr148REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [getoptErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, getoptErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, getoptErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 356 more)] === [2025-03-09 00:27:26,062 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:27:26,062 INFO L85 PathProgramCache]: Analyzing trace with hash -2068675806, now seen corresponding path program 1 times [2025-03-09 00:27:26,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:27:26,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1840701911] [2025-03-09 00:27:26,063 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:27:26,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:27:26,633 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-09 00:27:26,668 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-09 00:27:26,669 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:27:26,669 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:27:27,094 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:27:27,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:27:27,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1840701911] [2025-03-09 00:27:27,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1840701911] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 00:27:27,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1642363767] [2025-03-09 00:27:27,094 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:27:27,095 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:27:27,095 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 00:27:27,098 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 00:27:27,100 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-09 00:27:27,825 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-09 00:27:27,996 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-09 00:27:27,997 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:27:27,997 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:27:28,004 INFO L256 TraceCheckSpWp]: Trace formula consists of 1705 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-09 00:27:28,006 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 00:27:28,129 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:27:28,129 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 00:27:28,437 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:27:28,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1642363767] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 00:27:28,438 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 00:27:28,438 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2025-03-09 00:27:28,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [358179397] [2025-03-09 00:27:28,438 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 00:27:28,438 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-09 00:27:28,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:27:28,439 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-09 00:27:28,439 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2025-03-09 00:27:28,439 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-09 00:27:28,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:27:28,645 INFO L93 Difference]: Finished difference Result 514 states and 601 transitions. [2025-03-09 00:27:28,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-09 00:27:28,645 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.727272727272727) internal successors, (30), 11 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2025-03-09 00:27:28,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:27:28,647 INFO L225 Difference]: With dead ends: 514 [2025-03-09 00:27:28,647 INFO L226 Difference]: Without dead ends: 514 [2025-03-09 00:27:28,647 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-09 00:27:28,648 INFO L435 NwaCegarLoop]: 575 mSDtfsCounter, 4 mSDsluCounter, 1716 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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.2s IncrementalHoareTripleChecker+Time [2025-03-09 00:27:28,648 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.2s Time] [2025-03-09 00:27:28,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 514 states. [2025-03-09 00:27:28,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 514 to 514. [2025-03-09 00:27:28,655 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-09 00:27:28,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 514 states to 514 states and 601 transitions. [2025-03-09 00:27:28,657 INFO L78 Accepts]: Start accepts. Automaton has 514 states and 601 transitions. Word has length 15 [2025-03-09 00:27:28,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:27:28,657 INFO L471 AbstractCegarLoop]: Abstraction has 514 states and 601 transitions. [2025-03-09 00:27:28,657 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.727272727272727) internal successors, (30), 11 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:27:28,657 INFO L276 IsEmpty]: Start isEmpty. Operand 514 states and 601 transitions. [2025-03-09 00:27:28,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-03-09 00:27:28,658 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:27:28,658 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1] [2025-03-09 00:27:28,669 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-09 00:27:28,858 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:27:28,859 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr148REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [getoptErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, getoptErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, getoptErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 356 more)] === [2025-03-09 00:27:28,859 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:27:28,859 INFO L85 PathProgramCache]: Analyzing trace with hash -591293091, now seen corresponding path program 2 times [2025-03-09 00:27:28,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:27:28,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [796203699] [2025-03-09 00:27:28,859 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 00:27:28,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:27:29,251 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 30 statements into 2 equivalence classes. [2025-03-09 00:27:29,338 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 6 of 30 statements. [2025-03-09 00:27:29,338 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 00:27:29,338 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:27:29,819 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2025-03-09 00:27:29,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:27:29,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [796203699] [2025-03-09 00:27:29,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [796203699] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:27:29,820 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:27:29,820 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 00:27:29,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697844619] [2025-03-09 00:27:29,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:27:29,820 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 00:27:29,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:27:29,821 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 00:27:29,821 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-09 00:27:29,821 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-09 00:27:32,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:27:32,535 INFO L93 Difference]: Finished difference Result 881 states and 1053 transitions. [2025-03-09 00:27:32,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 00:27:32,536 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-09 00:27:32,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:27:32,539 INFO L225 Difference]: With dead ends: 881 [2025-03-09 00:27:32,539 INFO L226 Difference]: Without dead ends: 881 [2025-03-09 00:27:32,539 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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-09 00:27:32,542 INFO L435 NwaCegarLoop]: 446 mSDtfsCounter, 483 mSDsluCounter, 728 mSDsCounter, 0 mSdLazyCounter, 459 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.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, 2.7s IncrementalHoareTripleChecker+Time [2025-03-09 00:27:32,543 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [483 Valid, 1174 Invalid, 476 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 459 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2025-03-09 00:27:32,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 881 states. [2025-03-09 00:27:32,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 881 to 560. [2025-03-09 00:27:32,558 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-09 00:27:32,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 560 states to 560 states and 676 transitions. [2025-03-09 00:27:32,561 INFO L78 Accepts]: Start accepts. Automaton has 560 states and 676 transitions. Word has length 30 [2025-03-09 00:27:32,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:27:32,561 INFO L471 AbstractCegarLoop]: Abstraction has 560 states and 676 transitions. [2025-03-09 00:27:32,561 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-09 00:27:32,562 INFO L276 IsEmpty]: Start isEmpty. Operand 560 states and 676 transitions. [2025-03-09 00:27:32,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-03-09 00:27:32,562 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:27:32,562 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1] [2025-03-09 00:27:32,562 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-09 00:27:32,562 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr149REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [getoptErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, getoptErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, getoptErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 356 more)] === [2025-03-09 00:27:32,563 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:27:32,564 INFO L85 PathProgramCache]: Analyzing trace with hash -591293090, now seen corresponding path program 1 times [2025-03-09 00:27:32,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:27:32,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1981290461] [2025-03-09 00:27:32,564 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:27:32,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:27:32,975 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-09 00:27:33,006 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-09 00:27:33,006 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:27:33,006 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:27:33,919 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:27:33,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:27:33,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1981290461] [2025-03-09 00:27:33,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1981290461] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 00:27:33,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [692975031] [2025-03-09 00:27:33,920 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:27:33,920 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:27:33,920 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 00:27:33,923 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 00:27:33,924 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-09 00:27:34,651 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-09 00:27:34,800 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-09 00:27:34,800 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:27:34,800 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:27:34,808 INFO L256 TraceCheckSpWp]: Trace formula consists of 1810 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-09 00:27:34,810 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 00:27:35,112 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:27:35,112 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 00:27:35,745 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:27:35,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [692975031] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 00:27:35,745 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 00:27:35,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 13 [2025-03-09 00:27:35,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2007442246] [2025-03-09 00:27:35,746 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 00:27:35,746 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-09 00:27:35,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:27:35,748 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-09 00:27:35,748 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-03-09 00:27:35,748 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-09 00:27:35,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:27:35,906 INFO L93 Difference]: Finished difference Result 566 states and 682 transitions. [2025-03-09 00:27:35,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-09 00:27:35,907 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.0) internal successors, (39), 13 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2025-03-09 00:27:35,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:27:35,908 INFO L225 Difference]: With dead ends: 566 [2025-03-09 00:27:35,908 INFO L226 Difference]: Without dead ends: 566 [2025-03-09 00:27:35,909 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 50 SyntacticMatches, 8 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-03-09 00:27:35,909 INFO L435 NwaCegarLoop]: 574 mSDtfsCounter, 2 mSDsluCounter, 1713 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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.1s IncrementalHoareTripleChecker+Time [2025-03-09 00:27:35,909 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.1s Time] [2025-03-09 00:27:35,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 566 states. [2025-03-09 00:27:35,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 566 to 566. [2025-03-09 00:27:35,917 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-09 00:27:35,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 566 states to 566 states and 682 transitions. [2025-03-09 00:27:35,919 INFO L78 Accepts]: Start accepts. Automaton has 566 states and 682 transitions. Word has length 30 [2025-03-09 00:27:35,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:27:35,919 INFO L471 AbstractCegarLoop]: Abstraction has 566 states and 682 transitions. [2025-03-09 00:27:35,920 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.0) internal successors, (39), 13 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:27:35,920 INFO L276 IsEmpty]: Start isEmpty. Operand 566 states and 682 transitions. [2025-03-09 00:27:35,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-03-09 00:27:35,920 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:27:35,920 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1] [2025-03-09 00:27:35,932 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-09 00:27:36,121 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:27:36,121 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr149REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [getoptErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, getoptErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, getoptErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 356 more)] === [2025-03-09 00:27:36,121 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:27:36,121 INFO L85 PathProgramCache]: Analyzing trace with hash -1529878722, now seen corresponding path program 2 times [2025-03-09 00:27:36,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:27:36,121 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1040999052] [2025-03-09 00:27:36,122 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 00:27:36,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:27:36,596 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 36 statements into 2 equivalence classes. [2025-03-09 00:27:36,650 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 6 of 36 statements. [2025-03-09 00:27:36,651 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 00:27:36,651 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:27:37,174 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-09 00:27:37,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:27:37,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1040999052] [2025-03-09 00:27:37,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1040999052] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:27:37,175 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:27:37,175 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 00:27:37,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1537982631] [2025-03-09 00:27:37,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:27:37,175 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 00:27:37,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:27:37,175 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 00:27:37,175 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-09 00:27:37,175 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-09 00:27:41,198 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-09 00:27:44,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:27:44,211 INFO L93 Difference]: Finished difference Result 1140 states and 1369 transitions. [2025-03-09 00:27:44,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 00:27:44,211 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2025-03-09 00:27:44,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:27:44,215 INFO L225 Difference]: With dead ends: 1140 [2025-03-09 00:27:44,215 INFO L226 Difference]: Without dead ends: 1140 [2025-03-09 00:27:44,215 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-03-09 00:27:44,216 INFO L435 NwaCegarLoop]: 395 mSDtfsCounter, 1093 mSDsluCounter, 1059 mSDsCounter, 0 mSdLazyCounter, 808 mSolverCounterSat, 59 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.7s 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, 6.9s IncrementalHoareTripleChecker+Time [2025-03-09 00:27:44,216 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1095 Valid, 1454 Invalid, 868 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 808 Invalid, 1 Unknown, 0 Unchecked, 6.9s Time] [2025-03-09 00:27:44,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1140 states. [2025-03-09 00:27:44,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1140 to 932. [2025-03-09 00:27:44,236 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-09 00:27:44,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 932 states to 932 states and 1317 transitions. [2025-03-09 00:27:44,239 INFO L78 Accepts]: Start accepts. Automaton has 932 states and 1317 transitions. Word has length 36 [2025-03-09 00:27:44,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:27:44,239 INFO L471 AbstractCegarLoop]: Abstraction has 932 states and 1317 transitions. [2025-03-09 00:27:44,239 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:27:44,239 INFO L276 IsEmpty]: Start isEmpty. Operand 932 states and 1317 transitions. [2025-03-09 00:27:44,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-03-09 00:27:44,239 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:27:44,240 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:27:44,240 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-09 00:27:44,240 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr146REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [getoptErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, getoptErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, getoptErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 356 more)] === [2025-03-09 00:27:44,240 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:27:44,240 INFO L85 PathProgramCache]: Analyzing trace with hash 112172141, now seen corresponding path program 1 times [2025-03-09 00:27:44,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:27:44,240 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [919686526] [2025-03-09 00:27:44,240 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:27:44,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:27:44,643 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-09 00:27:44,690 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-09 00:27:44,690 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:27:44,690 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:27:45,109 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-09 00:27:45,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:27:45,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [919686526] [2025-03-09 00:27:45,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [919686526] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:27:45,109 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:27:45,109 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 00:27:45,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1698901135] [2025-03-09 00:27:45,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:27:45,109 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 00:27:45,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:27:45,110 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 00:27:45,110 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 00:27:45,110 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-09 00:27:49,136 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-09 00:27:50,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:27:50,684 INFO L93 Difference]: Finished difference Result 1001 states and 1313 transitions. [2025-03-09 00:27:50,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 00:27:50,684 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 44 [2025-03-09 00:27:50,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:27:50,689 INFO L225 Difference]: With dead ends: 1001 [2025-03-09 00:27:50,689 INFO L226 Difference]: Without dead ends: 1001 [2025-03-09 00:27:50,689 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 00:27:50,690 INFO L435 NwaCegarLoop]: 466 mSDtfsCounter, 275 mSDsluCounter, 363 mSDsCounter, 0 mSdLazyCounter, 271 mSolverCounterSat, 11 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.4s 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.5s IncrementalHoareTripleChecker+Time [2025-03-09 00:27:50,690 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.5s Time] [2025-03-09 00:27:50,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1001 states. [2025-03-09 00:27:50,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1001 to 927. [2025-03-09 00:27:50,706 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-09 00:27:50,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 927 states to 927 states and 1312 transitions. [2025-03-09 00:27:50,711 INFO L78 Accepts]: Start accepts. Automaton has 927 states and 1312 transitions. Word has length 44 [2025-03-09 00:27:50,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:27:50,711 INFO L471 AbstractCegarLoop]: Abstraction has 927 states and 1312 transitions. [2025-03-09 00:27:50,711 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:27:50,711 INFO L276 IsEmpty]: Start isEmpty. Operand 927 states and 1312 transitions. [2025-03-09 00:27:50,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-03-09 00:27:50,714 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:27:50,714 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:27:50,714 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-09 00:27:50,714 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr147REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [getoptErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, getoptErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, getoptErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 356 more)] === [2025-03-09 00:27:50,715 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:27:50,715 INFO L85 PathProgramCache]: Analyzing trace with hash 112172142, now seen corresponding path program 1 times [2025-03-09 00:27:50,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:27:50,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1394457904] [2025-03-09 00:27:50,715 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:27:50,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:27:51,129 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-09 00:27:51,247 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-09 00:27:51,248 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:27:51,249 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:27:52,353 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-09 00:27:52,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:27:52,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1394457904] [2025-03-09 00:27:52,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1394457904] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:27:52,354 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:27:52,354 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-09 00:27:52,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2033333141] [2025-03-09 00:27:52,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:27:52,354 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 00:27:52,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:27:52,356 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 00:27:52,356 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-09 00:27:52,356 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-09 00:27:56,388 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-09 00:27:57,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:27:57,175 INFO L93 Difference]: Finished difference Result 927 states and 1313 transitions. [2025-03-09 00:27:57,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 00:27:57,175 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 44 [2025-03-09 00:27:57,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:27:57,178 INFO L225 Difference]: With dead ends: 927 [2025-03-09 00:27:57,178 INFO L226 Difference]: Without dead ends: 927 [2025-03-09 00:27:57,178 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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-09 00:27:57,179 INFO L435 NwaCegarLoop]: 563 mSDtfsCounter, 378 mSDsluCounter, 1696 mSDsCounter, 0 mSdLazyCounter, 201 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.7s 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, 4.8s IncrementalHoareTripleChecker+Time [2025-03-09 00:27:57,179 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [388 Valid, 2259 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 201 Invalid, 1 Unknown, 0 Unchecked, 4.8s Time] [2025-03-09 00:27:57,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 927 states. [2025-03-09 00:27:57,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 927 to 926. [2025-03-09 00:27:57,191 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-09 00:27:57,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 926 states to 926 states and 1311 transitions. [2025-03-09 00:27:57,193 INFO L78 Accepts]: Start accepts. Automaton has 926 states and 1311 transitions. Word has length 44 [2025-03-09 00:27:57,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:27:57,193 INFO L471 AbstractCegarLoop]: Abstraction has 926 states and 1311 transitions. [2025-03-09 00:27:57,193 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:27:57,193 INFO L276 IsEmpty]: Start isEmpty. Operand 926 states and 1311 transitions. [2025-03-09 00:27:57,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-03-09 00:27:57,194 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:27:57,194 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:27:57,194 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-09 00:27:57,194 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr145REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [getoptErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, getoptErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, getoptErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 356 more)] === [2025-03-09 00:27:57,194 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:27:57,194 INFO L85 PathProgramCache]: Analyzing trace with hash 236958312, now seen corresponding path program 1 times [2025-03-09 00:27:57,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:27:57,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [520638794] [2025-03-09 00:27:57,195 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:27:57,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:27:57,590 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-09 00:27:57,620 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-09 00:27:57,620 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:27:57,621 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:27:58,335 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-09 00:27:58,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:27:58,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [520638794] [2025-03-09 00:27:58,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [520638794] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:27:58,336 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:27:58,336 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-09 00:27:58,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [503833415] [2025-03-09 00:27:58,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:27:58,336 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 00:27:58,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:27:58,337 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 00:27:58,337 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-09 00:27:58,337 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-09 00:28:02,365 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-09 00:28:06,470 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.10s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers []