./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/busybox-1.22.0/head-1.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/busybox-1.22.0/head-1.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 0e88082971628d59ef5682895c2d853cfcbbf7f0162214aa0affb543a2978ac5 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 00:05:51,526 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 00:05:51,585 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf [2025-01-10 00:05:51,588 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 00:05:51,588 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 00:05:51,603 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 00:05:51,603 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 00:05:51,604 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 00:05:51,604 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 00:05:51,604 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 00:05:51,604 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-10 00:05:51,604 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-10 00:05:51,604 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 00:05:51,604 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 00:05:51,604 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 00:05:51,605 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 00:05:51,605 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 00:05:51,605 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 00:05:51,605 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-01-10 00:05:51,605 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-01-10 00:05:51,605 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-01-10 00:05:51,605 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-10 00:05:51,605 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-10 00:05:51,605 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 00:05:51,605 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 00:05:51,606 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 00:05:51,606 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-10 00:05:51,606 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 00:05:51,606 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 00:05:51,606 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 00:05:51,606 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 00:05:51,606 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 00:05:51,606 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 00:05:51,606 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 00:05:51,606 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 00:05:51,606 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 00:05:51,607 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 00:05:51,607 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-10 00:05:51,607 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 00:05:51,607 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-10 00:05:51,607 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-10 00:05:51,607 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-10 00:05:51,607 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-10 00:05:51,607 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-10 00:05:51,607 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 -> 0e88082971628d59ef5682895c2d853cfcbbf7f0162214aa0affb543a2978ac5 [2025-01-10 00:05:51,811 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 00:05:51,820 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 00:05:51,822 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 00:05:51,823 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 00:05:51,823 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 00:05:51,824 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-1.i [2025-01-10 00:05:53,009 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/15656f19d/66ba82eeb3ed40789200be05966c227a/FLAG4804e8fe9 [2025-01-10 00:05:53,450 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 00:05:53,451 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/busybox-1.22.0/head-1.i [2025-01-10 00:05:53,471 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/15656f19d/66ba82eeb3ed40789200be05966c227a/FLAG4804e8fe9 [2025-01-10 00:05:53,570 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/15656f19d/66ba82eeb3ed40789200be05966c227a [2025-01-10 00:05:53,572 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 00:05:53,573 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 00:05:53,574 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 00:05:53,574 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 00:05:53,576 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 00:05:53,577 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 12:05:53" (1/1) ... [2025-01-10 00:05:53,577 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@58c17987 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:05:53, skipping insertion in model container [2025-01-10 00:05:53,578 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 12:05:53" (1/1) ... [2025-01-10 00:05:53,609 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 00:05:54,153 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 00:05:54,154 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 00:05:54,155 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 00:05:54,157 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 00:05:54,158 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 00:05:54,158 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 00:05:54,160 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 00:05:54,160 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 00:05:54,161 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 00:05:54,161 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 00:05:54,163 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 00:05:54,163 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 00:05:54,165 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 00:05:54,166 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 00:05:54,166 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 00:05:54,167 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 00:05:54,167 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 00:05:54,168 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 00:05:54,168 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 00:05:54,169 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 00:05:54,170 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 00:05:54,171 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 00:05:54,174 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 00:05:54,176 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 00:05:54,176 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 00:05:54,179 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 00:05:54,181 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 00:05:54,183 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 00:05:54,185 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 00:05:54,186 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 00:05:54,187 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 00:05:54,188 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 00:05:54,188 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 00:05:54,189 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 00:05:54,189 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 00:05:54,190 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 00:05:54,190 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 00:05:54,196 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 00:05:54,200 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 00:05:54,205 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 00:05:54,211 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 00:05:54,233 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 00:05:54,314 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 00:05:54,439 WARN L1212 FunctionHandler]: The following functions are not defined or handled internally: vasprintf [2025-01-10 00:05:54,448 INFO L204 MainTranslator]: Completed translation [2025-01-10 00:05:54,449 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:05:54 WrapperNode [2025-01-10 00:05:54,449 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 00:05:54,450 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 00:05:54,451 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 00:05:54,451 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 00:05:54,455 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:05:54" (1/1) ... [2025-01-10 00:05:54,490 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:05:54" (1/1) ... [2025-01-10 00:05:54,544 INFO L138 Inliner]: procedures = 581, calls = 697, calls flagged for inlining = 30, calls inlined = 28, statements flattened = 1393 [2025-01-10 00:05:54,545 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 00:05:54,545 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 00:05:54,545 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 00:05:54,546 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 00:05:54,552 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:05:54" (1/1) ... [2025-01-10 00:05:54,552 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:05:54" (1/1) ... [2025-01-10 00:05:54,560 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:05:54" (1/1) ... [2025-01-10 00:05:54,603 INFO L175 MemorySlicer]: Split 566 memory accesses to 19 slices as follows [2, 3, 20, 2, 7, 3, 9, 2, 24, 10, 18, 355, 9, 4, 47, 1, 32, 15, 3]. 63 percent of accesses are in the largest equivalence class. The 379 initializations are split as follows [2, 3, 4, 2, 0, 0, 1, 0, 0, 7, 0, 355, 0, 1, 2, 0, 2, 0, 0]. The 120 writes are split as follows [0, 0, 15, 0, 7, 0, 4, 1, 21, 0, 4, 0, 6, 1, 35, 1, 21, 1, 3]. [2025-01-10 00:05:54,603 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:05:54" (1/1) ... [2025-01-10 00:05:54,603 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:05:54" (1/1) ... [2025-01-10 00:05:54,642 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:05:54" (1/1) ... [2025-01-10 00:05:54,645 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:05:54" (1/1) ... [2025-01-10 00:05:54,651 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:05:54" (1/1) ... [2025-01-10 00:05:54,665 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:05:54" (1/1) ... [2025-01-10 00:05:54,671 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:05:54" (1/1) ... [2025-01-10 00:05:54,727 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 00:05:54,728 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 00:05:54,728 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 00:05:54,728 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 00:05:54,728 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:05:54" (1/1) ... [2025-01-10 00:05:54,732 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 00:05:54,740 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:05:54,750 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-10 00:05:54,756 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-10 00:05:54,771 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#0 [2025-01-10 00:05:54,771 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#1 [2025-01-10 00:05:54,771 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#2 [2025-01-10 00:05:54,771 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#3 [2025-01-10 00:05:54,771 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#4 [2025-01-10 00:05:54,771 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#5 [2025-01-10 00:05:54,771 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#6 [2025-01-10 00:05:54,771 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#7 [2025-01-10 00:05:54,771 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#8 [2025-01-10 00:05:54,771 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#9 [2025-01-10 00:05:54,771 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#10 [2025-01-10 00:05:54,771 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#11 [2025-01-10 00:05:54,771 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#12 [2025-01-10 00:05:54,771 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#13 [2025-01-10 00:05:54,771 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#14 [2025-01-10 00:05:54,771 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#15 [2025-01-10 00:05:54,771 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#16 [2025-01-10 00:05:54,771 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#17 [2025-01-10 00:05:54,771 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#18 [2025-01-10 00:05:54,772 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#0 [2025-01-10 00:05:54,772 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#1 [2025-01-10 00:05:54,772 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#2 [2025-01-10 00:05:54,772 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#3 [2025-01-10 00:05:54,772 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#4 [2025-01-10 00:05:54,772 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#5 [2025-01-10 00:05:54,772 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#6 [2025-01-10 00:05:54,772 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#7 [2025-01-10 00:05:54,772 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#8 [2025-01-10 00:05:54,772 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#9 [2025-01-10 00:05:54,772 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#10 [2025-01-10 00:05:54,772 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#11 [2025-01-10 00:05:54,772 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#12 [2025-01-10 00:05:54,772 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#13 [2025-01-10 00:05:54,772 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#14 [2025-01-10 00:05:54,772 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#15 [2025-01-10 00:05:54,772 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#16 [2025-01-10 00:05:54,772 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#17 [2025-01-10 00:05:54,772 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#18 [2025-01-10 00:05:54,772 INFO L130 BoogieDeclarations]: Found specification of procedure _IO_getc [2025-01-10 00:05:54,772 INFO L138 BoogieDeclarations]: Found implementation of procedure _IO_getc [2025-01-10 00:05:54,772 INFO L130 BoogieDeclarations]: Found specification of procedure xrealloc [2025-01-10 00:05:54,772 INFO L138 BoogieDeclarations]: Found implementation of procedure xrealloc [2025-01-10 00:05:54,772 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-10 00:05:54,772 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#0 [2025-01-10 00:05:54,773 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#1 [2025-01-10 00:05:54,773 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#2 [2025-01-10 00:05:54,773 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#3 [2025-01-10 00:05:54,773 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#4 [2025-01-10 00:05:54,773 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#5 [2025-01-10 00:05:54,773 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#6 [2025-01-10 00:05:54,773 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#7 [2025-01-10 00:05:54,774 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#8 [2025-01-10 00:05:54,774 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#9 [2025-01-10 00:05:54,774 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#10 [2025-01-10 00:05:54,774 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#11 [2025-01-10 00:05:54,774 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#12 [2025-01-10 00:05:54,774 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#13 [2025-01-10 00:05:54,774 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#14 [2025-01-10 00:05:54,774 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#15 [2025-01-10 00:05:54,774 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#16 [2025-01-10 00:05:54,774 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#17 [2025-01-10 00:05:54,774 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#18 [2025-01-10 00:05:54,774 INFO L130 BoogieDeclarations]: Found specification of procedure bb_verror_msg [2025-01-10 00:05:54,774 INFO L138 BoogieDeclarations]: Found implementation of procedure bb_verror_msg [2025-01-10 00:05:54,774 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#0 [2025-01-10 00:05:54,774 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#1 [2025-01-10 00:05:54,774 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#2 [2025-01-10 00:05:54,774 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#3 [2025-01-10 00:05:54,774 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#4 [2025-01-10 00:05:54,774 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#5 [2025-01-10 00:05:54,774 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#6 [2025-01-10 00:05:54,774 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#7 [2025-01-10 00:05:54,774 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#8 [2025-01-10 00:05:54,774 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#9 [2025-01-10 00:05:54,774 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#10 [2025-01-10 00:05:54,774 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#11 [2025-01-10 00:05:54,774 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#12 [2025-01-10 00:05:54,774 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#13 [2025-01-10 00:05:54,774 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#14 [2025-01-10 00:05:54,774 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#15 [2025-01-10 00:05:54,774 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#16 [2025-01-10 00:05:54,775 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#17 [2025-01-10 00:05:54,775 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#18 [2025-01-10 00:05:54,775 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-10 00:05:54,775 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-10 00:05:54,775 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-01-10 00:05:54,775 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-01-10 00:05:54,775 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-01-10 00:05:54,775 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-01-10 00:05:54,775 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-01-10 00:05:54,775 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2025-01-10 00:05:54,775 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2025-01-10 00:05:54,775 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2025-01-10 00:05:54,775 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2025-01-10 00:05:54,775 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2025-01-10 00:05:54,775 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2025-01-10 00:05:54,775 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#13 [2025-01-10 00:05:54,775 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#14 [2025-01-10 00:05:54,775 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#15 [2025-01-10 00:05:54,775 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#16 [2025-01-10 00:05:54,775 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#17 [2025-01-10 00:05:54,775 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#18 [2025-01-10 00:05:54,775 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-10 00:05:54,775 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 00:05:54,775 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-01-10 00:05:54,775 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-01-10 00:05:54,775 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-01-10 00:05:54,775 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-01-10 00:05:54,775 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2025-01-10 00:05:54,775 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2025-01-10 00:05:54,775 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2025-01-10 00:05:54,775 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#7 [2025-01-10 00:05:54,775 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#8 [2025-01-10 00:05:54,775 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#9 [2025-01-10 00:05:54,775 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#10 [2025-01-10 00:05:54,775 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#11 [2025-01-10 00:05:54,775 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#12 [2025-01-10 00:05:54,775 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#13 [2025-01-10 00:05:54,775 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#14 [2025-01-10 00:05:54,776 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#15 [2025-01-10 00:05:54,776 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#16 [2025-01-10 00:05:54,776 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#17 [2025-01-10 00:05:54,776 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#18 [2025-01-10 00:05:54,776 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 00:05:54,776 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 00:05:54,776 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#0 [2025-01-10 00:05:54,776 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#1 [2025-01-10 00:05:54,776 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#2 [2025-01-10 00:05:54,776 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#3 [2025-01-10 00:05:54,776 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#4 [2025-01-10 00:05:54,777 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#5 [2025-01-10 00:05:54,777 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#6 [2025-01-10 00:05:54,777 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#7 [2025-01-10 00:05:54,777 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#8 [2025-01-10 00:05:54,777 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#9 [2025-01-10 00:05:54,777 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#10 [2025-01-10 00:05:54,777 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#11 [2025-01-10 00:05:54,777 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#12 [2025-01-10 00:05:54,777 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#13 [2025-01-10 00:05:54,777 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#14 [2025-01-10 00:05:54,777 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#15 [2025-01-10 00:05:54,777 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#16 [2025-01-10 00:05:54,778 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#17 [2025-01-10 00:05:54,778 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#18 [2025-01-10 00:05:54,778 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#0 [2025-01-10 00:05:54,778 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#1 [2025-01-10 00:05:54,778 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#2 [2025-01-10 00:05:54,778 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#3 [2025-01-10 00:05:54,778 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#4 [2025-01-10 00:05:54,778 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#5 [2025-01-10 00:05:54,778 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#6 [2025-01-10 00:05:54,778 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#7 [2025-01-10 00:05:54,778 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#8 [2025-01-10 00:05:54,778 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#9 [2025-01-10 00:05:54,778 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#10 [2025-01-10 00:05:54,778 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#11 [2025-01-10 00:05:54,778 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#12 [2025-01-10 00:05:54,778 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#13 [2025-01-10 00:05:54,779 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#14 [2025-01-10 00:05:54,779 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#15 [2025-01-10 00:05:54,779 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#16 [2025-01-10 00:05:54,779 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#17 [2025-01-10 00:05:54,779 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#18 [2025-01-10 00:05:54,779 INFO L130 BoogieDeclarations]: Found specification of procedure xmalloc [2025-01-10 00:05:54,779 INFO L138 BoogieDeclarations]: Found implementation of procedure xmalloc [2025-01-10 00:05:54,779 INFO L130 BoogieDeclarations]: Found specification of procedure getopt [2025-01-10 00:05:54,779 INFO L138 BoogieDeclarations]: Found implementation of procedure getopt [2025-01-10 00:05:54,779 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#0 [2025-01-10 00:05:54,779 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#1 [2025-01-10 00:05:54,779 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#2 [2025-01-10 00:05:54,779 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#3 [2025-01-10 00:05:54,779 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#4 [2025-01-10 00:05:54,779 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#5 [2025-01-10 00:05:54,779 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#6 [2025-01-10 00:05:54,780 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#7 [2025-01-10 00:05:54,780 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#8 [2025-01-10 00:05:54,780 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#9 [2025-01-10 00:05:54,780 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#10 [2025-01-10 00:05:54,780 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#11 [2025-01-10 00:05:54,780 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#12 [2025-01-10 00:05:54,780 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#13 [2025-01-10 00:05:54,780 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#14 [2025-01-10 00:05:54,780 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#15 [2025-01-10 00:05:54,780 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#16 [2025-01-10 00:05:54,780 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#17 [2025-01-10 00:05:54,780 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#18 [2025-01-10 00:05:54,780 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#0 [2025-01-10 00:05:54,780 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#1 [2025-01-10 00:05:54,780 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#2 [2025-01-10 00:05:54,780 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#3 [2025-01-10 00:05:54,780 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#4 [2025-01-10 00:05:54,780 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#5 [2025-01-10 00:05:54,780 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#6 [2025-01-10 00:05:54,780 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#7 [2025-01-10 00:05:54,780 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#8 [2025-01-10 00:05:54,780 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#9 [2025-01-10 00:05:54,780 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#10 [2025-01-10 00:05:54,783 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#11 [2025-01-10 00:05:54,783 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#12 [2025-01-10 00:05:54,783 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#13 [2025-01-10 00:05:54,783 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#14 [2025-01-10 00:05:54,783 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#15 [2025-01-10 00:05:54,783 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#16 [2025-01-10 00:05:54,783 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#17 [2025-01-10 00:05:54,783 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#18 [2025-01-10 00:05:54,783 INFO L130 BoogieDeclarations]: Found specification of procedure bb_simple_perror_msg [2025-01-10 00:05:54,783 INFO L138 BoogieDeclarations]: Found implementation of procedure bb_simple_perror_msg [2025-01-10 00:05:54,783 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-10 00:05:54,783 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-10 00:05:54,783 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-01-10 00:05:54,783 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-01-10 00:05:54,783 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-01-10 00:05:54,783 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-01-10 00:05:54,783 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-01-10 00:05:54,783 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2025-01-10 00:05:54,783 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2025-01-10 00:05:54,783 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2025-01-10 00:05:54,783 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#7 [2025-01-10 00:05:54,783 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#8 [2025-01-10 00:05:54,783 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#9 [2025-01-10 00:05:54,783 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#10 [2025-01-10 00:05:54,783 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#11 [2025-01-10 00:05:54,783 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#12 [2025-01-10 00:05:54,783 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#13 [2025-01-10 00:05:54,783 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#14 [2025-01-10 00:05:54,783 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#15 [2025-01-10 00:05:54,783 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#16 [2025-01-10 00:05:54,783 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#17 [2025-01-10 00:05:54,783 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#18 [2025-01-10 00:05:54,783 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-10 00:05:54,783 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-10 00:05:54,783 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-01-10 00:05:54,783 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-01-10 00:05:54,783 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-01-10 00:05:54,783 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-01-10 00:05:54,783 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-01-10 00:05:54,784 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2025-01-10 00:05:54,784 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2025-01-10 00:05:54,784 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2025-01-10 00:05:54,784 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2025-01-10 00:05:54,784 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2025-01-10 00:05:54,784 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2025-01-10 00:05:54,784 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#13 [2025-01-10 00:05:54,784 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#14 [2025-01-10 00:05:54,784 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#15 [2025-01-10 00:05:54,784 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#16 [2025-01-10 00:05:54,784 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#17 [2025-01-10 00:05:54,784 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#18 [2025-01-10 00:05:54,784 INFO L130 BoogieDeclarations]: Found specification of procedure xmalloc_fgets [2025-01-10 00:05:54,784 INFO L138 BoogieDeclarations]: Found implementation of procedure xmalloc_fgets [2025-01-10 00:05:54,784 INFO L130 BoogieDeclarations]: Found specification of procedure bb_error_msg_and_die [2025-01-10 00:05:54,784 INFO L138 BoogieDeclarations]: Found implementation of procedure bb_error_msg_and_die [2025-01-10 00:05:54,784 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-10 00:05:54,784 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-10 00:05:54,784 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-10 00:05:54,784 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-01-10 00:05:54,784 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-01-10 00:05:54,784 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-01-10 00:05:54,784 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-01-10 00:05:54,784 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-01-10 00:05:54,784 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-01-10 00:05:54,784 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-01-10 00:05:54,784 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-01-10 00:05:54,784 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2025-01-10 00:05:54,784 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2025-01-10 00:05:54,784 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2025-01-10 00:05:54,784 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2025-01-10 00:05:54,784 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2025-01-10 00:05:54,784 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#16 [2025-01-10 00:05:54,784 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#17 [2025-01-10 00:05:54,784 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#18 [2025-01-10 00:05:55,171 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 00:05:55,172 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 00:06:04,123 INFO L? ?]: Removed 960 outVars from TransFormulas that were not future-live. [2025-01-10 00:06:04,123 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 00:06:04,168 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 00:06:04,172 INFO L312 CfgBuilder]: Removed 38 assume(true) statements. [2025-01-10 00:06:04,173 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 12:06:04 BoogieIcfgContainer [2025-01-10 00:06:04,173 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 00:06:04,175 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-10 00:06:04,175 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-10 00:06:04,179 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-10 00:06:04,179 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 12:05:53" (1/3) ... [2025-01-10 00:06:04,180 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20cc702e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 12:06:04, skipping insertion in model container [2025-01-10 00:06:04,181 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:05:54" (2/3) ... [2025-01-10 00:06:04,181 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20cc702e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 12:06:04, skipping insertion in model container [2025-01-10 00:06:04,181 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 12:06:04" (3/3) ... [2025-01-10 00:06:04,182 INFO L128 eAbstractionObserver]: Analyzing ICFG head-1.i [2025-01-10 00:06:04,194 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-10 00:06:04,197 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG head-1.i that has 48 procedures, 1054 locations, 1 initial locations, 41 loop locations, and 359 error locations. [2025-01-10 00:06:04,248 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 00:06:04,260 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;@2b5ed997, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 00:06:04,260 INFO L334 AbstractCegarLoop]: Starting to check reachability of 359 error locations. [2025-01-10 00:06:04,265 INFO L276 IsEmpty]: Start isEmpty. Operand has 715 states, 423 states have (on average 1.8817966903073287) internal successors, (796), 677 states have internal predecessors, (796), 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-01-10 00:06:04,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2025-01-10 00:06:04,268 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:06:04,269 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2025-01-10 00:06:04,269 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [getoptErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, getoptErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, getoptErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 356 more)] === [2025-01-10 00:06:04,273 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:06:04,273 INFO L85 PathProgramCache]: Analyzing trace with hash 1090381, now seen corresponding path program 1 times [2025-01-10 00:06:04,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:06:04,279 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1902878240] [2025-01-10 00:06:04,279 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:06:04,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:06:04,894 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 00:06:05,020 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 00:06:05,020 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:06:05,020 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:06:05,471 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:06:05,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:06:05,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1902878240] [2025-01-10 00:06:05,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1902878240] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:06:05,473 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:06:05,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 00:06:05,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [195276367] [2025-01-10 00:06:05,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:06:05,477 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:06:05,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:06:05,495 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:06:05,496 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:06:05,499 INFO L87 Difference]: Start difference. First operand has 715 states, 423 states have (on average 1.8817966903073287) internal successors, (796), 677 states have internal predecessors, (796), 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-01-10 00:06:09,549 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-01-10 00:06:10,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:06:10,932 INFO L93 Difference]: Finished difference Result 699 states and 833 transitions. [2025-01-10 00:06:10,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:06:10,934 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-01-10 00:06:10,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:06:10,941 INFO L225 Difference]: With dead ends: 699 [2025-01-10 00:06:10,941 INFO L226 Difference]: Without dead ends: 699 [2025-01-10 00:06:10,942 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-01-10 00:06:10,944 INFO L435 NwaCegarLoop]: 465 mSDtfsCounter, 293 mSDsluCounter, 354 mSDsCounter, 0 mSdLazyCounter, 271 mSolverCounterSat, 9 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 296 SdHoareTripleChecker+Valid, 819 SdHoareTripleChecker+Invalid, 281 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 271 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.3s IncrementalHoareTripleChecker+Time [2025-01-10 00:06:10,944 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [296 Valid, 819 Invalid, 281 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 271 Invalid, 1 Unknown, 0 Unchecked, 5.3s Time] [2025-01-10 00:06:10,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 699 states. [2025-01-10 00:06:10,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 699 to 493. [2025-01-10 00:06:10,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 493 states, 303 states have (on average 1.7755775577557755) internal successors, (538), 465 states have internal predecessors, (538), 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-01-10 00:06:10,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 493 states to 493 states and 579 transitions. [2025-01-10 00:06:10,996 INFO L78 Accepts]: Start accepts. Automaton has 493 states and 579 transitions. Word has length 3 [2025-01-10 00:06:10,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:06:10,996 INFO L471 AbstractCegarLoop]: Abstraction has 493 states and 579 transitions. [2025-01-10 00:06:10,996 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-01-10 00:06:10,996 INFO L276 IsEmpty]: Start isEmpty. Operand 493 states and 579 transitions. [2025-01-10 00:06:10,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2025-01-10 00:06:10,997 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:06:10,997 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2025-01-10 00:06:10,997 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-10 00:06:10,997 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [getoptErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, getoptErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, getoptErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 356 more)] === [2025-01-10 00:06:10,998 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:06:10,998 INFO L85 PathProgramCache]: Analyzing trace with hash 1090382, now seen corresponding path program 1 times [2025-01-10 00:06:10,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:06:10,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [665886301] [2025-01-10 00:06:10,998 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:06:10,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:06:11,424 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 00:06:11,508 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 00:06:11,508 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:06:11,508 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:06:11,881 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:06:11,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:06:11,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [665886301] [2025-01-10 00:06:11,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [665886301] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:06:11,882 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:06:11,882 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 00:06:11,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [365095315] [2025-01-10 00:06:11,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:06:11,883 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:06:11,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:06:11,883 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:06:11,883 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:06:11,884 INFO L87 Difference]: Start difference. First operand 493 states and 579 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-01-10 00:06:15,909 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-10 00:06:16,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:06:16,556 INFO L93 Difference]: Finished difference Result 492 states and 578 transitions. [2025-01-10 00:06:16,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:06:16,557 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-01-10 00:06:16,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:06:16,559 INFO L225 Difference]: With dead ends: 492 [2025-01-10 00:06:16,559 INFO L226 Difference]: Without dead ends: 492 [2025-01-10 00:06:16,559 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-01-10 00:06:16,560 INFO L435 NwaCegarLoop]: 571 mSDtfsCounter, 10 mSDsluCounter, 410 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 981 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2025-01-10 00:06:16,560 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 981 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 162 Invalid, 1 Unknown, 0 Unchecked, 4.6s Time] [2025-01-10 00:06:16,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 492 states. [2025-01-10 00:06:16,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 492 to 492. [2025-01-10 00:06:16,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 492 states, 303 states have (on average 1.7722772277227723) internal successors, (537), 464 states have internal predecessors, (537), 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-01-10 00:06:16,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 492 states to 492 states and 578 transitions. [2025-01-10 00:06:16,573 INFO L78 Accepts]: Start accepts. Automaton has 492 states and 578 transitions. Word has length 3 [2025-01-10 00:06:16,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:06:16,573 INFO L471 AbstractCegarLoop]: Abstraction has 492 states and 578 transitions. [2025-01-10 00:06:16,573 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-01-10 00:06:16,573 INFO L276 IsEmpty]: Start isEmpty. Operand 492 states and 578 transitions. [2025-01-10 00:06:16,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-01-10 00:06:16,573 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:06:16,573 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-01-10 00:06:16,573 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-10 00:06:16,574 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [getoptErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, getoptErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, getoptErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 356 more)] === [2025-01-10 00:06:16,574 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:06:16,574 INFO L85 PathProgramCache]: Analyzing trace with hash -1875161175, now seen corresponding path program 1 times [2025-01-10 00:06:16,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:06:16,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [666494192] [2025-01-10 00:06:16,574 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:06:16,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:06:17,210 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-10 00:06:17,268 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-10 00:06:17,273 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:06:17,273 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:06:17,771 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:06:17,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:06:17,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [666494192] [2025-01-10 00:06:17,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [666494192] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:06:17,772 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:06:17,772 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 00:06:17,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1649833829] [2025-01-10 00:06:17,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:06:17,772 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 00:06:17,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:06:17,772 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 00:06:17,773 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-10 00:06:17,773 INFO L87 Difference]: Start difference. First operand 492 states and 578 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-01-10 00:06:21,796 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-10 00:06:25,898 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.10s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-10 00:06:26,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:06:26,534 INFO L93 Difference]: Finished difference Result 495 states and 581 transitions. [2025-01-10 00:06:26,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 00:06:26,534 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-01-10 00:06:26,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:06:26,536 INFO L225 Difference]: With dead ends: 495 [2025-01-10 00:06:26,536 INFO L226 Difference]: Without dead ends: 495 [2025-01-10 00:06:26,536 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-10 00:06:26,537 INFO L435 NwaCegarLoop]: 569 mSDtfsCounter, 11 mSDsluCounter, 412 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 1 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 981 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.7s IncrementalHoareTripleChecker+Time [2025-01-10 00:06:26,537 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 981 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 173 Invalid, 2 Unknown, 0 Unchecked, 8.7s Time] [2025-01-10 00:06:26,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 495 states. [2025-01-10 00:06:26,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 495 to 494. [2025-01-10 00:06:26,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 494 states, 305 states have (on average 1.7672131147540984) internal successors, (539), 466 states have internal predecessors, (539), 23 states have call successors, (23), 10 states have call predecessors, (23), 9 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-01-10 00:06:26,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 494 states to 494 states and 580 transitions. [2025-01-10 00:06:26,556 INFO L78 Accepts]: Start accepts. Automaton has 494 states and 580 transitions. Word has length 6 [2025-01-10 00:06:26,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:06:26,556 INFO L471 AbstractCegarLoop]: Abstraction has 494 states and 580 transitions. [2025-01-10 00:06:26,556 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-01-10 00:06:26,556 INFO L276 IsEmpty]: Start isEmpty. Operand 494 states and 580 transitions. [2025-01-10 00:06:26,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-01-10 00:06:26,556 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:06:26,556 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:06:26,556 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-10 00:06:26,557 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [getoptErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, getoptErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, getoptErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 356 more)] === [2025-01-10 00:06:26,557 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:06:26,559 INFO L85 PathProgramCache]: Analyzing trace with hash 1714069366, now seen corresponding path program 1 times [2025-01-10 00:06:26,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:06:26,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1639558671] [2025-01-10 00:06:26,559 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:06:26,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:06:26,956 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-10 00:06:26,979 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-10 00:06:26,979 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:06:26,980 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:06:27,481 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:06:27,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:06:27,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1639558671] [2025-01-10 00:06:27,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1639558671] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 00:06:27,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [483533580] [2025-01-10 00:06:27,481 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:06:27,481 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:06:27,481 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:06:27,488 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-01-10 00:06:27,492 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-01-10 00:06:28,165 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-10 00:06:28,319 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-10 00:06:28,320 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:06:28,320 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:06:28,329 INFO L256 TraceCheckSpWp]: Trace formula consists of 1659 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-01-10 00:06:28,333 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 00:06:28,559 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:06:28,561 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 00:06:28,765 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-01-10 00:06:28,796 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:06:28,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [483533580] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 00:06:28,797 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 00:06:28,797 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 13 [2025-01-10 00:06:28,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1763439625] [2025-01-10 00:06:28,797 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 00:06:28,797 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-01-10 00:06:28,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:06:28,798 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-01-10 00:06:28,798 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2025-01-10 00:06:28,798 INFO L87 Difference]: Start difference. First operand 494 states and 580 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-01-10 00:06:32,824 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-01-10 00:06:36,900 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-10 00:06:40,973 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-10 00:06:42,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:06:42,716 INFO L93 Difference]: Finished difference Result 498 states and 584 transitions. [2025-01-10 00:06:42,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-10 00:06:42,716 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-01-10 00:06:42,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:06:42,719 INFO L225 Difference]: With dead ends: 498 [2025-01-10 00:06:42,719 INFO L226 Difference]: Without dead ends: 498 [2025-01-10 00:06:42,720 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=90, Invalid=150, Unknown=0, NotChecked=0, Total=240 [2025-01-10 00:06:42,720 INFO L435 NwaCegarLoop]: 569 mSDtfsCounter, 796 mSDsluCounter, 1506 mSDsCounter, 0 mSdLazyCounter, 631 mSolverCounterSat, 19 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 807 SdHoareTripleChecker+Valid, 2075 SdHoareTripleChecker+Invalid, 653 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 631 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.8s IncrementalHoareTripleChecker+Time [2025-01-10 00:06:42,720 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [807 Valid, 2075 Invalid, 653 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 631 Invalid, 3 Unknown, 0 Unchecked, 13.8s Time] [2025-01-10 00:06:42,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 498 states. [2025-01-10 00:06:42,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 498 to 498. [2025-01-10 00:06:42,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 498 states, 310 states have (on average 1.7516129032258065) internal successors, (543), 470 states have internal predecessors, (543), 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-01-10 00:06:42,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 498 states to 498 states and 584 transitions. [2025-01-10 00:06:42,731 INFO L78 Accepts]: Start accepts. Automaton has 498 states and 584 transitions. Word has length 9 [2025-01-10 00:06:42,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:06:42,732 INFO L471 AbstractCegarLoop]: Abstraction has 498 states and 584 transitions. [2025-01-10 00:06:42,732 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-01-10 00:06:42,732 INFO L276 IsEmpty]: Start isEmpty. Operand 498 states and 584 transitions. [2025-01-10 00:06:42,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-01-10 00:06:42,732 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:06:42,732 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1] [2025-01-10 00:06:42,744 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-01-10 00:06:42,933 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:06:42,933 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [getoptErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, getoptErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, getoptErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 356 more)] === [2025-01-10 00:06:42,933 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:06:42,934 INFO L85 PathProgramCache]: Analyzing trace with hash 158835541, now seen corresponding path program 1 times [2025-01-10 00:06:42,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:06:42,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [824017060] [2025-01-10 00:06:42,934 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:06:42,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:06:43,358 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-01-10 00:06:43,385 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-01-10 00:06:43,386 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:06:43,386 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:06:43,677 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:06:43,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:06:43,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [824017060] [2025-01-10 00:06:43,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [824017060] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 00:06:43,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1670674300] [2025-01-10 00:06:43,677 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:06:43,677 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:06:43,678 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:06:43,679 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-01-10 00:06:43,681 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-01-10 00:06:44,433 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-01-10 00:06:44,605 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-01-10 00:06:44,605 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:06:44,605 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:06:44,610 INFO L256 TraceCheckSpWp]: Trace formula consists of 1705 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-10 00:06:44,612 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 00:06:44,698 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:06:44,698 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 00:06:44,867 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:06:44,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1670674300] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 00:06:44,868 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 00:06:44,868 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2025-01-10 00:06:44,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1691931270] [2025-01-10 00:06:44,868 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 00:06:44,868 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-10 00:06:44,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:06:44,869 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-10 00:06:44,869 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2025-01-10 00:06:44,869 INFO L87 Difference]: Start difference. First operand 498 states and 584 transitions. Second operand has 11 states, 11 states have (on average 2.727272727272727) internal successors, (30), 11 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:06:45,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:06:45,011 INFO L93 Difference]: Finished difference Result 513 states and 599 transitions. [2025-01-10 00:06:45,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-10 00:06:45,011 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.727272727272727) internal successors, (30), 11 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2025-01-10 00:06:45,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:06:45,013 INFO L225 Difference]: With dead ends: 513 [2025-01-10 00:06:45,013 INFO L226 Difference]: Without dead ends: 513 [2025-01-10 00:06:45,013 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2025-01-10 00:06:45,014 INFO L435 NwaCegarLoop]: 574 mSDtfsCounter, 4 mSDsluCounter, 1713 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 2287 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 00:06:45,014 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 2287 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 00:06:45,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 513 states. [2025-01-10 00:06:45,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 513 to 513. [2025-01-10 00:06:45,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 513 states, 325 states have (on average 1.716923076923077) internal successors, (558), 485 states have internal predecessors, (558), 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-01-10 00:06:45,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 513 states to 513 states and 599 transitions. [2025-01-10 00:06:45,023 INFO L78 Accepts]: Start accepts. Automaton has 513 states and 599 transitions. Word has length 15 [2025-01-10 00:06:45,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:06:45,023 INFO L471 AbstractCegarLoop]: Abstraction has 513 states and 599 transitions. [2025-01-10 00:06:45,024 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.727272727272727) internal successors, (30), 11 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:06:45,024 INFO L276 IsEmpty]: Start isEmpty. Operand 513 states and 599 transitions. [2025-01-10 00:06:45,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-01-10 00:06:45,024 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:06:45,024 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1] [2025-01-10 00:06:45,034 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-01-10 00:06:45,227 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:06:45,228 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [getoptErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, getoptErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, getoptErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 356 more)] === [2025-01-10 00:06:45,228 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:06:45,228 INFO L85 PathProgramCache]: Analyzing trace with hash -2099403800, now seen corresponding path program 2 times [2025-01-10 00:06:45,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:06:45,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1561480439] [2025-01-10 00:06:45,229 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 00:06:45,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:06:45,731 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 30 statements into 2 equivalence classes. [2025-01-10 00:06:45,762 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 6 of 30 statements. [2025-01-10 00:06:45,762 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 00:06:45,762 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:06:46,212 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2025-01-10 00:06:46,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:06:46,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1561480439] [2025-01-10 00:06:46,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1561480439] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:06:46,213 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:06:46,213 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 00:06:46,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [438389009] [2025-01-10 00:06:46,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:06:46,213 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 00:06:46,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:06:46,213 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 00:06:46,214 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-01-10 00:06:46,214 INFO L87 Difference]: Start difference. First operand 513 states and 599 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-01-10 00:06:47,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:06:47,586 INFO L93 Difference]: Finished difference Result 879 states and 1049 transitions. [2025-01-10 00:06:47,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:06:47,587 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2025-01-10 00:06:47,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:06:47,589 INFO L225 Difference]: With dead ends: 879 [2025-01-10 00:06:47,589 INFO L226 Difference]: Without dead ends: 879 [2025-01-10 00:06:47,590 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-01-10 00:06:47,590 INFO L435 NwaCegarLoop]: 445 mSDtfsCounter, 1381 mSDsluCounter, 726 mSDsCounter, 0 mSdLazyCounter, 456 mSolverCounterSat, 120 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1381 SdHoareTripleChecker+Valid, 1171 SdHoareTripleChecker+Invalid, 576 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 120 IncrementalHoareTripleChecker+Valid, 456 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-01-10 00:06:47,590 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1381 Valid, 1171 Invalid, 576 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [120 Valid, 456 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-01-10 00:06:47,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 879 states. [2025-01-10 00:06:47,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 879 to 556. [2025-01-10 00:06:47,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 556 states, 365 states have (on average 1.7123287671232876) internal successors, (625), 524 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-01-10 00:06:47,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 556 states to 556 states and 670 transitions. [2025-01-10 00:06:47,601 INFO L78 Accepts]: Start accepts. Automaton has 556 states and 670 transitions. Word has length 30 [2025-01-10 00:06:47,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:06:47,601 INFO L471 AbstractCegarLoop]: Abstraction has 556 states and 670 transitions. [2025-01-10 00:06:47,601 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-01-10 00:06:47,601 INFO L276 IsEmpty]: Start isEmpty. Operand 556 states and 670 transitions. [2025-01-10 00:06:47,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-01-10 00:06:47,602 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:06:47,602 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1] [2025-01-10 00:06:47,602 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-10 00:06:47,602 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [getoptErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, getoptErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, getoptErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 356 more)] === [2025-01-10 00:06:47,602 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:06:47,602 INFO L85 PathProgramCache]: Analyzing trace with hash -2099403799, now seen corresponding path program 1 times [2025-01-10 00:06:47,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:06:47,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429990032] [2025-01-10 00:06:47,603 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:06:47,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:06:47,954 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-01-10 00:06:47,976 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-01-10 00:06:47,976 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:06:47,977 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:06:48,538 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:06:48,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:06:48,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1429990032] [2025-01-10 00:06:48,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1429990032] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 00:06:48,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2125335250] [2025-01-10 00:06:48,539 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:06:48,539 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:06:48,539 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:06:48,545 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-01-10 00:06:48,546 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-01-10 00:06:49,238 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-01-10 00:06:49,384 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-01-10 00:06:49,384 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:06:49,384 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:06:49,389 INFO L256 TraceCheckSpWp]: Trace formula consists of 1810 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-01-10 00:06:49,391 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 00:06:49,525 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:06:49,525 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 00:06:49,820 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:06:49,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2125335250] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 00:06:49,821 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 00:06:49,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 13 [2025-01-10 00:06:49,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1181303271] [2025-01-10 00:06:49,821 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 00:06:49,821 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-10 00:06:49,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:06:49,822 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-10 00:06:49,822 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-01-10 00:06:49,822 INFO L87 Difference]: Start difference. First operand 556 states and 670 transitions. Second operand has 13 states, 13 states have (on average 3.0) internal successors, (39), 13 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:06:49,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:06:49,936 INFO L93 Difference]: Finished difference Result 562 states and 676 transitions. [2025-01-10 00:06:49,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-10 00:06:49,937 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.0) internal successors, (39), 13 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2025-01-10 00:06:49,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:06:49,938 INFO L225 Difference]: With dead ends: 562 [2025-01-10 00:06:49,938 INFO L226 Difference]: Without dead ends: 562 [2025-01-10 00:06:49,938 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 50 SyntacticMatches, 8 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-01-10 00:06:49,939 INFO L435 NwaCegarLoop]: 573 mSDtfsCounter, 2 mSDsluCounter, 1710 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 2283 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 00:06:49,939 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 2283 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 00:06:49,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 562 states. [2025-01-10 00:06:49,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 562 to 562. [2025-01-10 00:06:49,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 562 states, 371 states have (on average 1.7008086253369272) internal successors, (631), 530 states have internal predecessors, (631), 25 states have call successors, (25), 12 states have call predecessors, (25), 11 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-01-10 00:06:49,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 562 states to 562 states and 676 transitions. [2025-01-10 00:06:49,951 INFO L78 Accepts]: Start accepts. Automaton has 562 states and 676 transitions. Word has length 30 [2025-01-10 00:06:49,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:06:49,951 INFO L471 AbstractCegarLoop]: Abstraction has 562 states and 676 transitions. [2025-01-10 00:06:49,951 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.0) internal successors, (39), 13 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:06:49,951 INFO L276 IsEmpty]: Start isEmpty. Operand 562 states and 676 transitions. [2025-01-10 00:06:49,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-01-10 00:06:49,952 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:06:49,952 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1] [2025-01-10 00:06:49,963 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-01-10 00:06:50,156 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:06:50,156 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [getoptErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, getoptErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, getoptErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 356 more)] === [2025-01-10 00:06:50,157 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:06:50,159 INFO L85 PathProgramCache]: Analyzing trace with hash 1134023881, now seen corresponding path program 2 times [2025-01-10 00:06:50,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:06:50,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [679704566] [2025-01-10 00:06:50,160 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 00:06:50,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:06:50,533 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 36 statements into 2 equivalence classes. [2025-01-10 00:06:50,562 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 6 of 36 statements. [2025-01-10 00:06:50,563 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 00:06:50,563 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:06:51,026 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-01-10 00:06:51,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:06:51,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [679704566] [2025-01-10 00:06:51,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [679704566] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:06:51,026 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:06:51,026 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 00:06:51,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1817850311] [2025-01-10 00:06:51,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:06:51,027 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 00:06:51,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:06:51,027 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 00:06:51,027 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-10 00:06:51,027 INFO L87 Difference]: Start difference. First operand 562 states and 676 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-01-10 00:06:55,048 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-10 00:06:56,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:06:56,852 INFO L93 Difference]: Finished difference Result 1136 states and 1362 transitions. [2025-01-10 00:06:56,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 00:06:56,852 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-01-10 00:06:56,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:06:56,860 INFO L225 Difference]: With dead ends: 1136 [2025-01-10 00:06:56,860 INFO L226 Difference]: Without dead ends: 1136 [2025-01-10 00:06:56,860 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-01-10 00:06:56,861 INFO L435 NwaCegarLoop]: 395 mSDtfsCounter, 1694 mSDsluCounter, 676 mSDsCounter, 0 mSdLazyCounter, 584 mSolverCounterSat, 109 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1696 SdHoareTripleChecker+Valid, 1071 SdHoareTripleChecker+Invalid, 694 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 109 IncrementalHoareTripleChecker+Valid, 584 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.7s IncrementalHoareTripleChecker+Time [2025-01-10 00:06:56,861 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1696 Valid, 1071 Invalid, 694 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [109 Valid, 584 Invalid, 1 Unknown, 0 Unchecked, 5.7s Time] [2025-01-10 00:06:56,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1136 states. [2025-01-10 00:06:56,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1136 to 926. [2025-01-10 00:06:56,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 926 states, 701 states have (on average 1.7303851640513552) internal successors, (1213), 865 states have internal predecessors, (1213), 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-01-10 00:06:56,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 926 states to 926 states and 1308 transitions. [2025-01-10 00:06:56,897 INFO L78 Accepts]: Start accepts. Automaton has 926 states and 1308 transitions. Word has length 36 [2025-01-10 00:06:56,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:06:56,902 INFO L471 AbstractCegarLoop]: Abstraction has 926 states and 1308 transitions. [2025-01-10 00:06:56,902 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-01-10 00:06:56,903 INFO L276 IsEmpty]: Start isEmpty. Operand 926 states and 1308 transitions. [2025-01-10 00:06:56,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-01-10 00:06:56,904 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:06:56,904 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:06:56,904 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-10 00:06:56,904 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [getoptErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, getoptErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, getoptErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 356 more)] === [2025-01-10 00:06:56,904 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:06:56,905 INFO L85 PathProgramCache]: Analyzing trace with hash -218603830, now seen corresponding path program 1 times [2025-01-10 00:06:56,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:06:56,905 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [295704241] [2025-01-10 00:06:56,905 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:06:56,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:06:57,301 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-01-10 00:06:57,337 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-01-10 00:06:57,337 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:06:57,337 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:06:57,676 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-01-10 00:06:57,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:06:57,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [295704241] [2025-01-10 00:06:57,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [295704241] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:06:57,676 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:06:57,676 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 00:06:57,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [57174396] [2025-01-10 00:06:57,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:06:57,677 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:06:57,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:06:57,678 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:06:57,678 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:06:57,678 INFO L87 Difference]: Start difference. First operand 926 states and 1308 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-01-10 00:07:01,701 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-10 00:07:02,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:07:02,883 INFO L93 Difference]: Finished difference Result 995 states and 1304 transitions. [2025-01-10 00:07:02,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:07:02,884 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-01-10 00:07:02,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:07:02,890 INFO L225 Difference]: With dead ends: 995 [2025-01-10 00:07:02,894 INFO L226 Difference]: Without dead ends: 995 [2025-01-10 00:07:02,894 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-01-10 00:07:02,894 INFO L435 NwaCegarLoop]: 465 mSDtfsCounter, 273 mSDsluCounter, 362 mSDsCounter, 0 mSdLazyCounter, 269 mSolverCounterSat, 11 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 275 SdHoareTripleChecker+Valid, 827 SdHoareTripleChecker+Invalid, 281 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 269 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.2s IncrementalHoareTripleChecker+Time [2025-01-10 00:07:02,894 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [275 Valid, 827 Invalid, 281 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 269 Invalid, 1 Unknown, 0 Unchecked, 5.2s Time] [2025-01-10 00:07:02,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 995 states. [2025-01-10 00:07:02,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 995 to 921. [2025-01-10 00:07:02,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 921 states, 701 states have (on average 1.7232524964336662) internal successors, (1208), 860 states have internal predecessors, (1208), 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-01-10 00:07:02,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 921 states to 921 states and 1303 transitions. [2025-01-10 00:07:02,919 INFO L78 Accepts]: Start accepts. Automaton has 921 states and 1303 transitions. Word has length 44 [2025-01-10 00:07:02,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:07:02,919 INFO L471 AbstractCegarLoop]: Abstraction has 921 states and 1303 transitions. [2025-01-10 00:07:02,920 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-01-10 00:07:02,920 INFO L276 IsEmpty]: Start isEmpty. Operand 921 states and 1303 transitions. [2025-01-10 00:07:02,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-01-10 00:07:02,921 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:07:02,921 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:07:02,921 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-10 00:07:02,922 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [getoptErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, getoptErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, getoptErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 356 more)] === [2025-01-10 00:07:02,922 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:07:02,922 INFO L85 PathProgramCache]: Analyzing trace with hash -218603829, now seen corresponding path program 1 times [2025-01-10 00:07:02,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:07:02,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1650159351] [2025-01-10 00:07:02,922 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:07:02,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:07:03,303 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-01-10 00:07:03,423 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-01-10 00:07:03,424 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:07:03,424 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:07:04,230 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-01-10 00:07:04,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:07:04,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1650159351] [2025-01-10 00:07:04,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1650159351] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:07:04,231 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:07:04,231 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 00:07:04,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [901432140] [2025-01-10 00:07:04,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:07:04,232 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 00:07:04,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:07:04,232 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 00:07:04,232 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-10 00:07:04,232 INFO L87 Difference]: Start difference. First operand 921 states and 1303 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-01-10 00:07:08,257 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-10 00:07:09,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:07:09,486 INFO L93 Difference]: Finished difference Result 921 states and 1304 transitions. [2025-01-10 00:07:09,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 00:07:09,490 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-01-10 00:07:09,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:07:09,495 INFO L225 Difference]: With dead ends: 921 [2025-01-10 00:07:09,495 INFO L226 Difference]: Without dead ends: 921 [2025-01-10 00:07:09,495 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 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-01-10 00:07:09,496 INFO L435 NwaCegarLoop]: 562 mSDtfsCounter, 376 mSDsluCounter, 1693 mSDsCounter, 0 mSdLazyCounter, 197 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 386 SdHoareTripleChecker+Valid, 2255 SdHoareTripleChecker+Invalid, 198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 197 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.2s IncrementalHoareTripleChecker+Time [2025-01-10 00:07:09,497 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [386 Valid, 2255 Invalid, 198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 197 Invalid, 1 Unknown, 0 Unchecked, 5.2s Time] [2025-01-10 00:07:09,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 921 states. [2025-01-10 00:07:09,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 921 to 920. [2025-01-10 00:07:09,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 920 states, 701 states have (on average 1.7218259629101285) internal successors, (1207), 859 states have internal predecessors, (1207), 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-01-10 00:07:09,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 920 states to 920 states and 1302 transitions. [2025-01-10 00:07:09,524 INFO L78 Accepts]: Start accepts. Automaton has 920 states and 1302 transitions. Word has length 44 [2025-01-10 00:07:09,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:07:09,524 INFO L471 AbstractCegarLoop]: Abstraction has 920 states and 1302 transitions. [2025-01-10 00:07:09,524 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-01-10 00:07:09,524 INFO L276 IsEmpty]: Start isEmpty. Operand 920 states and 1302 transitions. [2025-01-10 00:07:09,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-01-10 00:07:09,526 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:07:09,527 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-01-10 00:07:09,527 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-10 00:07:09,527 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [getoptErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, getoptErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, getoptErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 356 more)] === [2025-01-10 00:07:09,527 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:07:09,527 INFO L85 PathProgramCache]: Analyzing trace with hash -1255222112, now seen corresponding path program 1 times [2025-01-10 00:07:09,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:07:09,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1134931240] [2025-01-10 00:07:09,528 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:07:09,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:07:09,907 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-01-10 00:07:09,955 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-01-10 00:07:09,956 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:07:09,956 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:07:10,762 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-01-10 00:07:10,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:07:10,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1134931240] [2025-01-10 00:07:10,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1134931240] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:07:10,763 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:07:10,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 00:07:10,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [452166666] [2025-01-10 00:07:10,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:07:10,763 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 00:07:10,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:07:10,764 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 00:07:10,764 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-01-10 00:07:10,764 INFO L87 Difference]: Start difference. First operand 920 states and 1302 transitions. Second operand has 6 states, 5 states have (on average 3.6) internal successors, (18), 6 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 00:07:14,793 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-10 00:07:18,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:07:18,757 INFO L93 Difference]: Finished difference Result 1013 states and 1325 transitions. [2025-01-10 00:07:18,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 00:07:18,758 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 6 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 47 [2025-01-10 00:07:18,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:07:18,762 INFO L225 Difference]: With dead ends: 1013 [2025-01-10 00:07:18,762 INFO L226 Difference]: Without dead ends: 1013 [2025-01-10 00:07:18,763 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2025-01-10 00:07:18,763 INFO L435 NwaCegarLoop]: 418 mSDtfsCounter, 935 mSDsluCounter, 841 mSDsCounter, 0 mSdLazyCounter, 687 mSolverCounterSat, 19 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 947 SdHoareTripleChecker+Valid, 1259 SdHoareTripleChecker+Invalid, 707 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 687 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.9s IncrementalHoareTripleChecker+Time [2025-01-10 00:07:18,764 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [947 Valid, 1259 Invalid, 707 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 687 Invalid, 1 Unknown, 0 Unchecked, 7.9s Time] [2025-01-10 00:07:18,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1013 states. [2025-01-10 00:07:18,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1013 to 934. [2025-01-10 00:07:18,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 934 states, 715 states have (on average 1.7188811188811188) internal successors, (1229), 873 states have internal predecessors, (1229), 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-01-10 00:07:18,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 934 states to 934 states and 1324 transitions. [2025-01-10 00:07:18,791 INFO L78 Accepts]: Start accepts. Automaton has 934 states and 1324 transitions. Word has length 47 [2025-01-10 00:07:18,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:07:18,792 INFO L471 AbstractCegarLoop]: Abstraction has 934 states and 1324 transitions. [2025-01-10 00:07:18,792 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 6 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 00:07:18,793 INFO L276 IsEmpty]: Start isEmpty. Operand 934 states and 1324 transitions. [2025-01-10 00:07:18,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-01-10 00:07:18,793 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:07:18,793 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-01-10 00:07:18,793 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-10 00:07:18,793 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [getoptErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, getoptErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, getoptErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 356 more)] === [2025-01-10 00:07:18,793 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:07:18,795 INFO L85 PathProgramCache]: Analyzing trace with hash -1255221025, now seen corresponding path program 1 times [2025-01-10 00:07:18,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:07:18,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1265678035] [2025-01-10 00:07:18,795 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:07:18,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:07:19,176 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-01-10 00:07:19,216 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-01-10 00:07:19,220 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:07:19,221 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:07:19,543 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-01-10 00:07:19,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:07:19,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1265678035] [2025-01-10 00:07:19,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1265678035] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:07:19,544 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:07:19,544 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 00:07:19,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [402832979] [2025-01-10 00:07:19,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:07:19,545 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 00:07:19,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:07:19,546 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 00:07:19,546 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 00:07:19,546 INFO L87 Difference]: Start difference. First operand 934 states and 1324 transitions. Second operand has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 00:07:23,569 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers []