./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 c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/busybox-1.22.0/head-2.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 215d23787da0121fe1d31fb918e95ec539d610f21ad7af0cf3de67b0df205419 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 12:03:51,729 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 12:03:51,780 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf [2025-02-06 12:03:51,785 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 12:03:51,785 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 12:03:51,804 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 12:03:51,804 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 12:03:51,804 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 12:03:51,805 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 12:03:51,805 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 12:03:51,805 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 12:03:51,805 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 12:03:51,805 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 12:03:51,805 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 12:03:51,805 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 12:03:51,805 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 12:03:51,805 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 12:03:51,805 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 12:03:51,805 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-02-06 12:03:51,806 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-02-06 12:03:51,806 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-02-06 12:03:51,806 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 12:03:51,806 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-06 12:03:51,806 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-06 12:03:51,806 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 12:03:51,806 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 12:03:51,806 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 12:03:51,806 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 12:03:51,806 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 12:03:51,806 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 12:03:51,806 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 12:03:51,806 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 12:03:51,806 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 12:03:51,806 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 12:03:51,806 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 12:03:51,806 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 12:03:51,807 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 12:03:51,807 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 12:03:51,807 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 12:03:51,807 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 215d23787da0121fe1d31fb918e95ec539d610f21ad7af0cf3de67b0df205419 [2025-02-06 12:03:52,049 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 12:03:52,058 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 12:03:52,060 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 12:03:52,061 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 12:03:52,061 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 12:03:52,062 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/busybox-1.22.0/head-2.i [2025-02-06 12:03:53,263 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d4aa9a329/e0e26fbc90a149c484c678d5e5082b59/FLAGc23655cc0 [2025-02-06 12:03:53,674 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 12:03:53,675 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/busybox-1.22.0/head-2.i [2025-02-06 12:03:53,709 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d4aa9a329/e0e26fbc90a149c484c678d5e5082b59/FLAGc23655cc0 [2025-02-06 12:03:53,725 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d4aa9a329/e0e26fbc90a149c484c678d5e5082b59 [2025-02-06 12:03:53,727 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 12:03:53,729 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 12:03:53,731 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 12:03:53,731 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 12:03:53,735 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 12:03:53,736 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 12:03:53" (1/1) ... [2025-02-06 12:03:53,737 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2992ca7a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:03:53, skipping insertion in model container [2025-02-06 12:03:53,738 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 12:03:53" (1/1) ... [2025-02-06 12:03:53,796 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 12:03:54,492 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 12:03:54,495 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 12:03:54,496 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 12:03:54,499 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 12:03:54,500 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 12:03:54,501 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 12:03:54,503 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 12:03:54,504 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 12:03:54,504 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 12:03:54,505 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 12:03:54,508 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 12:03:54,510 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 12:03:54,513 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 12:03:54,516 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 12:03:54,518 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 12:03:54,519 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 12:03:54,521 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 12:03:54,522 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 12:03:54,522 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 12:03:54,523 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 12:03:54,528 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 12:03:54,529 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 12:03:54,533 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 12:03:54,536 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 12:03:54,536 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 12:03:54,541 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 12:03:54,546 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 12:03:54,548 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 12:03:54,550 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 12:03:54,551 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 12:03:54,553 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 12:03:54,554 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 12:03:54,555 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 12:03:54,556 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 12:03:54,556 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 12:03:54,557 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 12:03:54,557 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 12:03:54,564 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 12:03:54,568 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 12:03:54,580 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 12:03:54,589 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 12:03:54,618 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 12:03:54,762 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 12:03:54,919 WARN L1212 FunctionHandler]: The following functions are not defined or handled internally: vasprintf [2025-02-06 12:03:54,925 INFO L204 MainTranslator]: Completed translation [2025-02-06 12:03:54,925 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:03:54 WrapperNode [2025-02-06 12:03:54,926 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 12:03:54,927 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 12:03:54,927 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 12:03:54,927 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 12:03:54,931 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:03:54" (1/1) ... [2025-02-06 12:03:54,966 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:03:54" (1/1) ... [2025-02-06 12:03:55,053 INFO L138 Inliner]: procedures = 581, calls = 697, calls flagged for inlining = 30, calls inlined = 28, statements flattened = 1394 [2025-02-06 12:03:55,055 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 12:03:55,055 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 12:03:55,055 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 12:03:55,056 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 12:03:55,062 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:03:54" (1/1) ... [2025-02-06 12:03:55,063 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:03:54" (1/1) ... [2025-02-06 12:03:55,080 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:03:54" (1/1) ... [2025-02-06 12:03:55,151 INFO L175 MemorySlicer]: Split 566 memory accesses to 19 slices as follows [2, 47, 3, 2, 4, 18, 1, 9, 20, 7, 9, 3, 32, 24, 10, 15, 355, 3, 2]. 63 percent of accesses are in the largest equivalence class. The 379 initializations are split as follows [2, 2, 3, 2, 1, 0, 0, 0, 4, 0, 1, 0, 2, 0, 7, 0, 355, 0, 0]. The 120 writes are split as follows [0, 35, 0, 0, 1, 4, 1, 6, 15, 7, 4, 3, 21, 21, 0, 1, 0, 0, 1]. [2025-02-06 12:03:55,151 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:03:54" (1/1) ... [2025-02-06 12:03:55,151 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:03:54" (1/1) ... [2025-02-06 12:03:55,212 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:03:54" (1/1) ... [2025-02-06 12:03:55,218 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:03:54" (1/1) ... [2025-02-06 12:03:55,289 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:03:54" (1/1) ... [2025-02-06 12:03:55,300 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:03:54" (1/1) ... [2025-02-06 12:03:55,326 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 12:03:55,327 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 12:03:55,327 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 12:03:55,328 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 12:03:55,328 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:03:54" (1/1) ... [2025-02-06 12:03:55,332 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 12:03:55,343 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:03:55,359 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 12:03:55,363 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 12:03:55,384 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#0 [2025-02-06 12:03:55,385 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#1 [2025-02-06 12:03:55,385 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#2 [2025-02-06 12:03:55,385 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#3 [2025-02-06 12:03:55,385 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#4 [2025-02-06 12:03:55,385 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#5 [2025-02-06 12:03:55,385 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#6 [2025-02-06 12:03:55,385 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#7 [2025-02-06 12:03:55,385 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#8 [2025-02-06 12:03:55,385 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#9 [2025-02-06 12:03:55,385 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#10 [2025-02-06 12:03:55,385 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#11 [2025-02-06 12:03:55,385 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#12 [2025-02-06 12:03:55,385 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#13 [2025-02-06 12:03:55,385 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#14 [2025-02-06 12:03:55,386 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#15 [2025-02-06 12:03:55,386 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#16 [2025-02-06 12:03:55,386 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#17 [2025-02-06 12:03:55,386 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#18 [2025-02-06 12:03:55,386 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#0 [2025-02-06 12:03:55,386 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#1 [2025-02-06 12:03:55,386 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#2 [2025-02-06 12:03:55,386 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#3 [2025-02-06 12:03:55,386 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#4 [2025-02-06 12:03:55,386 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#5 [2025-02-06 12:03:55,386 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#6 [2025-02-06 12:03:55,386 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#7 [2025-02-06 12:03:55,386 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#8 [2025-02-06 12:03:55,386 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#9 [2025-02-06 12:03:55,387 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#10 [2025-02-06 12:03:55,387 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#11 [2025-02-06 12:03:55,387 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#12 [2025-02-06 12:03:55,387 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#13 [2025-02-06 12:03:55,387 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#14 [2025-02-06 12:03:55,387 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#15 [2025-02-06 12:03:55,387 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#16 [2025-02-06 12:03:55,387 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#17 [2025-02-06 12:03:55,387 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#18 [2025-02-06 12:03:55,387 INFO L130 BoogieDeclarations]: Found specification of procedure _IO_getc [2025-02-06 12:03:55,387 INFO L138 BoogieDeclarations]: Found implementation of procedure _IO_getc [2025-02-06 12:03:55,387 INFO L130 BoogieDeclarations]: Found specification of procedure xrealloc [2025-02-06 12:03:55,387 INFO L138 BoogieDeclarations]: Found implementation of procedure xrealloc [2025-02-06 12:03:55,387 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-06 12:03:55,392 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#0 [2025-02-06 12:03:55,392 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#1 [2025-02-06 12:03:55,392 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#2 [2025-02-06 12:03:55,392 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#3 [2025-02-06 12:03:55,392 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#4 [2025-02-06 12:03:55,392 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#5 [2025-02-06 12:03:55,392 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#6 [2025-02-06 12:03:55,392 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#7 [2025-02-06 12:03:55,392 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#8 [2025-02-06 12:03:55,392 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#9 [2025-02-06 12:03:55,392 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#10 [2025-02-06 12:03:55,392 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#11 [2025-02-06 12:03:55,392 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#12 [2025-02-06 12:03:55,392 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#13 [2025-02-06 12:03:55,392 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#14 [2025-02-06 12:03:55,392 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#15 [2025-02-06 12:03:55,392 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#16 [2025-02-06 12:03:55,392 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#17 [2025-02-06 12:03:55,392 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#18 [2025-02-06 12:03:55,392 INFO L130 BoogieDeclarations]: Found specification of procedure bb_verror_msg [2025-02-06 12:03:55,392 INFO L138 BoogieDeclarations]: Found implementation of procedure bb_verror_msg [2025-02-06 12:03:55,392 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#0 [2025-02-06 12:03:55,392 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#1 [2025-02-06 12:03:55,392 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#2 [2025-02-06 12:03:55,392 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#3 [2025-02-06 12:03:55,392 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#4 [2025-02-06 12:03:55,392 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#5 [2025-02-06 12:03:55,392 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#6 [2025-02-06 12:03:55,392 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#7 [2025-02-06 12:03:55,392 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#8 [2025-02-06 12:03:55,392 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#9 [2025-02-06 12:03:55,393 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#10 [2025-02-06 12:03:55,393 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#11 [2025-02-06 12:03:55,393 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#12 [2025-02-06 12:03:55,393 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#13 [2025-02-06 12:03:55,393 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#14 [2025-02-06 12:03:55,393 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#15 [2025-02-06 12:03:55,393 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#16 [2025-02-06 12:03:55,393 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#17 [2025-02-06 12:03:55,393 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#18 [2025-02-06 12:03:55,393 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-06 12:03:55,393 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-06 12:03:55,393 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-06 12:03:55,393 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-02-06 12:03:55,393 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-02-06 12:03:55,393 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-02-06 12:03:55,393 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-02-06 12:03:55,393 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2025-02-06 12:03:55,393 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2025-02-06 12:03:55,393 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2025-02-06 12:03:55,393 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2025-02-06 12:03:55,393 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2025-02-06 12:03:55,393 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2025-02-06 12:03:55,393 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#13 [2025-02-06 12:03:55,393 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#14 [2025-02-06 12:03:55,393 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#15 [2025-02-06 12:03:55,393 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#16 [2025-02-06 12:03:55,393 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#17 [2025-02-06 12:03:55,393 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#18 [2025-02-06 12:03:55,393 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-06 12:03:55,393 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 12:03:55,393 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-02-06 12:03:55,393 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-02-06 12:03:55,393 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-02-06 12:03:55,393 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-02-06 12:03:55,393 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2025-02-06 12:03:55,393 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2025-02-06 12:03:55,393 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2025-02-06 12:03:55,393 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#7 [2025-02-06 12:03:55,393 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#8 [2025-02-06 12:03:55,394 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#9 [2025-02-06 12:03:55,394 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#10 [2025-02-06 12:03:55,394 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#11 [2025-02-06 12:03:55,394 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#12 [2025-02-06 12:03:55,394 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#13 [2025-02-06 12:03:55,394 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#14 [2025-02-06 12:03:55,394 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#15 [2025-02-06 12:03:55,394 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#16 [2025-02-06 12:03:55,394 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#17 [2025-02-06 12:03:55,394 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#18 [2025-02-06 12:03:55,394 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 12:03:55,394 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 12:03:55,394 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#0 [2025-02-06 12:03:55,394 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#1 [2025-02-06 12:03:55,394 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#2 [2025-02-06 12:03:55,394 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#3 [2025-02-06 12:03:55,394 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#4 [2025-02-06 12:03:55,394 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#5 [2025-02-06 12:03:55,394 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#6 [2025-02-06 12:03:55,394 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#7 [2025-02-06 12:03:55,394 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#8 [2025-02-06 12:03:55,394 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#9 [2025-02-06 12:03:55,394 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#10 [2025-02-06 12:03:55,394 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#11 [2025-02-06 12:03:55,394 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#12 [2025-02-06 12:03:55,394 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#13 [2025-02-06 12:03:55,394 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#14 [2025-02-06 12:03:55,394 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#15 [2025-02-06 12:03:55,394 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#16 [2025-02-06 12:03:55,394 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#17 [2025-02-06 12:03:55,395 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#18 [2025-02-06 12:03:55,395 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#0 [2025-02-06 12:03:55,395 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#1 [2025-02-06 12:03:55,395 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#2 [2025-02-06 12:03:55,395 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#3 [2025-02-06 12:03:55,398 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#4 [2025-02-06 12:03:55,398 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#5 [2025-02-06 12:03:55,398 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#6 [2025-02-06 12:03:55,398 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#7 [2025-02-06 12:03:55,398 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#8 [2025-02-06 12:03:55,398 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#9 [2025-02-06 12:03:55,398 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#10 [2025-02-06 12:03:55,398 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#11 [2025-02-06 12:03:55,398 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#12 [2025-02-06 12:03:55,398 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#13 [2025-02-06 12:03:55,398 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#14 [2025-02-06 12:03:55,398 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#15 [2025-02-06 12:03:55,398 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#16 [2025-02-06 12:03:55,398 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#17 [2025-02-06 12:03:55,398 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#18 [2025-02-06 12:03:55,398 INFO L130 BoogieDeclarations]: Found specification of procedure xmalloc [2025-02-06 12:03:55,399 INFO L138 BoogieDeclarations]: Found implementation of procedure xmalloc [2025-02-06 12:03:55,399 INFO L130 BoogieDeclarations]: Found specification of procedure getopt [2025-02-06 12:03:55,399 INFO L138 BoogieDeclarations]: Found implementation of procedure getopt [2025-02-06 12:03:55,399 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#0 [2025-02-06 12:03:55,399 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#1 [2025-02-06 12:03:55,399 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#2 [2025-02-06 12:03:55,399 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#3 [2025-02-06 12:03:55,399 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#4 [2025-02-06 12:03:55,399 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#5 [2025-02-06 12:03:55,399 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#6 [2025-02-06 12:03:55,399 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#7 [2025-02-06 12:03:55,399 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#8 [2025-02-06 12:03:55,399 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#9 [2025-02-06 12:03:55,399 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#10 [2025-02-06 12:03:55,399 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#11 [2025-02-06 12:03:55,399 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#12 [2025-02-06 12:03:55,399 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#13 [2025-02-06 12:03:55,399 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#14 [2025-02-06 12:03:55,399 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#15 [2025-02-06 12:03:55,399 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#16 [2025-02-06 12:03:55,399 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#17 [2025-02-06 12:03:55,399 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#18 [2025-02-06 12:03:55,399 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#0 [2025-02-06 12:03:55,399 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#1 [2025-02-06 12:03:55,399 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#2 [2025-02-06 12:03:55,399 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#3 [2025-02-06 12:03:55,399 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#4 [2025-02-06 12:03:55,399 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#5 [2025-02-06 12:03:55,399 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#6 [2025-02-06 12:03:55,399 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#7 [2025-02-06 12:03:55,399 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#8 [2025-02-06 12:03:55,399 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#9 [2025-02-06 12:03:55,399 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#10 [2025-02-06 12:03:55,399 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#11 [2025-02-06 12:03:55,399 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#12 [2025-02-06 12:03:55,399 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#13 [2025-02-06 12:03:55,399 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#14 [2025-02-06 12:03:55,399 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#15 [2025-02-06 12:03:55,399 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#16 [2025-02-06 12:03:55,399 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#17 [2025-02-06 12:03:55,399 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#18 [2025-02-06 12:03:55,399 INFO L130 BoogieDeclarations]: Found specification of procedure bb_simple_perror_msg [2025-02-06 12:03:55,399 INFO L138 BoogieDeclarations]: Found implementation of procedure bb_simple_perror_msg [2025-02-06 12:03:55,399 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-06 12:03:55,399 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-06 12:03:55,399 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-06 12:03:55,399 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-02-06 12:03:55,399 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-02-06 12:03:55,399 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-02-06 12:03:55,400 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-02-06 12:03:55,400 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2025-02-06 12:03:55,400 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2025-02-06 12:03:55,400 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2025-02-06 12:03:55,400 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#7 [2025-02-06 12:03:55,400 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#8 [2025-02-06 12:03:55,400 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#9 [2025-02-06 12:03:55,400 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#10 [2025-02-06 12:03:55,401 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#11 [2025-02-06 12:03:55,401 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#12 [2025-02-06 12:03:55,401 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#13 [2025-02-06 12:03:55,401 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#14 [2025-02-06 12:03:55,401 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#15 [2025-02-06 12:03:55,401 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#16 [2025-02-06 12:03:55,401 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#17 [2025-02-06 12:03:55,401 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#18 [2025-02-06 12:03:55,401 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-06 12:03:55,401 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-06 12:03:55,401 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-06 12:03:55,401 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-02-06 12:03:55,401 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-02-06 12:03:55,401 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-02-06 12:03:55,401 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-02-06 12:03:55,401 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2025-02-06 12:03:55,402 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2025-02-06 12:03:55,402 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2025-02-06 12:03:55,402 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2025-02-06 12:03:55,402 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2025-02-06 12:03:55,402 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2025-02-06 12:03:55,403 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#13 [2025-02-06 12:03:55,403 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#14 [2025-02-06 12:03:55,403 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#15 [2025-02-06 12:03:55,403 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#16 [2025-02-06 12:03:55,403 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#17 [2025-02-06 12:03:55,403 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#18 [2025-02-06 12:03:55,403 INFO L130 BoogieDeclarations]: Found specification of procedure xmalloc_fgets [2025-02-06 12:03:55,403 INFO L138 BoogieDeclarations]: Found implementation of procedure xmalloc_fgets [2025-02-06 12:03:55,403 INFO L130 BoogieDeclarations]: Found specification of procedure bb_error_msg_and_die [2025-02-06 12:03:55,403 INFO L138 BoogieDeclarations]: Found implementation of procedure bb_error_msg_and_die [2025-02-06 12:03:55,403 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 12:03:55,403 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-06 12:03:55,403 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-06 12:03:55,403 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-02-06 12:03:55,403 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-02-06 12:03:55,403 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-02-06 12:03:55,404 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-02-06 12:03:55,404 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-02-06 12:03:55,404 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-02-06 12:03:55,404 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-02-06 12:03:55,404 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-02-06 12:03:55,404 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2025-02-06 12:03:55,404 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2025-02-06 12:03:55,404 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2025-02-06 12:03:55,404 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2025-02-06 12:03:55,404 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2025-02-06 12:03:55,404 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#16 [2025-02-06 12:03:55,404 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#17 [2025-02-06 12:03:55,404 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#18 [2025-02-06 12:03:55,890 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 12:03:55,891 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 12:03:56,118 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2863: havoc #t~nondet150; [2025-02-06 12:03:56,798 INFO L1309 $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-02-06 12:04:02,546 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2420: havoc fclose_if_not_stdin_#t~bitwise80#1; [2025-02-06 12:04:02,546 INFO L1309 $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-02-06 12:04:02,838 INFO L? ?]: Removed 962 outVars from TransFormulas that were not future-live. [2025-02-06 12:04:02,838 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 12:04:02,898 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 12:04:02,903 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 12:04:02,903 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 12:04:02 BoogieIcfgContainer [2025-02-06 12:04:02,903 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 12:04:02,906 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 12:04:02,906 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 12:04:02,911 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 12:04:02,912 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 12:03:53" (1/3) ... [2025-02-06 12:04:02,913 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ae56746 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 12:04:02, skipping insertion in model container [2025-02-06 12:04:02,914 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:03:54" (2/3) ... [2025-02-06 12:04:02,914 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ae56746 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 12:04:02, skipping insertion in model container [2025-02-06 12:04:02,915 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 12:04:02" (3/3) ... [2025-02-06 12:04:02,916 INFO L128 eAbstractionObserver]: Analyzing ICFG head-2.i [2025-02-06 12:04:02,932 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 12:04:02,934 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG head-2.i that has 48 procedures, 1081 locations, 1 initial locations, 41 loop locations, and 359 error locations. [2025-02-06 12:04:02,998 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 12:04:03,009 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;@60e0277f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 12:04:03,010 INFO L334 AbstractCegarLoop]: Starting to check reachability of 359 error locations. [2025-02-06 12:04:03,019 INFO L276 IsEmpty]: Start isEmpty. Operand has 724 states, 431 states have (on average 1.8700696055684454) internal successors, (806), 686 states have internal predecessors, (806), 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-02-06 12:04:03,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2025-02-06 12:04:03,025 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:04:03,025 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2025-02-06 12:04:03,026 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr152REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [getoptErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, getoptErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, getoptErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 356 more)] === [2025-02-06 12:04:03,030 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:04:03,031 INFO L85 PathProgramCache]: Analyzing trace with hash 1368321, now seen corresponding path program 1 times [2025-02-06 12:04:03,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:04:03,038 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1224830407] [2025-02-06 12:04:03,039 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:04:03,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:04:03,885 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-06 12:04:04,087 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-06 12:04:04,088 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:04:04,088 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:04:04,661 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:04:04,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:04:04,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1224830407] [2025-02-06 12:04:04,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1224830407] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:04:04,663 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:04:04,663 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 12:04:04,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1109461004] [2025-02-06 12:04:04,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:04:04,669 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 12:04:04,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:04:04,690 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 12:04:04,691 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:04:04,694 INFO L87 Difference]: Start difference. First operand has 724 states, 431 states have (on average 1.8700696055684454) internal successors, (806), 686 states have internal predecessors, (806), 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-02-06 12:04:08,745 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-02-06 12:04:10,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:04:10,506 INFO L93 Difference]: Finished difference Result 710 states and 846 transitions. [2025-02-06 12:04:10,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 12:04:10,509 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-02-06 12:04:10,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:04:10,518 INFO L225 Difference]: With dead ends: 710 [2025-02-06 12:04:10,518 INFO L226 Difference]: Without dead ends: 710 [2025-02-06 12:04:10,519 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-02-06 12:04:10,522 INFO L435 NwaCegarLoop]: 473 mSDtfsCounter, 298 mSDsluCounter, 362 mSDsCounter, 0 mSdLazyCounter, 273 mSolverCounterSat, 9 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 301 SdHoareTripleChecker+Valid, 835 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.7s IncrementalHoareTripleChecker+Time [2025-02-06 12:04:10,522 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [301 Valid, 835 Invalid, 283 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 273 Invalid, 1 Unknown, 0 Unchecked, 5.7s Time] [2025-02-06 12:04:10,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 710 states. [2025-02-06 12:04:10,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 710 to 500. [2025-02-06 12:04:10,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 500 states, 310 states have (on average 1.761290322580645) internal successors, (546), 472 states have internal predecessors, (546), 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-02-06 12:04:10,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 500 states to 500 states and 587 transitions. [2025-02-06 12:04:10,576 INFO L78 Accepts]: Start accepts. Automaton has 500 states and 587 transitions. Word has length 3 [2025-02-06 12:04:10,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:04:10,577 INFO L471 AbstractCegarLoop]: Abstraction has 500 states and 587 transitions. [2025-02-06 12:04:10,577 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-02-06 12:04:10,577 INFO L276 IsEmpty]: Start isEmpty. Operand 500 states and 587 transitions. [2025-02-06 12:04:10,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2025-02-06 12:04:10,577 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:04:10,577 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2025-02-06 12:04:10,578 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 12:04:10,578 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr153REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [getoptErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, getoptErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, getoptErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 356 more)] === [2025-02-06 12:04:10,578 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:04:10,578 INFO L85 PathProgramCache]: Analyzing trace with hash 1368322, now seen corresponding path program 1 times [2025-02-06 12:04:10,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:04:10,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1412868723] [2025-02-06 12:04:10,578 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:04:10,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:04:11,115 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-06 12:04:11,150 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-06 12:04:11,150 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:04:11,150 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:04:11,629 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:04:11,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:04:11,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1412868723] [2025-02-06 12:04:11,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1412868723] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:04:11,630 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:04:11,630 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 12:04:11,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1000763647] [2025-02-06 12:04:11,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:04:11,634 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 12:04:11,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:04:11,634 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 12:04:11,634 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:04:11,634 INFO L87 Difference]: Start difference. First operand 500 states and 587 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-02-06 12:04:15,661 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-02-06 12:04:16,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:04:16,603 INFO L93 Difference]: Finished difference Result 499 states and 586 transitions. [2025-02-06 12:04:16,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 12:04:16,604 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-02-06 12:04:16,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:04:16,607 INFO L225 Difference]: With dead ends: 499 [2025-02-06 12:04:16,607 INFO L226 Difference]: Without dead ends: 499 [2025-02-06 12:04:16,607 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-02-06 12:04:16,608 INFO L435 NwaCegarLoop]: 578 mSDtfsCounter, 10 mSDsluCounter, 417 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 995 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-02-06 12:04:16,608 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 995 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 164 Invalid, 1 Unknown, 0 Unchecked, 4.9s Time] [2025-02-06 12:04:16,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 499 states. [2025-02-06 12:04:16,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 499 to 499. [2025-02-06 12:04:16,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 499 states, 310 states have (on average 1.7580645161290323) 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-02-06 12:04:16,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 499 states to 499 states and 586 transitions. [2025-02-06 12:04:16,623 INFO L78 Accepts]: Start accepts. Automaton has 499 states and 586 transitions. Word has length 3 [2025-02-06 12:04:16,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:04:16,623 INFO L471 AbstractCegarLoop]: Abstraction has 499 states and 586 transitions. [2025-02-06 12:04:16,623 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-02-06 12:04:16,624 INFO L276 IsEmpty]: Start isEmpty. Operand 499 states and 586 transitions. [2025-02-06 12:04:16,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-02-06 12:04:16,624 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:04:16,624 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-02-06 12:04:16,624 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 12:04:16,624 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr148REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [getoptErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, getoptErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, getoptErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 356 more)] === [2025-02-06 12:04:16,624 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:04:16,625 INFO L85 PathProgramCache]: Analyzing trace with hash 2110248861, now seen corresponding path program 1 times [2025-02-06 12:04:16,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:04:16,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860967868] [2025-02-06 12:04:16,625 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:04:16,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:04:17,034 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-06 12:04:17,060 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-06 12:04:17,060 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:04:17,060 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:04:17,301 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:04:17,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:04:17,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860967868] [2025-02-06 12:04:17,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [860967868] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:04:17,302 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:04:17,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 12:04:17,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [453785196] [2025-02-06 12:04:17,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:04:17,303 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 12:04:17,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:04:17,304 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 12:04:17,304 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:04:17,304 INFO L87 Difference]: Start difference. First operand 499 states and 586 transitions. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 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-02-06 12:04:17,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:04:17,380 INFO L93 Difference]: Finished difference Result 502 states and 590 transitions. [2025-02-06 12:04:17,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 12:04:17,381 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 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-02-06 12:04:17,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:04:17,383 INFO L225 Difference]: With dead ends: 502 [2025-02-06 12:04:17,383 INFO L226 Difference]: Without dead ends: 502 [2025-02-06 12:04:17,384 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:04:17,385 INFO L435 NwaCegarLoop]: 581 mSDtfsCounter, 2 mSDsluCounter, 578 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1159 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 12:04:17,385 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1159 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 12:04:17,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 502 states. [2025-02-06 12:04:17,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 502 to 500. [2025-02-06 12:04:17,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 500 states, 311 states have (on average 1.7556270096463023) internal successors, (546), 472 states have internal predecessors, (546), 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-02-06 12:04:17,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 500 states to 500 states and 587 transitions. [2025-02-06 12:04:17,404 INFO L78 Accepts]: Start accepts. Automaton has 500 states and 587 transitions. Word has length 6 [2025-02-06 12:04:17,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:04:17,404 INFO L471 AbstractCegarLoop]: Abstraction has 500 states and 587 transitions. [2025-02-06 12:04:17,404 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 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-02-06 12:04:17,404 INFO L276 IsEmpty]: Start isEmpty. Operand 500 states and 587 transitions. [2025-02-06 12:04:17,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-02-06 12:04:17,404 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:04:17,404 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-02-06 12:04:17,405 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 12:04:17,405 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr151REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [getoptErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, getoptErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, getoptErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 356 more)] === [2025-02-06 12:04:17,405 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:04:17,405 INFO L85 PathProgramCache]: Analyzing trace with hash 2110249022, now seen corresponding path program 1 times [2025-02-06 12:04:17,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:04:17,407 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1148445417] [2025-02-06 12:04:17,407 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:04:17,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:04:18,012 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-06 12:04:18,040 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-06 12:04:18,041 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:04:18,041 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:04:18,613 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:04:18,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:04:18,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1148445417] [2025-02-06 12:04:18,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1148445417] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:04:18,614 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:04:18,614 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 12:04:18,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [473750853] [2025-02-06 12:04:18,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:04:18,614 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 12:04:18,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:04:18,616 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 12:04:18,616 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-06 12:04:18,616 INFO L87 Difference]: Start difference. First operand 500 states and 587 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-02-06 12:04:22,652 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-02-06 12:04:26,680 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-02-06 12:04:27,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:04:27,829 INFO L93 Difference]: Finished difference Result 502 states and 589 transitions. [2025-02-06 12:04:27,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 12:04:27,829 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-02-06 12:04:27,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:04:27,833 INFO L225 Difference]: With dead ends: 502 [2025-02-06 12:04:27,833 INFO L226 Difference]: Without dead ends: 502 [2025-02-06 12:04:27,833 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-02-06 12:04:27,834 INFO L435 NwaCegarLoop]: 576 mSDtfsCounter, 11 mSDsluCounter, 419 mSDsCounter, 0 mSdLazyCounter, 175 mSolverCounterSat, 0 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 995 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 175 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.2s IncrementalHoareTripleChecker+Time [2025-02-06 12:04:27,834 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 995 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 175 Invalid, 2 Unknown, 0 Unchecked, 9.2s Time] [2025-02-06 12:04:27,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 502 states. [2025-02-06 12:04:27,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 502 to 501. [2025-02-06 12:04:27,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 501 states, 312 states have (on average 1.7532051282051282) internal successors, (547), 473 states have internal predecessors, (547), 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-02-06 12:04:27,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 501 states to 501 states and 588 transitions. [2025-02-06 12:04:27,850 INFO L78 Accepts]: Start accepts. Automaton has 501 states and 588 transitions. Word has length 6 [2025-02-06 12:04:27,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:04:27,850 INFO L471 AbstractCegarLoop]: Abstraction has 501 states and 588 transitions. [2025-02-06 12:04:27,850 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-02-06 12:04:27,850 INFO L276 IsEmpty]: Start isEmpty. Operand 501 states and 588 transitions. [2025-02-06 12:04:27,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-02-06 12:04:27,851 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:04:27,851 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:04:27,851 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 12:04:27,851 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr148REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [getoptErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, getoptErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, getoptErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 356 more)] === [2025-02-06 12:04:27,852 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:04:27,852 INFO L85 PathProgramCache]: Analyzing trace with hash 993571868, now seen corresponding path program 1 times [2025-02-06 12:04:27,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:04:27,852 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [967231666] [2025-02-06 12:04:27,852 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:04:27,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:04:28,440 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-06 12:04:28,476 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-06 12:04:28,477 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:04:28,477 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:04:28,773 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:04:28,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:04:28,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [967231666] [2025-02-06 12:04:28,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [967231666] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 12:04:28,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [73465174] [2025-02-06 12:04:28,773 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:04:28,773 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:04:28,774 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:04:28,784 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 12:04:28,792 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-06 12:04:29,601 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-06 12:04:29,766 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-06 12:04:29,766 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:04:29,766 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:04:29,775 INFO L256 TraceCheckSpWp]: Trace formula consists of 1663 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-06 12:04:29,779 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 12:04:29,861 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:04:29,862 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 12:04:29,983 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:04:29,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [73465174] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 12:04:29,984 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 12:04:29,985 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-02-06 12:04:29,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1918917104] [2025-02-06 12:04:29,985 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 12:04:29,985 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 12:04:29,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:04:29,985 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 12:04:29,985 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-02-06 12:04:29,986 INFO L87 Difference]: Start difference. First operand 501 states and 588 transitions. Second operand has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 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-02-06 12:04:30,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:04:30,159 INFO L93 Difference]: Finished difference Result 509 states and 598 transitions. [2025-02-06 12:04:30,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 12:04:30,160 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 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-02-06 12:04:30,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:04:30,162 INFO L225 Difference]: With dead ends: 509 [2025-02-06 12:04:30,162 INFO L226 Difference]: Without dead ends: 509 [2025-02-06 12:04:30,162 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-02-06 12:04:30,163 INFO L435 NwaCegarLoop]: 581 mSDtfsCounter, 4 mSDsluCounter, 1734 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 2315 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 12:04:30,164 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 2315 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 12:04:30,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 509 states. [2025-02-06 12:04:30,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 509 to 509. [2025-02-06 12:04:30,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 509 states, 320 states have (on average 1.740625) internal successors, (557), 481 states have internal predecessors, (557), 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-02-06 12:04:30,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 509 states to 509 states and 598 transitions. [2025-02-06 12:04:30,176 INFO L78 Accepts]: Start accepts. Automaton has 509 states and 598 transitions. Word has length 9 [2025-02-06 12:04:30,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:04:30,176 INFO L471 AbstractCegarLoop]: Abstraction has 509 states and 598 transitions. [2025-02-06 12:04:30,176 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 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-02-06 12:04:30,180 INFO L276 IsEmpty]: Start isEmpty. Operand 509 states and 598 transitions. [2025-02-06 12:04:30,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-02-06 12:04:30,181 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:04:30,181 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:04:30,193 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-06 12:04:30,381 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:04:30,382 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr151REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [getoptErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, getoptErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, getoptErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 356 more)] === [2025-02-06 12:04:30,382 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:04:30,382 INFO L85 PathProgramCache]: Analyzing trace with hash 993572029, now seen corresponding path program 1 times [2025-02-06 12:04:30,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:04:30,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [629328487] [2025-02-06 12:04:30,382 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:04:30,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:04:30,922 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-06 12:04:30,954 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-06 12:04:30,955 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:04:30,955 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:04:31,791 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:04:31,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:04:31,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [629328487] [2025-02-06 12:04:31,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [629328487] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 12:04:31,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [24357266] [2025-02-06 12:04:31,792 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:04:31,792 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:04:31,792 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:04:31,795 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 12:04:31,796 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-06 12:04:32,700 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-06 12:04:32,896 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-06 12:04:32,896 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:04:32,896 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:04:32,907 INFO L256 TraceCheckSpWp]: Trace formula consists of 1659 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-02-06 12:04:32,910 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 12:04:33,372 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:04:33,372 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 12:04:33,698 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-02-06 12:04:33,762 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:04:33,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [24357266] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 12:04:33,762 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 12:04:33,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 13 [2025-02-06 12:04:33,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1785148570] [2025-02-06 12:04:33,762 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 12:04:33,763 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-02-06 12:04:33,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:04:33,764 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-02-06 12:04:33,764 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2025-02-06 12:04:33,767 INFO L87 Difference]: Start difference. First operand 509 states and 598 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-02-06 12:04:37,803 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-02-06 12:04:41,869 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-06 12:04:45,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:04:45,091 INFO L93 Difference]: Finished difference Result 508 states and 595 transitions. [2025-02-06 12:04:45,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 12:04:45,091 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-02-06 12:04:45,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:04:45,096 INFO L225 Difference]: With dead ends: 508 [2025-02-06 12:04:45,096 INFO L226 Difference]: Without dead ends: 508 [2025-02-06 12:04:45,097 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-02-06 12:04:45,102 INFO L435 NwaCegarLoop]: 576 mSDtfsCounter, 801 mSDsluCounter, 1266 mSDsCounter, 0 mSdLazyCounter, 517 mSolverCounterSat, 15 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 812 SdHoareTripleChecker+Valid, 1842 SdHoareTripleChecker+Invalid, 534 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 517 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.1s IncrementalHoareTripleChecker+Time [2025-02-06 12:04:45,102 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [812 Valid, 1842 Invalid, 534 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 517 Invalid, 2 Unknown, 0 Unchecked, 11.1s Time] [2025-02-06 12:04:45,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 508 states. [2025-02-06 12:04:45,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 508 to 508. [2025-02-06 12:04:45,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 508 states, 320 states have (on average 1.73125) internal successors, (554), 480 states have internal predecessors, (554), 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-02-06 12:04:45,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 508 states to 508 states and 595 transitions. [2025-02-06 12:04:45,119 INFO L78 Accepts]: Start accepts. Automaton has 508 states and 595 transitions. Word has length 9 [2025-02-06 12:04:45,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:04:45,120 INFO L471 AbstractCegarLoop]: Abstraction has 508 states and 595 transitions. [2025-02-06 12:04:45,120 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-02-06 12:04:45,120 INFO L276 IsEmpty]: Start isEmpty. Operand 508 states and 595 transitions. [2025-02-06 12:04:45,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-02-06 12:04:45,120 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:04:45,120 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1] [2025-02-06 12:04:45,138 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-06 12:04:45,321 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:04:45,321 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr148REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [getoptErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, getoptErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, getoptErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 356 more)] === [2025-02-06 12:04:45,322 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:04:45,322 INFO L85 PathProgramCache]: Analyzing trace with hash 1556944605, now seen corresponding path program 2 times [2025-02-06 12:04:45,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:04:45,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1692825795] [2025-02-06 12:04:45,322 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 12:04:45,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:04:45,767 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 18 statements into 2 equivalence classes. [2025-02-06 12:04:45,822 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 6 of 18 statements. [2025-02-06 12:04:45,822 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 12:04:45,822 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:04:46,575 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-02-06 12:04:46,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:04:46,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1692825795] [2025-02-06 12:04:46,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1692825795] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:04:46,575 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:04:46,575 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 12:04:46,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [68941370] [2025-02-06 12:04:46,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:04:46,576 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 12:04:46,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:04:46,577 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 12:04:46,577 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-02-06 12:04:46,577 INFO L87 Difference]: Start difference. First operand 508 states and 595 transitions. Second operand has 6 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:04:49,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:04:49,559 INFO L93 Difference]: Finished difference Result 880 states and 1052 transitions. [2025-02-06 12:04:49,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 12:04:49,560 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2025-02-06 12:04:49,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:04:49,564 INFO L225 Difference]: With dead ends: 880 [2025-02-06 12:04:49,564 INFO L226 Difference]: Without dead ends: 880 [2025-02-06 12:04:49,565 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-02-06 12:04:49,565 INFO L435 NwaCegarLoop]: 452 mSDtfsCounter, 494 mSDsluCounter, 1110 mSDsCounter, 0 mSdLazyCounter, 608 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 494 SdHoareTripleChecker+Valid, 1562 SdHoareTripleChecker+Invalid, 625 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 608 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2025-02-06 12:04:49,565 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [494 Valid, 1562 Invalid, 625 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 608 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2025-02-06 12:04:49,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 880 states. [2025-02-06 12:04:49,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 880 to 554. [2025-02-06 12:04:49,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 554 states, 363 states have (on average 1.721763085399449) internal successors, (625), 522 states have internal predecessors, (625), 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-02-06 12:04:49,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 554 states to 554 states and 670 transitions. [2025-02-06 12:04:49,587 INFO L78 Accepts]: Start accepts. Automaton has 554 states and 670 transitions. Word has length 18 [2025-02-06 12:04:49,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:04:49,588 INFO L471 AbstractCegarLoop]: Abstraction has 554 states and 670 transitions. [2025-02-06 12:04:49,588 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:04:49,588 INFO L276 IsEmpty]: Start isEmpty. Operand 554 states and 670 transitions. [2025-02-06 12:04:49,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-02-06 12:04:49,589 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:04:49,589 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1] [2025-02-06 12:04:49,589 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 12:04:49,589 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr149REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [getoptErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, getoptErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, getoptErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 356 more)] === [2025-02-06 12:04:49,589 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:04:49,590 INFO L85 PathProgramCache]: Analyzing trace with hash 1556944606, now seen corresponding path program 1 times [2025-02-06 12:04:49,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:04:49,590 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [705499035] [2025-02-06 12:04:49,590 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:04:49,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:04:50,035 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-02-06 12:04:50,070 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-02-06 12:04:50,071 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:04:50,071 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:04:50,562 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:04:50,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:04:50,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [705499035] [2025-02-06 12:04:50,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [705499035] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 12:04:50,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1601181105] [2025-02-06 12:04:50,563 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:04:50,563 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:04:50,563 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:04:50,568 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 12:04:50,577 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-06 12:04:51,356 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-02-06 12:04:51,522 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-02-06 12:04:51,522 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:04:51,522 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:04:51,532 INFO L256 TraceCheckSpWp]: Trace formula consists of 1726 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-06 12:04:51,534 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 12:04:51,704 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:04:51,704 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 12:04:52,156 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:04:52,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1601181105] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 12:04:52,156 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 12:04:52,156 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2025-02-06 12:04:52,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1912176664] [2025-02-06 12:04:52,156 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 12:04:52,156 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-06 12:04:52,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:04:52,157 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-06 12:04:52,157 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-02-06 12:04:52,157 INFO L87 Difference]: Start difference. First operand 554 states and 670 transitions. Second operand has 13 states, 13 states have (on average 2.769230769230769) internal successors, (36), 13 states have internal predecessors, (36), 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-02-06 12:04:52,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:04:52,375 INFO L93 Difference]: Finished difference Result 572 states and 688 transitions. [2025-02-06 12:04:52,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-06 12:04:52,376 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.769230769230769) internal successors, (36), 13 states have internal predecessors, (36), 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 18 [2025-02-06 12:04:52,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:04:52,377 INFO L225 Difference]: With dead ends: 572 [2025-02-06 12:04:52,378 INFO L226 Difference]: Without dead ends: 572 [2025-02-06 12:04:52,378 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-02-06 12:04:52,378 INFO L435 NwaCegarLoop]: 580 mSDtfsCounter, 4 mSDsluCounter, 1154 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 1734 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 12:04:52,378 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 1734 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 12:04:52,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 572 states. [2025-02-06 12:04:52,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 572 to 572. [2025-02-06 12:04:52,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 572 states, 381 states have (on average 1.6876640419947506) internal successors, (643), 540 states have internal predecessors, (643), 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-02-06 12:04:52,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 572 states to 572 states and 688 transitions. [2025-02-06 12:04:52,400 INFO L78 Accepts]: Start accepts. Automaton has 572 states and 688 transitions. Word has length 18 [2025-02-06 12:04:52,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:04:52,400 INFO L471 AbstractCegarLoop]: Abstraction has 572 states and 688 transitions. [2025-02-06 12:04:52,400 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.769230769230769) internal successors, (36), 13 states have internal predecessors, (36), 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-02-06 12:04:52,400 INFO L276 IsEmpty]: Start isEmpty. Operand 572 states and 688 transitions. [2025-02-06 12:04:52,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-02-06 12:04:52,401 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:04:52,401 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1] [2025-02-06 12:04:52,420 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-02-06 12:04:52,601 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:04:52,602 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr149REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [getoptErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, getoptErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, getoptErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 356 more)] === [2025-02-06 12:04:52,602 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:04:52,602 INFO L85 PathProgramCache]: Analyzing trace with hash -1244081730, now seen corresponding path program 2 times [2025-02-06 12:04:52,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:04:52,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595470566] [2025-02-06 12:04:52,602 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 12:04:52,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:04:53,079 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 36 statements into 2 equivalence classes. [2025-02-06 12:04:53,138 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 6 of 36 statements. [2025-02-06 12:04:53,139 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 12:04:53,139 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:04:54,015 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-06 12:04:54,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:04:54,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [595470566] [2025-02-06 12:04:54,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [595470566] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:04:54,015 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:04:54,015 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 12:04:54,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1399449996] [2025-02-06 12:04:54,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:04:54,015 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 12:04:54,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:04:54,016 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 12:04:54,016 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 12:04:54,017 INFO L87 Difference]: Start difference. First operand 572 states and 688 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-02-06 12:04:58,057 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-02-06 12:05:02,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:05:02,194 INFO L93 Difference]: Finished difference Result 1155 states and 1384 transitions. [2025-02-06 12:05:02,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 12:05:02,194 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-02-06 12:05:02,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:05:02,198 INFO L225 Difference]: With dead ends: 1155 [2025-02-06 12:05:02,198 INFO L226 Difference]: Without dead ends: 1155 [2025-02-06 12:05:02,199 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-02-06 12:05:02,199 INFO L435 NwaCegarLoop]: 401 mSDtfsCounter, 1726 mSDsluCounter, 690 mSDsCounter, 0 mSdLazyCounter, 587 mSolverCounterSat, 109 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1728 SdHoareTripleChecker+Valid, 1091 SdHoareTripleChecker+Invalid, 697 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 109 IncrementalHoareTripleChecker+Valid, 587 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.0s IncrementalHoareTripleChecker+Time [2025-02-06 12:05:02,199 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1728 Valid, 1091 Invalid, 697 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [109 Valid, 587 Invalid, 1 Unknown, 0 Unchecked, 8.0s Time] [2025-02-06 12:05:02,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1155 states. [2025-02-06 12:05:02,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1155 to 943. [2025-02-06 12:05:02,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 943 states, 718 states have (on average 1.7172701949860725) internal successors, (1233), 882 states have internal predecessors, (1233), 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-02-06 12:05:02,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 943 states to 943 states and 1328 transitions. [2025-02-06 12:05:02,223 INFO L78 Accepts]: Start accepts. Automaton has 943 states and 1328 transitions. Word has length 36 [2025-02-06 12:05:02,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:05:02,223 INFO L471 AbstractCegarLoop]: Abstraction has 943 states and 1328 transitions. [2025-02-06 12:05:02,224 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-02-06 12:05:02,224 INFO L276 IsEmpty]: Start isEmpty. Operand 943 states and 1328 transitions. [2025-02-06 12:05:02,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-02-06 12:05:02,225 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:05:02,226 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:05:02,226 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-06 12:05:02,226 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr146REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [getoptErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, getoptErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, getoptErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 356 more)] === [2025-02-06 12:05:02,226 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:05:02,226 INFO L85 PathProgramCache]: Analyzing trace with hash 732364551, now seen corresponding path program 1 times [2025-02-06 12:05:02,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:05:02,226 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076440383] [2025-02-06 12:05:02,226 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:05:02,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:05:02,640 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-02-06 12:05:02,690 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-02-06 12:05:02,691 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:05:02,691 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:05:03,218 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-06 12:05:03,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:05:03,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2076440383] [2025-02-06 12:05:03,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2076440383] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:05:03,219 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:05:03,219 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 12:05:03,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1134358530] [2025-02-06 12:05:03,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:05:03,219 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 12:05:03,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:05:03,220 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 12:05:03,220 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:05:03,220 INFO L87 Difference]: Start difference. First operand 943 states and 1328 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-02-06 12:05:07,248 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-02-06 12:05:08,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:05:08,803 INFO L93 Difference]: Finished difference Result 1013 states and 1325 transitions. [2025-02-06 12:05:08,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 12:05:08,804 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-02-06 12:05:08,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:05:08,807 INFO L225 Difference]: With dead ends: 1013 [2025-02-06 12:05:08,807 INFO L226 Difference]: Without dead ends: 1013 [2025-02-06 12:05:08,808 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-02-06 12:05:08,808 INFO L435 NwaCegarLoop]: 472 mSDtfsCounter, 278 mSDsluCounter, 369 mSDsCounter, 0 mSdLazyCounter, 271 mSolverCounterSat, 11 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 280 SdHoareTripleChecker+Valid, 841 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-02-06 12:05:08,808 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [280 Valid, 841 Invalid, 283 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 271 Invalid, 1 Unknown, 0 Unchecked, 5.5s Time] [2025-02-06 12:05:08,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1013 states. [2025-02-06 12:05:08,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1013 to 938. [2025-02-06 12:05:08,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 938 states, 718 states have (on average 1.7103064066852367) internal successors, (1228), 877 states have internal predecessors, (1228), 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-02-06 12:05:08,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 938 states to 938 states and 1323 transitions. [2025-02-06 12:05:08,831 INFO L78 Accepts]: Start accepts. Automaton has 938 states and 1323 transitions. Word has length 44 [2025-02-06 12:05:08,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:05:08,831 INFO L471 AbstractCegarLoop]: Abstraction has 938 states and 1323 transitions. [2025-02-06 12:05:08,832 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-02-06 12:05:08,832 INFO L276 IsEmpty]: Start isEmpty. Operand 938 states and 1323 transitions. [2025-02-06 12:05:08,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-02-06 12:05:08,832 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:05:08,833 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:05:08,833 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-06 12:05:08,833 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr147REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [getoptErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, getoptErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, getoptErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 356 more)] === [2025-02-06 12:05:08,833 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:05:08,833 INFO L85 PathProgramCache]: Analyzing trace with hash 732364552, now seen corresponding path program 1 times [2025-02-06 12:05:08,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:05:08,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [9551508] [2025-02-06 12:05:08,834 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:05:08,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:05:09,282 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-02-06 12:05:09,416 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-02-06 12:05:09,416 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:05:09,416 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:05:10,637 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-06 12:05:10,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:05:10,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [9551508] [2025-02-06 12:05:10,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [9551508] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:05:10,638 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:05:10,638 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 12:05:10,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2081922061] [2025-02-06 12:05:10,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:05:10,638 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 12:05:10,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:05:10,639 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 12:05:10,639 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-06 12:05:10,639 INFO L87 Difference]: Start difference. First operand 938 states and 1323 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-02-06 12:05:11,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:05:11,624 INFO L93 Difference]: Finished difference Result 938 states and 1324 transitions. [2025-02-06 12:05:11,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 12:05:11,625 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-02-06 12:05:11,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:05:11,630 INFO L225 Difference]: With dead ends: 938 [2025-02-06 12:05:11,630 INFO L226 Difference]: Without dead ends: 938 [2025-02-06 12:05:11,630 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-02-06 12:05:11,630 INFO L435 NwaCegarLoop]: 569 mSDtfsCounter, 384 mSDsluCounter, 1574 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 394 SdHoareTripleChecker+Valid, 2143 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-02-06 12:05:11,630 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [394 Valid, 2143 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-02-06 12:05:11,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 938 states. [2025-02-06 12:05:11,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 938 to 937. [2025-02-06 12:05:11,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 937 states, 718 states have (on average 1.7089136490250696) internal successors, (1227), 876 states have internal predecessors, (1227), 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-02-06 12:05:11,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 937 states to 937 states and 1322 transitions. [2025-02-06 12:05:11,654 INFO L78 Accepts]: Start accepts. Automaton has 937 states and 1322 transitions. Word has length 44 [2025-02-06 12:05:11,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:05:11,654 INFO L471 AbstractCegarLoop]: Abstraction has 937 states and 1322 transitions. [2025-02-06 12:05:11,655 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-02-06 12:05:11,655 INFO L276 IsEmpty]: Start isEmpty. Operand 937 states and 1322 transitions. [2025-02-06 12:05:11,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-02-06 12:05:11,655 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:05:11,655 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-02-06 12:05:11,656 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-06 12:05:11,656 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr131REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [getoptErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, getoptErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, getoptErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 356 more)] === [2025-02-06 12:05:11,656 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:05:11,656 INFO L85 PathProgramCache]: Analyzing trace with hash -560237880, now seen corresponding path program 1 times [2025-02-06 12:05:11,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:05:11,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [239415416] [2025-02-06 12:05:11,656 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:05:11,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:05:12,143 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-02-06 12:05:12,267 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-02-06 12:05:12,267 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:05:12,267 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:05:12,788 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-06 12:05:12,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:05:12,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [239415416] [2025-02-06 12:05:12,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [239415416] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:05:12,788 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:05:12,789 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 12:05:12,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [559217273] [2025-02-06 12:05:12,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:05:12,789 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 12:05:12,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:05:12,789 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 12:05:12,790 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-06 12:05:12,790 INFO L87 Difference]: Start difference. First operand 937 states and 1322 transitions. Second operand has 6 states, 6 states have (on average 3.0) 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-02-06 12:05:13,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:05:13,251 INFO L93 Difference]: Finished difference Result 956 states and 1347 transitions. [2025-02-06 12:05:13,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 12:05:13,251 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 47 [2025-02-06 12:05:13,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:05:13,254 INFO L225 Difference]: With dead ends: 956 [2025-02-06 12:05:13,254 INFO L226 Difference]: Without dead ends: 956 [2025-02-06 12:05:13,255 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-06 12:05:13,255 INFO L435 NwaCegarLoop]: 558 mSDtfsCounter, 422 mSDsluCounter, 1654 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 432 SdHoareTripleChecker+Valid, 2212 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-06 12:05:13,255 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [432 Valid, 2212 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-06 12:05:13,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 956 states. [2025-02-06 12:05:13,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 956 to 938. [2025-02-06 12:05:13,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 938 states, 719 states have (on average 1.7079276773296246) internal successors, (1228), 877 states have internal predecessors, (1228), 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-02-06 12:05:13,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 938 states to 938 states and 1323 transitions. [2025-02-06 12:05:13,273 INFO L78 Accepts]: Start accepts. Automaton has 938 states and 1323 transitions. Word has length 47 [2025-02-06 12:05:13,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:05:13,274 INFO L471 AbstractCegarLoop]: Abstraction has 938 states and 1323 transitions. [2025-02-06 12:05:13,274 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) 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-02-06 12:05:13,274 INFO L276 IsEmpty]: Start isEmpty. Operand 938 states and 1323 transitions. [2025-02-06 12:05:13,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-02-06 12:05:13,274 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:05:13,274 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-02-06 12:05:13,275 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-06 12:05:13,275 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr145REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [getoptErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, getoptErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, getoptErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 356 more)] === [2025-02-06 12:05:13,275 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:05:13,275 INFO L85 PathProgramCache]: Analyzing trace with hash -560236952, now seen corresponding path program 1 times [2025-02-06 12:05:13,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:05:13,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [19666740] [2025-02-06 12:05:13,275 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:05:13,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:05:13,794 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-02-06 12:05:13,833 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-02-06 12:05:13,834 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:05:13,834 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:05:14,473 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-06 12:05:14,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:05:14,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [19666740] [2025-02-06 12:05:14,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [19666740] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:05:14,474 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:05:14,474 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 12:05:14,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [983455762] [2025-02-06 12:05:14,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:05:14,476 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 12:05:14,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:05:14,476 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 12:05:14,476 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-02-06 12:05:14,476 INFO L87 Difference]: Start difference. First operand 938 states and 1323 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)