./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/busybox-1.22.0/basename-2.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 48c9605d 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/basename-2.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 77d101c015aa227688f75df3fd905b74c24dd55f9fd8e8478582e7eae4d24583 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 07:40:43,137 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 07:40:43,177 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf [2025-02-08 07:40:43,184 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 07:40:43,184 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 07:40:43,209 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 07:40:43,209 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 07:40:43,216 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 07:40:43,217 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 07:40:43,217 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 07:40:43,217 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 07:40:43,217 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 07:40:43,217 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 07:40:43,217 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 07:40:43,217 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 07:40:43,217 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 07:40:43,217 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 07:40:43,217 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 07:40:43,217 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-02-08 07:40:43,217 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-02-08 07:40:43,217 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-02-08 07:40:43,218 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 07:40:43,218 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-08 07:40:43,218 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 07:40:43,218 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 07:40:43,218 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 07:40:43,218 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 07:40:43,218 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 07:40:43,218 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 07:40:43,218 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 07:40:43,218 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 07:40:43,218 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 07:40:43,218 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 07:40:43,218 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 07:40:43,218 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 07:40:43,218 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 07:40:43,218 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 07:40:43,218 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 07:40:43,218 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 07:40:43,218 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 -> 77d101c015aa227688f75df3fd905b74c24dd55f9fd8e8478582e7eae4d24583 [2025-02-08 07:40:43,430 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 07:40:43,435 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 07:40:43,437 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 07:40:43,437 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 07:40:43,438 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 07:40:43,438 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/busybox-1.22.0/basename-2.i [2025-02-08 07:40:44,575 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f0fbcb5f0/4a0a20249ae34a61b48af9f5aa0afe16/FLAGca70d1801 [2025-02-08 07:40:44,869 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 07:40:44,871 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/busybox-1.22.0/basename-2.i [2025-02-08 07:40:44,889 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f0fbcb5f0/4a0a20249ae34a61b48af9f5aa0afe16/FLAGca70d1801 [2025-02-08 07:40:45,124 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f0fbcb5f0/4a0a20249ae34a61b48af9f5aa0afe16 [2025-02-08 07:40:45,126 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 07:40:45,127 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 07:40:45,129 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 07:40:45,130 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 07:40:45,133 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 07:40:45,133 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 07:40:45" (1/1) ... [2025-02-08 07:40:45,134 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@20a751b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 07:40:45, skipping insertion in model container [2025-02-08 07:40:45,135 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 07:40:45" (1/1) ... [2025-02-08 07:40:45,175 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 07:40:45,520 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 07:40:45,529 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 07:40:45,531 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 07:40:45,535 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 07:40:45,537 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 07:40:45,543 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 07:40:45,544 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 07:40:45,544 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 07:40:45,545 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 07:40:45,547 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 07:40:45,554 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 07:40:45,561 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 07:40:45,578 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 07:40:45,639 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 07:40:45,709 INFO L204 MainTranslator]: Completed translation [2025-02-08 07:40:45,710 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 07:40:45 WrapperNode [2025-02-08 07:40:45,710 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 07:40:45,711 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 07:40:45,711 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 07:40:45,712 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 07:40:45,720 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 07:40:45" (1/1) ... [2025-02-08 07:40:45,744 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 07:40:45" (1/1) ... [2025-02-08 07:40:45,794 INFO L138 Inliner]: procedures = 346, calls = 463, calls flagged for inlining = 11, calls inlined = 10, statements flattened = 729 [2025-02-08 07:40:45,795 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 07:40:45,795 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 07:40:45,798 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 07:40:45,798 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 07:40:45,806 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 07:40:45" (1/1) ... [2025-02-08 07:40:45,806 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 07:40:45" (1/1) ... [2025-02-08 07:40:45,815 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 07:40:45" (1/1) ... [2025-02-08 07:40:45,854 INFO L175 MemorySlicer]: Split 412 memory accesses to 14 slices as follows [2, 3, 3, 3, 4, 4, 4, 3, 3, 355, 2, 2, 12, 12]. 86 percent of accesses are in the largest equivalence class. The 379 initializations are split as follows [2, 3, 3, 3, 3, 3, 3, 3, 1, 355, 0, 0, 0, 0]. The 11 writes are split as follows [0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 1, 2, 5, 2]. [2025-02-08 07:40:45,855 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 07:40:45" (1/1) ... [2025-02-08 07:40:45,855 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 07:40:45" (1/1) ... [2025-02-08 07:40:45,878 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 07:40:45" (1/1) ... [2025-02-08 07:40:45,879 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 07:40:45" (1/1) ... [2025-02-08 07:40:45,886 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 07:40:45" (1/1) ... [2025-02-08 07:40:45,893 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 07:40:45" (1/1) ... [2025-02-08 07:40:45,902 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 07:40:45,902 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 07:40:45,903 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 07:40:45,903 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 07:40:45,903 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 07:40:45" (1/1) ... [2025-02-08 07:40:45,908 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 07:40:45,918 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 07:40:45,931 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-08 07:40:45,939 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-08 07:40:45,956 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-08 07:40:45,956 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-08 07:40:45,957 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-02-08 07:40:45,957 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-02-08 07:40:45,957 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-02-08 07:40:45,957 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-02-08 07:40:45,957 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2025-02-08 07:40:45,957 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2025-02-08 07:40:45,957 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2025-02-08 07:40:45,957 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#7 [2025-02-08 07:40:45,957 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#8 [2025-02-08 07:40:45,957 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#9 [2025-02-08 07:40:45,957 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#10 [2025-02-08 07:40:45,957 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#11 [2025-02-08 07:40:45,957 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#12 [2025-02-08 07:40:45,957 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#13 [2025-02-08 07:40:45,957 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-08 07:40:45,957 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-08 07:40:45,957 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-08 07:40:45,957 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-08 07:40:45,957 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-02-08 07:40:45,957 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-02-08 07:40:45,957 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-02-08 07:40:45,957 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-02-08 07:40:45,957 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2025-02-08 07:40:45,957 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2025-02-08 07:40:45,957 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2025-02-08 07:40:45,957 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2025-02-08 07:40:45,957 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2025-02-08 07:40:45,957 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2025-02-08 07:40:45,957 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#13 [2025-02-08 07:40:45,957 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-08 07:40:45,958 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-08 07:40:45,958 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-08 07:40:45,958 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-02-08 07:40:45,958 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-02-08 07:40:45,958 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-02-08 07:40:45,958 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-02-08 07:40:45,958 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2025-02-08 07:40:45,958 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2025-02-08 07:40:45,958 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2025-02-08 07:40:45,958 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2025-02-08 07:40:45,958 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2025-02-08 07:40:45,958 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2025-02-08 07:40:45,958 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#13 [2025-02-08 07:40:45,958 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-08 07:40:45,958 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 07:40:45,958 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-02-08 07:40:45,958 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-02-08 07:40:45,958 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-02-08 07:40:45,958 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-02-08 07:40:45,958 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2025-02-08 07:40:45,958 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2025-02-08 07:40:45,958 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2025-02-08 07:40:45,958 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#7 [2025-02-08 07:40:45,958 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#8 [2025-02-08 07:40:45,958 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#9 [2025-02-08 07:40:45,958 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#10 [2025-02-08 07:40:45,958 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#11 [2025-02-08 07:40:45,958 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#12 [2025-02-08 07:40:45,961 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#13 [2025-02-08 07:40:45,961 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-08 07:40:45,961 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-08 07:40:45,961 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-08 07:40:45,961 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-02-08 07:40:45,961 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-02-08 07:40:45,962 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-02-08 07:40:45,963 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-02-08 07:40:45,963 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-02-08 07:40:45,963 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-02-08 07:40:45,963 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-02-08 07:40:45,963 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-02-08 07:40:45,963 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2025-02-08 07:40:45,963 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2025-02-08 07:40:45,963 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2025-02-08 07:40:45,963 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 07:40:45,963 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 07:40:46,236 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 07:40:46,238 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 07:40:46,737 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1505: safe_write_~tmp_if_expr$1~1#1 := (if 0 == (if 0 != (if 4 == safe_write_#t~mem72#1 then 1 else 0) then 1 else 0) then 0 else 1); [2025-02-08 07:40:46,738 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1505-1: SUMMARY for call safe_write_#t~mem72#1 := read~int#8(~bb_errno~0.base, ~bb_errno~0.offset, 4); srcloc: null [2025-02-08 07:40:46,738 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1505-1: assume !(1 == #valid[~bb_errno~0.base]); [2025-02-08 07:40:46,738 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1505-1: assume !(4 + ~bb_errno~0.offset <= #length[~bb_errno~0.base] && 0 <= ~bb_errno~0.offset); [2025-02-08 07:40:46,738 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1468: full_write_#t~ret67#1 := safe_write_#res#1;havoc safe_write_#t~ret71#1, safe_write_#t~mem72#1, safe_write_~fd#1, safe_write_~buf#1.base, safe_write_~buf#1.offset, safe_write_~count#1, safe_write_~n~1#1, safe_write_~tmp_if_expr$1~1#1;havoc safe_write_#in~fd#1, safe_write_#in~buf#1.base, safe_write_#in~buf#1.offset, safe_write_#in~count#1;assume { :end_inline_safe_write } true;assume -9223372036854775808 <= full_write_#t~ret67#1 && full_write_#t~ret67#1 <= 9223372036854775807;full_write_~cc~0#1 := full_write_#t~ret67#1;havoc full_write_#t~ret67#1; [2025-02-08 07:40:46,738 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1501-1: assume 0 != safe_write_~tmp_if_expr$1~1#1 % 256; [2025-02-08 07:40:46,738 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1501-1: assume !(0 != safe_write_~tmp_if_expr$1~1#1 % 256); [2025-02-08 07:40:46,738 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1469: assume full_write_~cc~0#1 < 0; [2025-02-08 07:40:46,738 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1469: assume !(full_write_~cc~0#1 < 0);full_write_~total~0#1 := full_write_~total~0#1 + full_write_~cc~0#1;full_write_~buf#1.base, full_write_~buf#1.offset := full_write_~buf#1.base, full_write_~buf#1.offset + full_write_~cc~0#1;full_write_~len#1 := full_write_~len#1 - full_write_~cc~0#1; [2025-02-08 07:40:46,738 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1503: safe_write_#t~ret71#1 := write_#res#1;havoc write_#t~nondet104#1, write_~fildes#1, write_~buf#1.base, write_~buf#1.offset, write_~nbyte#1, write_~ret~1#1;havoc write_#in~fildes#1, write_#in~buf#1.base, write_#in~buf#1.offset, write_#in~nbyte#1;assume { :end_inline_write } true;assume -9223372036854775808 <= safe_write_#t~ret71#1 && safe_write_#t~ret71#1 <= 9223372036854775807;safe_write_~n~1#1 := safe_write_#t~ret71#1;havoc safe_write_#t~ret71#1; [2025-02-08 07:40:46,739 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1504: assume safe_write_~n~1#1 < 0; [2025-02-08 07:40:46,739 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1504: assume !(safe_write_~n~1#1 < 0);safe_write_~tmp_if_expr$1~1#1 := 0; [2025-02-08 07:40:46,739 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1471: assume !(0 == full_write_~total~0#1);full_write_#res#1 := full_write_~total~0#1; [2025-02-08 07:40:46,739 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1471: assume !!(0 == full_write_~total~0#1);full_write_#res#1 := full_write_~cc~0#1; [2025-02-08 07:40:46,766 INFO L? ?]: Removed 255 outVars from TransFormulas that were not future-live. [2025-02-08 07:40:46,767 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 07:40:46,775 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 07:40:46,776 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 07:40:46,776 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 07:40:46 BoogieIcfgContainer [2025-02-08 07:40:46,776 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 07:40:46,778 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 07:40:46,778 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 07:40:46,781 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 07:40:46,782 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 07:40:45" (1/3) ... [2025-02-08 07:40:46,782 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@470b61f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 07:40:46, skipping insertion in model container [2025-02-08 07:40:46,782 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 07:40:45" (2/3) ... [2025-02-08 07:40:46,782 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@470b61f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 07:40:46, skipping insertion in model container [2025-02-08 07:40:46,782 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 07:40:46" (3/3) ... [2025-02-08 07:40:46,783 INFO L128 eAbstractionObserver]: Analyzing ICFG basename-2.i [2025-02-08 07:40:46,793 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 07:40:46,794 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG basename-2.i that has 2 procedures, 233 locations, 1 initial locations, 7 loop locations, and 96 error locations. [2025-02-08 07:40:46,821 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 07:40:46,829 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;@69e3bcde, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 07:40:46,829 INFO L334 AbstractCegarLoop]: Starting to check reachability of 96 error locations. [2025-02-08 07:40:46,832 INFO L276 IsEmpty]: Start isEmpty. Operand has 233 states, 129 states have (on average 1.9922480620155039) internal successors, (257), 229 states have internal predecessors, (257), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 07:40:46,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2025-02-08 07:40:46,836 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:40:46,836 INFO L218 NwaCegarLoop]: trace histogram [1, 1] [2025-02-08 07:40:46,836 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr94REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 93 more)] === [2025-02-08 07:40:46,840 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:40:46,840 INFO L85 PathProgramCache]: Analyzing trace with hash 10271, now seen corresponding path program 1 times [2025-02-08 07:40:46,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:40:46,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1558597374] [2025-02-08 07:40:46,845 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:40:46,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:40:46,969 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-08 07:40:47,022 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-08 07:40:47,023 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:40:47,023 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:40:47,273 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 07:40:47,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:40:47,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1558597374] [2025-02-08 07:40:47,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1558597374] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 07:40:47,274 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 07:40:47,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 07:40:47,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2138164428] [2025-02-08 07:40:47,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 07:40:47,278 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 07:40:47,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:40:47,292 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 07:40:47,292 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 07:40:47,294 INFO L87 Difference]: Start difference. First operand has 233 states, 129 states have (on average 1.9922480620155039) internal successors, (257), 229 states have internal predecessors, (257), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 07:40:47,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:40:47,403 INFO L93 Difference]: Finished difference Result 190 states and 206 transitions. [2025-02-08 07:40:47,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 07:40:47,405 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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 2 [2025-02-08 07:40:47,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:40:47,409 INFO L225 Difference]: With dead ends: 190 [2025-02-08 07:40:47,409 INFO L226 Difference]: Without dead ends: 178 [2025-02-08 07:40:47,410 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 07:40:47,412 INFO L435 NwaCegarLoop]: 123 mSDtfsCounter, 159 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 07:40:47,412 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [161 Valid, 144 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 07:40:47,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2025-02-08 07:40:47,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 162. [2025-02-08 07:40:47,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 91 states have (on average 1.9120879120879122) internal successors, (174), 159 states have internal predecessors, (174), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 07:40:47,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 176 transitions. [2025-02-08 07:40:47,439 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 176 transitions. Word has length 2 [2025-02-08 07:40:47,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:40:47,439 INFO L471 AbstractCegarLoop]: Abstraction has 162 states and 176 transitions. [2025-02-08 07:40:47,439 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 07:40:47,439 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 176 transitions. [2025-02-08 07:40:47,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2025-02-08 07:40:47,439 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:40:47,439 INFO L218 NwaCegarLoop]: trace histogram [1, 1] [2025-02-08 07:40:47,440 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 07:40:47,440 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr95REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 93 more)] === [2025-02-08 07:40:47,440 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:40:47,440 INFO L85 PathProgramCache]: Analyzing trace with hash 10272, now seen corresponding path program 1 times [2025-02-08 07:40:47,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:40:47,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1303477183] [2025-02-08 07:40:47,441 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:40:47,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:40:47,469 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-08 07:40:47,495 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-08 07:40:47,495 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:40:47,495 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:40:47,667 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 07:40:47,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:40:47,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1303477183] [2025-02-08 07:40:47,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1303477183] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 07:40:47,668 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 07:40:47,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 07:40:47,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1088255652] [2025-02-08 07:40:47,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 07:40:47,669 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 07:40:47,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:40:47,670 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 07:40:47,670 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 07:40:47,670 INFO L87 Difference]: Start difference. First operand 162 states and 176 transitions. Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 07:40:47,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:40:47,765 INFO L93 Difference]: Finished difference Result 161 states and 175 transitions. [2025-02-08 07:40:47,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 07:40:47,765 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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 2 [2025-02-08 07:40:47,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:40:47,766 INFO L225 Difference]: With dead ends: 161 [2025-02-08 07:40:47,766 INFO L226 Difference]: Without dead ends: 161 [2025-02-08 07:40:47,766 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 07:40:47,767 INFO L435 NwaCegarLoop]: 168 mSDtfsCounter, 10 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 268 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 07:40:47,767 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 268 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 07:40:47,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2025-02-08 07:40:47,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 161. [2025-02-08 07:40:47,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 91 states have (on average 1.901098901098901) internal successors, (173), 158 states have internal predecessors, (173), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 07:40:47,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 175 transitions. [2025-02-08 07:40:47,776 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 175 transitions. Word has length 2 [2025-02-08 07:40:47,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:40:47,777 INFO L471 AbstractCegarLoop]: Abstraction has 161 states and 175 transitions. [2025-02-08 07:40:47,777 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 07:40:47,777 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 175 transitions. [2025-02-08 07:40:47,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-02-08 07:40:47,777 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:40:47,777 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-02-08 07:40:47,777 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 07:40:47,777 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr90REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 93 more)] === [2025-02-08 07:40:47,778 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:40:47,778 INFO L85 PathProgramCache]: Analyzing trace with hash 306238367, now seen corresponding path program 1 times [2025-02-08 07:40:47,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:40:47,778 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1660479482] [2025-02-08 07:40:47,778 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:40:47,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:40:47,814 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-08 07:40:47,828 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-08 07:40:47,828 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:40:47,828 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:40:47,917 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 07:40:47,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:40:47,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1660479482] [2025-02-08 07:40:47,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1660479482] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 07:40:47,917 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 07:40:47,917 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 07:40:47,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [537497643] [2025-02-08 07:40:47,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 07:40:47,918 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 07:40:47,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:40:47,919 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 07:40:47,919 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 07:40:47,919 INFO L87 Difference]: Start difference. First operand 161 states and 175 transitions. Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 07:40:47,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:40:47,949 INFO L93 Difference]: Finished difference Result 164 states and 179 transitions. [2025-02-08 07:40:47,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 07:40:47,949 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 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 5 [2025-02-08 07:40:47,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:40:47,950 INFO L225 Difference]: With dead ends: 164 [2025-02-08 07:40:47,950 INFO L226 Difference]: Without dead ends: 164 [2025-02-08 07:40:47,950 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 07:40:47,951 INFO L435 NwaCegarLoop]: 171 mSDtfsCounter, 2 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 339 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 07:40:47,951 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 339 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 07:40:47,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2025-02-08 07:40:47,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 162. [2025-02-08 07:40:47,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 92 states have (on average 1.891304347826087) internal successors, (174), 159 states have internal predecessors, (174), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 07:40:47,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 176 transitions. [2025-02-08 07:40:47,959 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 176 transitions. Word has length 5 [2025-02-08 07:40:47,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:40:47,959 INFO L471 AbstractCegarLoop]: Abstraction has 162 states and 176 transitions. [2025-02-08 07:40:47,960 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 07:40:47,960 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 176 transitions. [2025-02-08 07:40:47,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-02-08 07:40:47,960 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:40:47,960 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-02-08 07:40:47,960 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 07:40:47,960 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr93REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 93 more)] === [2025-02-08 07:40:47,961 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:40:47,961 INFO L85 PathProgramCache]: Analyzing trace with hash 306238528, now seen corresponding path program 1 times [2025-02-08 07:40:47,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:40:47,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [608301746] [2025-02-08 07:40:47,961 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:40:47,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:40:47,979 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-08 07:40:47,989 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-08 07:40:47,989 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:40:47,989 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:40:48,267 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 07:40:48,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:40:48,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [608301746] [2025-02-08 07:40:48,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [608301746] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 07:40:48,268 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 07:40:48,268 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 07:40:48,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [418752605] [2025-02-08 07:40:48,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 07:40:48,268 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 07:40:48,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:40:48,269 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 07:40:48,269 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-08 07:40:48,269 INFO L87 Difference]: Start difference. First operand 162 states and 176 transitions. Second operand has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 07:40:48,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:40:48,374 INFO L93 Difference]: Finished difference Result 164 states and 178 transitions. [2025-02-08 07:40:48,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 07:40:48,374 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 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 5 [2025-02-08 07:40:48,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:40:48,375 INFO L225 Difference]: With dead ends: 164 [2025-02-08 07:40:48,375 INFO L226 Difference]: Without dead ends: 164 [2025-02-08 07:40:48,376 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 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-02-08 07:40:48,376 INFO L435 NwaCegarLoop]: 166 mSDtfsCounter, 11 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 268 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 07:40:48,377 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 268 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 07:40:48,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2025-02-08 07:40:48,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 163. [2025-02-08 07:40:48,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 93 states have (on average 1.881720430107527) internal successors, (175), 160 states have internal predecessors, (175), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 07:40:48,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 177 transitions. [2025-02-08 07:40:48,381 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 177 transitions. Word has length 5 [2025-02-08 07:40:48,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:40:48,382 INFO L471 AbstractCegarLoop]: Abstraction has 163 states and 177 transitions. [2025-02-08 07:40:48,382 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 07:40:48,382 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 177 transitions. [2025-02-08 07:40:48,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-02-08 07:40:48,382 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:40:48,382 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 07:40:48,382 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 07:40:48,383 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr90REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 93 more)] === [2025-02-08 07:40:48,383 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:40:48,383 INFO L85 PathProgramCache]: Analyzing trace with hash 641671354, now seen corresponding path program 1 times [2025-02-08 07:40:48,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:40:48,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [410311718] [2025-02-08 07:40:48,386 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:40:48,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:40:48,409 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-08 07:40:48,420 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-08 07:40:48,421 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:40:48,421 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:40:48,497 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 07:40:48,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:40:48,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [410311718] [2025-02-08 07:40:48,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [410311718] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 07:40:48,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [966851630] [2025-02-08 07:40:48,498 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:40:48,498 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 07:40:48,498 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 07:40:48,504 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 07:40:48,505 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-08 07:40:48,614 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-08 07:40:48,724 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-08 07:40:48,724 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:40:48,724 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:40:48,728 INFO L256 TraceCheckSpWp]: Trace formula consists of 883 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-08 07:40:48,731 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 07:40:48,752 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 07:40:48,752 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 07:40:48,768 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 07:40:48,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [966851630] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 07:40:48,769 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 07:40:48,769 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-02-08 07:40:48,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1222439383] [2025-02-08 07:40:48,769 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 07:40:48,769 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 07:40:48,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:40:48,770 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 07:40:48,770 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-02-08 07:40:48,770 INFO L87 Difference]: Start difference. First operand 163 states and 177 transitions. Second operand has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 07:40:48,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:40:48,806 INFO L93 Difference]: Finished difference Result 171 states and 187 transitions. [2025-02-08 07:40:48,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 07:40:48,806 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 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 8 [2025-02-08 07:40:48,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:40:48,807 INFO L225 Difference]: With dead ends: 171 [2025-02-08 07:40:48,807 INFO L226 Difference]: Without dead ends: 171 [2025-02-08 07:40:48,807 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-02-08 07:40:48,808 INFO L435 NwaCegarLoop]: 171 mSDtfsCounter, 4 mSDsluCounter, 336 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 507 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 07:40:48,808 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 507 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 07:40:48,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2025-02-08 07:40:48,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 171. [2025-02-08 07:40:48,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 101 states have (on average 1.8316831683168318) internal successors, (185), 168 states have internal predecessors, (185), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 07:40:48,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 187 transitions. [2025-02-08 07:40:48,812 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 187 transitions. Word has length 8 [2025-02-08 07:40:48,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:40:48,812 INFO L471 AbstractCegarLoop]: Abstraction has 171 states and 187 transitions. [2025-02-08 07:40:48,812 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 07:40:48,813 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 187 transitions. [2025-02-08 07:40:48,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-02-08 07:40:48,813 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:40:48,813 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2025-02-08 07:40:48,821 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-08 07:40:49,013 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 07:40:49,014 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr93REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 93 more)] === [2025-02-08 07:40:49,015 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:40:49,015 INFO L85 PathProgramCache]: Analyzing trace with hash 641671515, now seen corresponding path program 1 times [2025-02-08 07:40:49,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:40:49,015 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [755211568] [2025-02-08 07:40:49,015 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:40:49,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:40:49,033 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-08 07:40:49,043 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-08 07:40:49,043 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:40:49,043 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:40:49,261 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 07:40:49,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:40:49,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [755211568] [2025-02-08 07:40:49,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [755211568] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 07:40:49,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1387467264] [2025-02-08 07:40:49,262 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:40:49,262 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 07:40:49,262 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 07:40:49,267 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 07:40:49,270 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-08 07:40:49,368 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-08 07:40:49,452 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-08 07:40:49,452 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:40:49,452 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:40:49,455 INFO L256 TraceCheckSpWp]: Trace formula consists of 879 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-02-08 07:40:49,456 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 07:40:49,511 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 07:40:49,512 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 07:40:49,573 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2025-02-08 07:40:49,582 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 07:40:49,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1387467264] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 07:40:49,582 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 07:40:49,582 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2025-02-08 07:40:49,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [483898577] [2025-02-08 07:40:49,582 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 07:40:49,582 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-02-08 07:40:49,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:40:49,583 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-02-08 07:40:49,583 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2025-02-08 07:40:49,583 INFO L87 Difference]: Start difference. First operand 171 states and 187 transitions. Second operand has 14 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 13 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 07:40:49,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:40:49,850 INFO L93 Difference]: Finished difference Result 170 states and 184 transitions. [2025-02-08 07:40:49,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 07:40:49,851 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 13 states have internal predecessors, (24), 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 8 [2025-02-08 07:40:49,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:40:49,851 INFO L225 Difference]: With dead ends: 170 [2025-02-08 07:40:49,851 INFO L226 Difference]: Without dead ends: 170 [2025-02-08 07:40:49,851 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=150, Unknown=0, NotChecked=0, Total=240 [2025-02-08 07:40:49,852 INFO L435 NwaCegarLoop]: 164 mSDtfsCounter, 165 mSDsluCounter, 614 mSDsCounter, 0 mSdLazyCounter, 410 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 778 SdHoareTripleChecker+Invalid, 413 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 410 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 07:40:49,852 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [166 Valid, 778 Invalid, 413 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 410 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 07:40:49,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2025-02-08 07:40:49,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 170. [2025-02-08 07:40:49,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 101 states have (on average 1.801980198019802) internal successors, (182), 167 states have internal predecessors, (182), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 07:40:49,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 184 transitions. [2025-02-08 07:40:49,856 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 184 transitions. Word has length 8 [2025-02-08 07:40:49,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:40:49,856 INFO L471 AbstractCegarLoop]: Abstraction has 170 states and 184 transitions. [2025-02-08 07:40:49,857 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 13 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 07:40:49,857 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 184 transitions. [2025-02-08 07:40:49,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-02-08 07:40:49,857 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:40:49,857 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1] [2025-02-08 07:40:49,866 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-08 07:40:50,057 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 07:40:50,059 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr90REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 93 more)] === [2025-02-08 07:40:50,059 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:40:50,060 INFO L85 PathProgramCache]: Analyzing trace with hash -1565653025, now seen corresponding path program 2 times [2025-02-08 07:40:50,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:40:50,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [478305326] [2025-02-08 07:40:50,060 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 07:40:50,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:40:50,079 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 17 statements into 2 equivalence classes. [2025-02-08 07:40:50,087 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 5 of 17 statements. [2025-02-08 07:40:50,087 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 07:40:50,087 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:40:50,230 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-02-08 07:40:50,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:40:50,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [478305326] [2025-02-08 07:40:50,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [478305326] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 07:40:50,230 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 07:40:50,230 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 07:40:50,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [193825858] [2025-02-08 07:40:50,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 07:40:50,231 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 07:40:50,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:40:50,231 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 07:40:50,231 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-08 07:40:50,231 INFO L87 Difference]: Start difference. First operand 170 states and 184 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 07:40:50,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:40:50,315 INFO L93 Difference]: Finished difference Result 185 states and 200 transitions. [2025-02-08 07:40:50,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 07:40:50,316 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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 17 [2025-02-08 07:40:50,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:40:50,316 INFO L225 Difference]: With dead ends: 185 [2025-02-08 07:40:50,316 INFO L226 Difference]: Without dead ends: 185 [2025-02-08 07:40:50,317 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 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-02-08 07:40:50,317 INFO L435 NwaCegarLoop]: 108 mSDtfsCounter, 147 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 07:40:50,317 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 147 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 07:40:50,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2025-02-08 07:40:50,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 169. [2025-02-08 07:40:50,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 101 states have (on average 1.7920792079207921) internal successors, (181), 166 states have internal predecessors, (181), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 07:40:50,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 183 transitions. [2025-02-08 07:40:50,321 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 183 transitions. Word has length 17 [2025-02-08 07:40:50,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:40:50,322 INFO L471 AbstractCegarLoop]: Abstraction has 169 states and 183 transitions. [2025-02-08 07:40:50,322 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 07:40:50,322 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 183 transitions. [2025-02-08 07:40:50,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-02-08 07:40:50,322 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:40:50,322 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1] [2025-02-08 07:40:50,322 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-08 07:40:50,322 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr91REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 93 more)] === [2025-02-08 07:40:50,323 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:40:50,323 INFO L85 PathProgramCache]: Analyzing trace with hash -1565653024, now seen corresponding path program 1 times [2025-02-08 07:40:50,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:40:50,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1760792560] [2025-02-08 07:40:50,323 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:40:50,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:40:50,341 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-02-08 07:40:50,351 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-02-08 07:40:50,351 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:40:50,351 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:40:50,490 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 07:40:50,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:40:50,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1760792560] [2025-02-08 07:40:50,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1760792560] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 07:40:50,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [424745702] [2025-02-08 07:40:50,490 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:40:50,491 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 07:40:50,491 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 07:40:50,494 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 07:40:50,495 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-08 07:40:50,604 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-02-08 07:40:50,698 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-02-08 07:40:50,698 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:40:50,698 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:40:50,702 INFO L256 TraceCheckSpWp]: Trace formula consists of 946 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-08 07:40:50,704 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 07:40:50,726 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 07:40:50,727 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 07:40:50,779 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 07:40:50,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [424745702] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 07:40:50,779 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 07:40:50,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2025-02-08 07:40:50,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1240252692] [2025-02-08 07:40:50,779 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 07:40:50,780 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-08 07:40:50,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:40:50,780 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-08 07:40:50,780 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-02-08 07:40:50,780 INFO L87 Difference]: Start difference. First operand 169 states and 183 transitions. Second operand has 13 states, 13 states have (on average 2.6923076923076925) internal successors, (35), 13 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 07:40:50,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:40:50,842 INFO L93 Difference]: Finished difference Result 187 states and 201 transitions. [2025-02-08 07:40:50,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-08 07:40:50,843 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.6923076923076925) internal successors, (35), 13 states have internal predecessors, (35), 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 17 [2025-02-08 07:40:50,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:40:50,844 INFO L225 Difference]: With dead ends: 187 [2025-02-08 07:40:50,844 INFO L226 Difference]: Without dead ends: 187 [2025-02-08 07:40:50,844 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-02-08 07:40:50,846 INFO L435 NwaCegarLoop]: 170 mSDtfsCounter, 4 mSDsluCounter, 835 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 1005 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 07:40:50,847 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 1005 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 07:40:50,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2025-02-08 07:40:50,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 187. [2025-02-08 07:40:50,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 119 states have (on average 1.6722689075630253) internal successors, (199), 184 states have internal predecessors, (199), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 07:40:50,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 201 transitions. [2025-02-08 07:40:50,856 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 201 transitions. Word has length 17 [2025-02-08 07:40:50,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:40:50,856 INFO L471 AbstractCegarLoop]: Abstraction has 187 states and 201 transitions. [2025-02-08 07:40:50,857 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.6923076923076925) internal successors, (35), 13 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 07:40:50,857 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 201 transitions. [2025-02-08 07:40:50,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-02-08 07:40:50,857 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:40:50,857 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1] [2025-02-08 07:40:50,867 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-02-08 07:40:51,059 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 07:40:51,060 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr91REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 93 more)] === [2025-02-08 07:40:51,061 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:40:51,061 INFO L85 PathProgramCache]: Analyzing trace with hash -898391488, now seen corresponding path program 2 times [2025-02-08 07:40:51,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:40:51,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1449917577] [2025-02-08 07:40:51,061 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 07:40:51,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:40:51,084 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 35 statements into 2 equivalence classes. [2025-02-08 07:40:51,092 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 5 of 35 statements. [2025-02-08 07:40:51,092 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 07:40:51,092 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:40:51,266 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-08 07:40:51,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:40:51,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1449917577] [2025-02-08 07:40:51,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1449917577] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 07:40:51,266 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 07:40:51,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 07:40:51,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1911588595] [2025-02-08 07:40:51,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 07:40:51,267 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 07:40:51,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:40:51,267 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 07:40:51,267 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-08 07:40:51,268 INFO L87 Difference]: Start difference. First operand 187 states and 201 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 07:40:51,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:40:51,334 INFO L93 Difference]: Finished difference Result 186 states and 200 transitions. [2025-02-08 07:40:51,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 07:40:51,335 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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 35 [2025-02-08 07:40:51,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:40:51,335 INFO L225 Difference]: With dead ends: 186 [2025-02-08 07:40:51,336 INFO L226 Difference]: Without dead ends: 186 [2025-02-08 07:40:51,336 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 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-02-08 07:40:51,336 INFO L435 NwaCegarLoop]: 166 mSDtfsCounter, 9 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 272 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 07:40:51,336 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 272 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 07:40:51,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2025-02-08 07:40:51,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 186. [2025-02-08 07:40:51,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 119 states have (on average 1.6638655462184875) internal successors, (198), 183 states have internal predecessors, (198), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 07:40:51,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 200 transitions. [2025-02-08 07:40:51,340 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 200 transitions. Word has length 35 [2025-02-08 07:40:51,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:40:51,340 INFO L471 AbstractCegarLoop]: Abstraction has 186 states and 200 transitions. [2025-02-08 07:40:51,340 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 07:40:51,340 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 200 transitions. [2025-02-08 07:40:51,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-02-08 07:40:51,341 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:40:51,341 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 07:40:51,341 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-08 07:40:51,341 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr88REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 93 more)] === [2025-02-08 07:40:51,342 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:40:51,342 INFO L85 PathProgramCache]: Analyzing trace with hash 1035335890, now seen corresponding path program 1 times [2025-02-08 07:40:51,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:40:51,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1287543467] [2025-02-08 07:40:51,342 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:40:51,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:40:51,369 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-02-08 07:40:51,390 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-02-08 07:40:51,390 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:40:51,390 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:40:51,573 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-08 07:40:51,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:40:51,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1287543467] [2025-02-08 07:40:51,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1287543467] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 07:40:51,573 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 07:40:51,573 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 07:40:51,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [223305420] [2025-02-08 07:40:51,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 07:40:51,574 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 07:40:51,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:40:51,574 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 07:40:51,574 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 07:40:51,574 INFO L87 Difference]: Start difference. First operand 186 states and 200 transitions. Second operand has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 07:40:51,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:40:51,655 INFO L93 Difference]: Finished difference Result 197 states and 212 transitions. [2025-02-08 07:40:51,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 07:40:51,655 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 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 43 [2025-02-08 07:40:51,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:40:51,656 INFO L225 Difference]: With dead ends: 197 [2025-02-08 07:40:51,656 INFO L226 Difference]: Without dead ends: 197 [2025-02-08 07:40:51,656 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 07:40:51,657 INFO L435 NwaCegarLoop]: 108 mSDtfsCounter, 130 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 07:40:51,657 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 135 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 07:40:51,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2025-02-08 07:40:51,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 181. [2025-02-08 07:40:51,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 119 states have (on average 1.6218487394957983) internal successors, (193), 178 states have internal predecessors, (193), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 07:40:51,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 195 transitions. [2025-02-08 07:40:51,660 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 195 transitions. Word has length 43 [2025-02-08 07:40:51,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:40:51,660 INFO L471 AbstractCegarLoop]: Abstraction has 181 states and 195 transitions. [2025-02-08 07:40:51,660 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 07:40:51,660 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 195 transitions. [2025-02-08 07:40:51,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-02-08 07:40:51,660 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:40:51,660 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 07:40:51,661 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-08 07:40:51,661 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr89REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 93 more)] === [2025-02-08 07:40:51,661 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:40:51,661 INFO L85 PathProgramCache]: Analyzing trace with hash 1035335891, now seen corresponding path program 1 times [2025-02-08 07:40:51,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:40:51,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1879179828] [2025-02-08 07:40:51,661 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:40:51,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:40:51,683 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-02-08 07:40:51,741 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-02-08 07:40:51,741 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:40:51,741 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:40:52,139 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-08 07:40:52,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:40:52,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1879179828] [2025-02-08 07:40:52,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1879179828] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 07:40:52,139 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 07:40:52,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 07:40:52,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1968488101] [2025-02-08 07:40:52,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 07:40:52,140 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 07:40:52,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:40:52,140 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 07:40:52,140 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-08 07:40:52,141 INFO L87 Difference]: Start difference. First operand 181 states and 195 transitions. Second operand has 6 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 07:40:52,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:40:52,308 INFO L93 Difference]: Finished difference Result 270 states and 297 transitions. [2025-02-08 07:40:52,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 07:40:52,308 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 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 43 [2025-02-08 07:40:52,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:40:52,309 INFO L225 Difference]: With dead ends: 270 [2025-02-08 07:40:52,310 INFO L226 Difference]: Without dead ends: 270 [2025-02-08 07:40:52,310 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-08 07:40:52,310 INFO L435 NwaCegarLoop]: 123 mSDtfsCounter, 335 mSDsluCounter, 345 mSDsCounter, 0 mSdLazyCounter, 190 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 335 SdHoareTripleChecker+Valid, 468 SdHoareTripleChecker+Invalid, 190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 07:40:52,310 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [335 Valid, 468 Invalid, 190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 190 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 07:40:52,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2025-02-08 07:40:52,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 180. [2025-02-08 07:40:52,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 119 states have (on average 1.6134453781512605) internal successors, (192), 177 states have internal predecessors, (192), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 07:40:52,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 194 transitions. [2025-02-08 07:40:52,328 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 194 transitions. Word has length 43 [2025-02-08 07:40:52,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:40:52,328 INFO L471 AbstractCegarLoop]: Abstraction has 180 states and 194 transitions. [2025-02-08 07:40:52,328 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 07:40:52,328 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 194 transitions. [2025-02-08 07:40:52,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-02-08 07:40:52,333 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:40:52,333 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 07:40:52,333 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-08 07:40:52,333 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr73REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 93 more)] === [2025-02-08 07:40:52,333 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:40:52,333 INFO L85 PathProgramCache]: Analyzing trace with hash 1531584765, now seen corresponding path program 1 times [2025-02-08 07:40:52,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:40:52,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1598684715] [2025-02-08 07:40:52,334 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:40:52,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:40:52,380 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-02-08 07:40:52,409 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-02-08 07:40:52,410 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:40:52,410 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:40:52,565 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-08 07:40:52,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:40:52,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1598684715] [2025-02-08 07:40:52,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1598684715] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 07:40:52,566 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 07:40:52,566 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-08 07:40:52,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1993681606] [2025-02-08 07:40:52,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 07:40:52,566 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 07:40:52,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:40:52,566 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 07:40:52,566 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-08 07:40:52,566 INFO L87 Difference]: Start difference. First operand 180 states and 194 transitions. Second operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 07:40:52,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:40:52,630 INFO L93 Difference]: Finished difference Result 199 states and 219 transitions. [2025-02-08 07:40:52,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 07:40:52,630 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 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 46 [2025-02-08 07:40:52,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:40:52,631 INFO L225 Difference]: With dead ends: 199 [2025-02-08 07:40:52,631 INFO L226 Difference]: Without dead ends: 199 [2025-02-08 07:40:52,632 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-08 07:40:52,632 INFO L435 NwaCegarLoop]: 147 mSDtfsCounter, 173 mSDsluCounter, 433 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 580 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 07:40:52,632 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [173 Valid, 580 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 07:40:52,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2025-02-08 07:40:52,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 181. [2025-02-08 07:40:52,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 120 states have (on average 1.6083333333333334) internal successors, (193), 178 states have internal predecessors, (193), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 07:40:52,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 195 transitions. [2025-02-08 07:40:52,635 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 195 transitions. Word has length 46 [2025-02-08 07:40:52,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:40:52,635 INFO L471 AbstractCegarLoop]: Abstraction has 181 states and 195 transitions. [2025-02-08 07:40:52,635 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 07:40:52,635 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 195 transitions. [2025-02-08 07:40:52,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-02-08 07:40:52,635 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:40:52,635 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 07:40:52,636 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-08 07:40:52,636 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr87REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 93 more)] === [2025-02-08 07:40:52,636 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:40:52,636 INFO L85 PathProgramCache]: Analyzing trace with hash 1531585693, now seen corresponding path program 1 times [2025-02-08 07:40:52,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:40:52,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [709947452] [2025-02-08 07:40:52,636 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:40:52,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:40:52,673 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-02-08 07:40:52,691 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-02-08 07:40:52,692 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:40:52,692 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:40:52,958 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-08 07:40:52,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:40:52,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [709947452] [2025-02-08 07:40:52,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [709947452] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 07:40:52,958 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 07:40:52,959 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 07:40:52,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1272603388] [2025-02-08 07:40:52,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 07:40:52,959 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 07:40:52,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:40:52,959 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 07:40:52,960 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-02-08 07:40:52,960 INFO L87 Difference]: Start difference. First operand 181 states and 195 transitions. Second operand has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 07:40:53,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:40:53,103 INFO L93 Difference]: Finished difference Result 214 states and 231 transitions. [2025-02-08 07:40:53,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 07:40:53,103 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 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 46 [2025-02-08 07:40:53,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:40:53,104 INFO L225 Difference]: With dead ends: 214 [2025-02-08 07:40:53,104 INFO L226 Difference]: Without dead ends: 214 [2025-02-08 07:40:53,105 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-02-08 07:40:53,105 INFO L435 NwaCegarLoop]: 79 mSDtfsCounter, 353 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 353 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 07:40:53,105 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [353 Valid, 165 Invalid, 190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 07:40:53,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2025-02-08 07:40:53,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 193. [2025-02-08 07:40:53,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 133 states have (on average 1.593984962406015) internal successors, (212), 190 states have internal predecessors, (212), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 07:40:53,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 214 transitions. [2025-02-08 07:40:53,109 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 214 transitions. Word has length 46 [2025-02-08 07:40:53,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:40:53,109 INFO L471 AbstractCegarLoop]: Abstraction has 193 states and 214 transitions. [2025-02-08 07:40:53,109 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 07:40:53,109 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 214 transitions. [2025-02-08 07:40:53,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-02-08 07:40:53,110 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:40:53,110 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, 1, 1] [2025-02-08 07:40:53,110 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-08 07:40:53,110 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr82REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 93 more)] === [2025-02-08 07:40:53,110 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:40:53,110 INFO L85 PathProgramCache]: Analyzing trace with hash 2031999213, now seen corresponding path program 1 times [2025-02-08 07:40:53,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:40:53,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1146007048] [2025-02-08 07:40:53,111 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:40:53,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:40:53,134 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-02-08 07:40:53,162 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-02-08 07:40:53,162 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:40:53,163 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:40:53,316 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-08 07:40:53,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:40:53,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1146007048] [2025-02-08 07:40:53,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1146007048] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 07:40:53,316 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 07:40:53,316 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 07:40:53,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1955223879] [2025-02-08 07:40:53,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 07:40:53,317 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 07:40:53,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:40:53,317 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 07:40:53,317 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 07:40:53,317 INFO L87 Difference]: Start difference. First operand 193 states and 214 transitions. Second operand has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 07:40:53,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:40:53,393 INFO L93 Difference]: Finished difference Result 198 states and 221 transitions. [2025-02-08 07:40:53,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 07:40:53,393 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 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 49 [2025-02-08 07:40:53,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:40:53,394 INFO L225 Difference]: With dead ends: 198 [2025-02-08 07:40:53,394 INFO L226 Difference]: Without dead ends: 198 [2025-02-08 07:40:53,394 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 07:40:53,394 INFO L435 NwaCegarLoop]: 110 mSDtfsCounter, 123 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 07:40:53,395 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 131 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 07:40:53,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2025-02-08 07:40:53,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 197. [2025-02-08 07:40:53,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 138 states have (on average 1.5869565217391304) internal successors, (219), 194 states have internal predecessors, (219), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 07:40:53,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 221 transitions. [2025-02-08 07:40:53,398 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 221 transitions. Word has length 49 [2025-02-08 07:40:53,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:40:53,399 INFO L471 AbstractCegarLoop]: Abstraction has 197 states and 221 transitions. [2025-02-08 07:40:53,399 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 07:40:53,399 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 221 transitions. [2025-02-08 07:40:53,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-02-08 07:40:53,399 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:40:53,399 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, 1, 1] [2025-02-08 07:40:53,400 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-08 07:40:53,400 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr83REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 93 more)] === [2025-02-08 07:40:53,400 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:40:53,400 INFO L85 PathProgramCache]: Analyzing trace with hash 2031999214, now seen corresponding path program 1 times [2025-02-08 07:40:53,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:40:53,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [884353582] [2025-02-08 07:40:53,400 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:40:53,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:40:53,433 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-02-08 07:40:53,471 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-02-08 07:40:53,472 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:40:53,472 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:40:54,090 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-08 07:40:54,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:40:54,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [884353582] [2025-02-08 07:40:54,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [884353582] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 07:40:54,091 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 07:40:54,091 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 07:40:54,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [238446634] [2025-02-08 07:40:54,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 07:40:54,091 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 07:40:54,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:40:54,091 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 07:40:54,091 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-08 07:40:54,091 INFO L87 Difference]: Start difference. First operand 197 states and 221 transitions. Second operand has 6 states, 5 states have (on average 4.0) internal successors, (20), 6 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 07:40:54,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:40:54,418 INFO L93 Difference]: Finished difference Result 207 states and 226 transitions. [2025-02-08 07:40:54,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 07:40:54,418 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 6 states have internal predecessors, (20), 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 49 [2025-02-08 07:40:54,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:40:54,419 INFO L225 Difference]: With dead ends: 207 [2025-02-08 07:40:54,420 INFO L226 Difference]: Without dead ends: 207 [2025-02-08 07:40:54,420 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-02-08 07:40:54,421 INFO L435 NwaCegarLoop]: 81 mSDtfsCounter, 142 mSDsluCounter, 210 mSDsCounter, 0 mSdLazyCounter, 405 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 291 SdHoareTripleChecker+Invalid, 408 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 405 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-08 07:40:54,421 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 291 Invalid, 408 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 405 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-08 07:40:54,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2025-02-08 07:40:54,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 197. [2025-02-08 07:40:54,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 138 states have (on average 1.5797101449275361) internal successors, (218), 194 states have internal predecessors, (218), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 07:40:54,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 220 transitions. [2025-02-08 07:40:54,430 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 220 transitions. Word has length 49 [2025-02-08 07:40:54,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:40:54,430 INFO L471 AbstractCegarLoop]: Abstraction has 197 states and 220 transitions. [2025-02-08 07:40:54,430 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 6 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 07:40:54,431 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 220 transitions. [2025-02-08 07:40:54,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-02-08 07:40:54,431 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:40:54,431 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, 1, 1, 1, 1, 1] [2025-02-08 07:40:54,431 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-08 07:40:54,431 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr78REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 93 more)] === [2025-02-08 07:40:54,431 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:40:54,431 INFO L85 PathProgramCache]: Analyzing trace with hash 2019711957, now seen corresponding path program 1 times [2025-02-08 07:40:54,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:40:54,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2145907222] [2025-02-08 07:40:54,432 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:40:54,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:40:54,458 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-02-08 07:40:54,470 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-02-08 07:40:54,471 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:40:54,471 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:40:54,695 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-08 07:40:54,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:40:54,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2145907222] [2025-02-08 07:40:54,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2145907222] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 07:40:54,695 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 07:40:54,695 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 07:40:54,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1043566745] [2025-02-08 07:40:54,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 07:40:54,696 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 07:40:54,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:40:54,697 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 07:40:54,697 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 07:40:54,697 INFO L87 Difference]: Start difference. First operand 197 states and 220 transitions. Second operand has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 07:40:54,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:40:54,852 INFO L93 Difference]: Finished difference Result 196 states and 218 transitions. [2025-02-08 07:40:54,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 07:40:54,852 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 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 52 [2025-02-08 07:40:54,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:40:54,853 INFO L225 Difference]: With dead ends: 196 [2025-02-08 07:40:54,853 INFO L226 Difference]: Without dead ends: 196 [2025-02-08 07:40:54,853 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-08 07:40:54,854 INFO L435 NwaCegarLoop]: 149 mSDtfsCounter, 12 mSDsluCounter, 272 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 421 SdHoareTripleChecker+Invalid, 212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 07:40:54,854 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 421 Invalid, 212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 212 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 07:40:54,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2025-02-08 07:40:54,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 196. [2025-02-08 07:40:54,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 138 states have (on average 1.565217391304348) internal successors, (216), 193 states have internal predecessors, (216), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 07:40:54,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 218 transitions. [2025-02-08 07:40:54,860 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 218 transitions. Word has length 52 [2025-02-08 07:40:54,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:40:54,861 INFO L471 AbstractCegarLoop]: Abstraction has 196 states and 218 transitions. [2025-02-08 07:40:54,861 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 07:40:54,861 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 218 transitions. [2025-02-08 07:40:54,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-02-08 07:40:54,862 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:40:54,862 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, 1, 1, 1, 1, 1] [2025-02-08 07:40:54,864 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-08 07:40:54,864 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr79REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 93 more)] === [2025-02-08 07:40:54,864 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:40:54,864 INFO L85 PathProgramCache]: Analyzing trace with hash 2019711958, now seen corresponding path program 1 times [2025-02-08 07:40:54,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:40:54,864 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1009229206] [2025-02-08 07:40:54,864 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:40:54,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:40:54,899 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-02-08 07:40:54,917 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-02-08 07:40:54,917 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:40:54,917 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:40:55,299 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-08 07:40:55,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:40:55,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1009229206] [2025-02-08 07:40:55,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1009229206] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 07:40:55,299 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 07:40:55,300 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 07:40:55,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1374159931] [2025-02-08 07:40:55,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 07:40:55,300 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 07:40:55,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:40:55,300 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 07:40:55,301 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 07:40:55,301 INFO L87 Difference]: Start difference. First operand 196 states and 218 transitions. Second operand has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 07:40:55,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:40:55,445 INFO L93 Difference]: Finished difference Result 195 states and 216 transitions. [2025-02-08 07:40:55,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 07:40:55,445 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 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 52 [2025-02-08 07:40:55,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:40:55,446 INFO L225 Difference]: With dead ends: 195 [2025-02-08 07:40:55,446 INFO L226 Difference]: Without dead ends: 195 [2025-02-08 07:40:55,446 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-08 07:40:55,447 INFO L435 NwaCegarLoop]: 148 mSDtfsCounter, 11 mSDsluCounter, 296 mSDsCounter, 0 mSdLazyCounter, 186 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 444 SdHoareTripleChecker+Invalid, 186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 07:40:55,447 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 444 Invalid, 186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 186 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 07:40:55,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2025-02-08 07:40:55,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 195. [2025-02-08 07:40:55,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 138 states have (on average 1.5507246376811594) internal successors, (214), 192 states have internal predecessors, (214), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 07:40:55,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 216 transitions. [2025-02-08 07:40:55,451 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 216 transitions. Word has length 52 [2025-02-08 07:40:55,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:40:55,452 INFO L471 AbstractCegarLoop]: Abstraction has 195 states and 216 transitions. [2025-02-08 07:40:55,452 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 07:40:55,452 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 216 transitions. [2025-02-08 07:40:55,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-02-08 07:40:55,453 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:40:55,454 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 07:40:55,454 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-08 07:40:55,454 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr73REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 93 more)] === [2025-02-08 07:40:55,454 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:40:55,454 INFO L85 PathProgramCache]: Analyzing trace with hash -2049013271, now seen corresponding path program 1 times [2025-02-08 07:40:55,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:40:55,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2056489803] [2025-02-08 07:40:55,454 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:40:55,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:40:55,485 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-02-08 07:40:55,499 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-02-08 07:40:55,500 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:40:55,500 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:40:55,568 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-08 07:40:55,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:40:55,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2056489803] [2025-02-08 07:40:55,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2056489803] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 07:40:55,569 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 07:40:55,569 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 07:40:55,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [716467400] [2025-02-08 07:40:55,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 07:40:55,569 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 07:40:55,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:40:55,570 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 07:40:55,570 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 07:40:55,570 INFO L87 Difference]: Start difference. First operand 195 states and 216 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 07:40:55,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:40:55,616 INFO L93 Difference]: Finished difference Result 207 states and 231 transitions. [2025-02-08 07:40:55,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 07:40:55,617 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 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 56 [2025-02-08 07:40:55,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:40:55,618 INFO L225 Difference]: With dead ends: 207 [2025-02-08 07:40:55,618 INFO L226 Difference]: Without dead ends: 207 [2025-02-08 07:40:55,618 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 07:40:55,619 INFO L435 NwaCegarLoop]: 158 mSDtfsCounter, 6 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 313 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 07:40:55,619 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 313 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 07:40:55,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2025-02-08 07:40:55,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 197. [2025-02-08 07:40:55,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 140 states have (on average 1.542857142857143) internal successors, (216), 194 states have internal predecessors, (216), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 07:40:55,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 218 transitions. [2025-02-08 07:40:55,623 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 218 transitions. Word has length 56 [2025-02-08 07:40:55,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:40:55,623 INFO L471 AbstractCegarLoop]: Abstraction has 197 states and 218 transitions. [2025-02-08 07:40:55,623 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 07:40:55,623 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 218 transitions. [2025-02-08 07:40:55,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-02-08 07:40:55,623 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:40:55,623 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 07:40:55,623 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-08 07:40:55,624 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr74REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 93 more)] === [2025-02-08 07:40:55,624 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:40:55,624 INFO L85 PathProgramCache]: Analyzing trace with hash 905373347, now seen corresponding path program 1 times [2025-02-08 07:40:55,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:40:55,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1851195665] [2025-02-08 07:40:55,624 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:40:55,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:40:55,655 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-02-08 07:40:55,666 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-02-08 07:40:55,667 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:40:55,667 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:40:55,779 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-08 07:40:55,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:40:55,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1851195665] [2025-02-08 07:40:55,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1851195665] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 07:40:55,780 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 07:40:55,780 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 07:40:55,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [102339] [2025-02-08 07:40:55,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 07:40:55,780 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 07:40:55,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:40:55,781 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 07:40:55,781 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 07:40:55,781 INFO L87 Difference]: Start difference. First operand 197 states and 218 transitions. Second operand has 5 states, 4 states have (on average 7.0) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 07:40:55,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:40:55,983 INFO L93 Difference]: Finished difference Result 196 states and 216 transitions. [2025-02-08 07:40:55,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 07:40:55,983 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 7.0) internal successors, (28), 5 states have internal predecessors, (28), 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 57 [2025-02-08 07:40:55,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:40:55,984 INFO L225 Difference]: With dead ends: 196 [2025-02-08 07:40:55,984 INFO L226 Difference]: Without dead ends: 196 [2025-02-08 07:40:55,985 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-08 07:40:55,985 INFO L435 NwaCegarLoop]: 155 mSDtfsCounter, 5 mSDsluCounter, 312 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 467 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 07:40:55,986 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 467 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 07:40:55,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2025-02-08 07:40:55,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 196. [2025-02-08 07:40:55,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 140 states have (on average 1.5285714285714285) internal successors, (214), 193 states have internal predecessors, (214), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 07:40:55,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 216 transitions. [2025-02-08 07:40:55,991 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 216 transitions. Word has length 57 [2025-02-08 07:40:55,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:40:55,992 INFO L471 AbstractCegarLoop]: Abstraction has 196 states and 216 transitions. [2025-02-08 07:40:55,992 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 7.0) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 07:40:55,992 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 216 transitions. [2025-02-08 07:40:55,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-02-08 07:40:55,993 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:40:55,993 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 07:40:55,993 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-08 07:40:55,993 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr75REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 93 more)] === [2025-02-08 07:40:55,993 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:40:55,994 INFO L85 PathProgramCache]: Analyzing trace with hash 905373348, now seen corresponding path program 1 times [2025-02-08 07:40:55,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:40:55,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [185514508] [2025-02-08 07:40:55,994 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:40:55,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:40:56,021 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-02-08 07:40:56,043 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-02-08 07:40:56,043 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:40:56,043 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:40:56,525 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-08 07:40:56,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:40:56,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [185514508] [2025-02-08 07:40:56,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [185514508] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 07:40:56,526 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 07:40:56,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-08 07:40:56,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [356215764] [2025-02-08 07:40:56,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 07:40:56,526 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 07:40:56,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:40:56,526 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 07:40:56,526 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-02-08 07:40:56,527 INFO L87 Difference]: Start difference. First operand 196 states and 216 transitions. Second operand has 7 states, 6 states have (on average 4.666666666666667) internal successors, (28), 7 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 07:40:56,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:40:56,754 INFO L93 Difference]: Finished difference Result 204 states and 225 transitions. [2025-02-08 07:40:56,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 07:40:56,754 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.666666666666667) internal successors, (28), 7 states have internal predecessors, (28), 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 57 [2025-02-08 07:40:56,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:40:56,755 INFO L225 Difference]: With dead ends: 204 [2025-02-08 07:40:56,755 INFO L226 Difference]: Without dead ends: 204 [2025-02-08 07:40:56,755 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-02-08 07:40:56,755 INFO L435 NwaCegarLoop]: 145 mSDtfsCounter, 11 mSDsluCounter, 476 mSDsCounter, 0 mSdLazyCounter, 327 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 621 SdHoareTripleChecker+Invalid, 327 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 327 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 07:40:56,755 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 621 Invalid, 327 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 327 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 07:40:56,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2025-02-08 07:40:56,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 202. [2025-02-08 07:40:56,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 146 states have (on average 1.5136986301369864) internal successors, (221), 199 states have internal predecessors, (221), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 07:40:56,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 223 transitions. [2025-02-08 07:40:56,760 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 223 transitions. Word has length 57 [2025-02-08 07:40:56,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:40:56,760 INFO L471 AbstractCegarLoop]: Abstraction has 202 states and 223 transitions. [2025-02-08 07:40:56,760 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.666666666666667) internal successors, (28), 7 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 07:40:56,761 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 223 transitions. [2025-02-08 07:40:56,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-02-08 07:40:56,761 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:40:56,761 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 07:40:56,761 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-08 07:40:56,762 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr73REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 93 more)] === [2025-02-08 07:40:56,763 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:40:56,763 INFO L85 PathProgramCache]: Analyzing trace with hash -42932640, now seen corresponding path program 1 times [2025-02-08 07:40:56,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:40:56,763 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2091995134] [2025-02-08 07:40:56,763 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:40:56,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:40:56,790 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-02-08 07:40:56,801 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-02-08 07:40:56,801 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:40:56,801 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:40:56,883 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-08 07:40:56,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:40:56,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2091995134] [2025-02-08 07:40:56,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2091995134] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 07:40:56,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1874026870] [2025-02-08 07:40:56,884 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:40:56,884 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 07:40:56,884 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 07:40:56,886 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 07:40:56,888 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-08 07:40:57,044 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-02-08 07:40:57,163 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-02-08 07:40:57,163 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:40:57,163 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:40:57,168 INFO L256 TraceCheckSpWp]: Trace formula consists of 1267 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-08 07:40:57,170 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 07:40:57,193 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-08 07:40:57,193 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 07:40:57,223 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-08 07:40:57,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1874026870] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 07:40:57,225 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 07:40:57,225 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-02-08 07:40:57,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2002432782] [2025-02-08 07:40:57,226 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 07:40:57,226 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 07:40:57,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:40:57,226 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 07:40:57,226 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-02-08 07:40:57,227 INFO L87 Difference]: Start difference. First operand 202 states and 223 transitions. Second operand has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 07:40:57,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:40:57,268 INFO L93 Difference]: Finished difference Result 229 states and 253 transitions. [2025-02-08 07:40:57,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 07:40:57,269 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 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 61 [2025-02-08 07:40:57,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:40:57,270 INFO L225 Difference]: With dead ends: 229 [2025-02-08 07:40:57,270 INFO L226 Difference]: Without dead ends: 229 [2025-02-08 07:40:57,271 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-02-08 07:40:57,271 INFO L435 NwaCegarLoop]: 157 mSDtfsCounter, 12 mSDsluCounter, 767 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 924 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 07:40:57,271 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 924 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 07:40:57,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2025-02-08 07:40:57,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 226. [2025-02-08 07:40:57,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226 states, 170 states have (on average 1.4764705882352942) internal successors, (251), 223 states have internal predecessors, (251), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 07:40:57,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 253 transitions. [2025-02-08 07:40:57,276 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 253 transitions. Word has length 61 [2025-02-08 07:40:57,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:40:57,276 INFO L471 AbstractCegarLoop]: Abstraction has 226 states and 253 transitions. [2025-02-08 07:40:57,276 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 07:40:57,276 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 253 transitions. [2025-02-08 07:40:57,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-02-08 07:40:57,277 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:40:57,277 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 07:40:57,288 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-02-08 07:40:57,477 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2025-02-08 07:40:57,477 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr75REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 93 more)] === [2025-02-08 07:40:57,480 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:40:57,481 INFO L85 PathProgramCache]: Analyzing trace with hash -1330636531, now seen corresponding path program 1 times [2025-02-08 07:40:57,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:40:57,481 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1400767108] [2025-02-08 07:40:57,481 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:40:57,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:40:57,508 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-02-08 07:40:57,533 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-02-08 07:40:57,534 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:40:57,535 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:40:58,218 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-08 07:40:58,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:40:58,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1400767108] [2025-02-08 07:40:58,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1400767108] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 07:40:58,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1482707160] [2025-02-08 07:40:58,218 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:40:58,219 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 07:40:58,219 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 07:40:58,223 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 07:40:58,226 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-08 07:40:58,388 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-02-08 07:40:58,503 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-02-08 07:40:58,503 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:40:58,503 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:40:58,508 INFO L256 TraceCheckSpWp]: Trace formula consists of 1262 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-02-08 07:40:58,518 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 07:40:58,532 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-02-08 07:40:58,556 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2025-02-08 07:40:58,561 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2025-02-08 07:40:58,724 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 25 treesize of output 9 [2025-02-08 07:40:58,731 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 36 treesize of output 12 [2025-02-08 07:40:58,758 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-08 07:40:58,758 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 07:40:59,007 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-08 07:40:59,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1482707160] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 07:40:59,010 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 07:40:59,010 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8] total 21 [2025-02-08 07:40:59,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1340230482] [2025-02-08 07:40:59,011 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 07:40:59,011 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-02-08 07:40:59,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:40:59,011 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-02-08 07:40:59,012 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=374, Unknown=0, NotChecked=0, Total=462 [2025-02-08 07:40:59,012 INFO L87 Difference]: Start difference. First operand 226 states and 253 transitions. Second operand has 22 states, 21 states have (on average 3.2857142857142856) internal successors, (69), 22 states have internal predecessors, (69), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 07:40:59,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:40:59,672 INFO L93 Difference]: Finished difference Result 225 states and 247 transitions. [2025-02-08 07:40:59,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-08 07:40:59,673 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 3.2857142857142856) internal successors, (69), 22 states have internal predecessors, (69), 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 62 [2025-02-08 07:40:59,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:40:59,674 INFO L225 Difference]: With dead ends: 225 [2025-02-08 07:40:59,674 INFO L226 Difference]: Without dead ends: 225 [2025-02-08 07:40:59,674 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 151 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=166, Invalid=590, Unknown=0, NotChecked=0, Total=756 [2025-02-08 07:40:59,675 INFO L435 NwaCegarLoop]: 146 mSDtfsCounter, 26 mSDsluCounter, 1335 mSDsCounter, 0 mSdLazyCounter, 938 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 1481 SdHoareTripleChecker+Invalid, 940 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 938 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-08 07:40:59,675 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 1481 Invalid, 940 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 938 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-08 07:40:59,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2025-02-08 07:40:59,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 225. [2025-02-08 07:40:59,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 225 states, 170 states have (on average 1.4411764705882353) internal successors, (245), 222 states have internal predecessors, (245), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 07:40:59,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 247 transitions. [2025-02-08 07:40:59,679 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 247 transitions. Word has length 62 [2025-02-08 07:40:59,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:40:59,679 INFO L471 AbstractCegarLoop]: Abstraction has 225 states and 247 transitions. [2025-02-08 07:40:59,679 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 3.2857142857142856) internal successors, (69), 22 states have internal predecessors, (69), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 07:40:59,679 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 247 transitions. [2025-02-08 07:40:59,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-02-08 07:40:59,679 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:40:59,680 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 07:40:59,689 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-02-08 07:40:59,880 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2025-02-08 07:40:59,880 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr73REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 93 more)] === [2025-02-08 07:40:59,880 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:40:59,881 INFO L85 PathProgramCache]: Analyzing trace with hash -1033931095, now seen corresponding path program 2 times [2025-02-08 07:40:59,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:40:59,881 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2037463530] [2025-02-08 07:40:59,881 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 07:40:59,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:40:59,907 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 76 statements into 2 equivalence classes. [2025-02-08 07:40:59,977 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 76 of 76 statements. [2025-02-08 07:40:59,981 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 07:40:59,981 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:41:00,196 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 1 proven. 34 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-08 07:41:00,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:41:00,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2037463530] [2025-02-08 07:41:00,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2037463530] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 07:41:00,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1511788111] [2025-02-08 07:41:00,197 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 07:41:00,197 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 07:41:00,197 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 07:41:00,199 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 07:41:00,204 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-02-08 07:41:00,382 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 76 statements into 2 equivalence classes. [2025-02-08 07:41:00,503 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 76 of 76 statements. [2025-02-08 07:41:00,503 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 07:41:00,503 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:41:00,507 INFO L256 TraceCheckSpWp]: Trace formula consists of 1354 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-08 07:41:00,509 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 07:41:00,555 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 1 proven. 34 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-08 07:41:00,556 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 07:41:00,648 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 1 proven. 34 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-08 07:41:00,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1511788111] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 07:41:00,648 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 07:41:00,649 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2025-02-08 07:41:00,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1785371527] [2025-02-08 07:41:00,649 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 07:41:00,649 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-08 07:41:00,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:41:00,649 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-08 07:41:00,649 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-02-08 07:41:00,649 INFO L87 Difference]: Start difference. First operand 225 states and 247 transitions. Second operand has 13 states, 13 states have (on average 5.769230769230769) internal successors, (75), 13 states have internal predecessors, (75), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 07:41:00,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:41:00,740 INFO L93 Difference]: Finished difference Result 294 states and 313 transitions. [2025-02-08 07:41:00,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-08 07:41:00,741 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.769230769230769) internal successors, (75), 13 states have internal predecessors, (75), 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 76 [2025-02-08 07:41:00,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:41:00,742 INFO L225 Difference]: With dead ends: 294 [2025-02-08 07:41:00,745 INFO L226 Difference]: Without dead ends: 294 [2025-02-08 07:41:00,746 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-02-08 07:41:00,746 INFO L435 NwaCegarLoop]: 157 mSDtfsCounter, 26 mSDsluCounter, 782 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 939 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 07:41:00,746 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 939 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 07:41:00,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2025-02-08 07:41:00,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 285. [2025-02-08 07:41:00,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 285 states, 230 states have (on average 1.3521739130434782) internal successors, (311), 282 states have internal predecessors, (311), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 07:41:00,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 313 transitions. [2025-02-08 07:41:00,751 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 313 transitions. Word has length 76 [2025-02-08 07:41:00,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:41:00,752 INFO L471 AbstractCegarLoop]: Abstraction has 285 states and 313 transitions. [2025-02-08 07:41:00,752 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.769230769230769) internal successors, (75), 13 states have internal predecessors, (75), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 07:41:00,752 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 313 transitions. [2025-02-08 07:41:00,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2025-02-08 07:41:00,752 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:41:00,752 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 07:41:00,762 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-02-08 07:41:00,956 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2025-02-08 07:41:00,956 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr73REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 93 more)] === [2025-02-08 07:41:00,957 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:41:00,957 INFO L85 PathProgramCache]: Analyzing trace with hash -91564599, now seen corresponding path program 3 times [2025-02-08 07:41:00,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:41:00,957 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [6264046] [2025-02-08 07:41:00,957 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 07:41:00,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:41:01,003 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 106 statements into 12 equivalence classes. [2025-02-08 07:41:01,038 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 29 of 106 statements. [2025-02-08 07:41:01,038 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-02-08 07:41:01,038 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:41:01,501 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2025-02-08 07:41:01,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:41:01,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [6264046] [2025-02-08 07:41:01,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [6264046] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 07:41:01,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1937475728] [2025-02-08 07:41:01,505 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 07:41:01,505 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 07:41:01,505 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 07:41:01,507 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 07:41:01,507 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-02-08 07:41:01,850 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 106 statements into 12 equivalence classes. [2025-02-08 07:41:02,010 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 29 of 106 statements. [2025-02-08 07:41:02,010 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-02-08 07:41:02,010 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:41:02,016 INFO L256 TraceCheckSpWp]: Trace formula consists of 1049 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-02-08 07:41:02,024 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 07:41:02,087 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 07:41:02,089 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-02-08 07:41:02,099 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-08 07:41:02,099 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-02-08 07:41:02,258 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2025-02-08 07:41:02,258 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 07:41:02,528 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 49 treesize of output 45 [2025-02-08 07:41:02,546 INFO L349 Elim1Store]: treesize reduction 5, result has 80.0 percent of original size [2025-02-08 07:41:02,546 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 36 treesize of output 49 [2025-02-08 07:41:02,573 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2025-02-08 07:41:02,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1937475728] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 07:41:02,573 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 07:41:02,573 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 6] total 18 [2025-02-08 07:41:02,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [815784494] [2025-02-08 07:41:02,573 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 07:41:02,573 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-02-08 07:41:02,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:41:02,574 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-02-08 07:41:02,574 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=258, Unknown=0, NotChecked=0, Total=342 [2025-02-08 07:41:02,574 INFO L87 Difference]: Start difference. First operand 285 states and 313 transitions. Second operand has 19 states, 18 states have (on average 4.0) internal successors, (72), 19 states have internal predecessors, (72), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 07:41:03,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:41:03,287 INFO L93 Difference]: Finished difference Result 293 states and 318 transitions. [2025-02-08 07:41:03,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-08 07:41:03,288 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 4.0) internal successors, (72), 19 states have internal predecessors, (72), 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 106 [2025-02-08 07:41:03,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:41:03,289 INFO L225 Difference]: With dead ends: 293 [2025-02-08 07:41:03,289 INFO L226 Difference]: Without dead ends: 293 [2025-02-08 07:41:03,289 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 224 GetRequests, 201 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=177, Invalid=423, Unknown=0, NotChecked=0, Total=600 [2025-02-08 07:41:03,290 INFO L435 NwaCegarLoop]: 78 mSDtfsCounter, 556 mSDsluCounter, 324 mSDsCounter, 0 mSdLazyCounter, 501 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 556 SdHoareTripleChecker+Valid, 402 SdHoareTripleChecker+Invalid, 516 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 501 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-08 07:41:03,290 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [556 Valid, 402 Invalid, 516 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 501 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-08 07:41:03,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2025-02-08 07:41:03,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 284. [2025-02-08 07:41:03,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 284 states, 230 states have (on average 1.3478260869565217) internal successors, (310), 281 states have internal predecessors, (310), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 07:41:03,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 312 transitions. [2025-02-08 07:41:03,302 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 312 transitions. Word has length 106 [2025-02-08 07:41:03,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:41:03,302 INFO L471 AbstractCegarLoop]: Abstraction has 284 states and 312 transitions. [2025-02-08 07:41:03,302 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 4.0) internal successors, (72), 19 states have internal predecessors, (72), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 07:41:03,302 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 312 transitions. [2025-02-08 07:41:03,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2025-02-08 07:41:03,303 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:41:03,303 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 07:41:03,323 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-02-08 07:41:03,503 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 07:41:03,504 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr72REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 93 more)] === [2025-02-08 07:41:03,504 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:41:03,504 INFO L85 PathProgramCache]: Analyzing trace with hash -91564600, now seen corresponding path program 1 times [2025-02-08 07:41:03,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:41:03,504 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1857859153] [2025-02-08 07:41:03,508 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:41:03,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:41:03,561 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-02-08 07:41:03,590 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-02-08 07:41:03,593 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:41:03,593 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:41:03,909 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2025-02-08 07:41:03,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:41:03,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1857859153] [2025-02-08 07:41:03,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1857859153] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 07:41:03,910 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 07:41:03,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 07:41:03,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [14482115] [2025-02-08 07:41:03,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 07:41:03,910 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 07:41:03,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:41:03,910 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 07:41:03,910 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 07:41:03,910 INFO L87 Difference]: Start difference. First operand 284 states and 312 transitions. Second operand has 4 states, 3 states have (on average 10.666666666666666) internal successors, (32), 4 states have internal predecessors, (32), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 07:41:04,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:41:04,159 INFO L93 Difference]: Finished difference Result 294 states and 319 transitions. [2025-02-08 07:41:04,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 07:41:04,160 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 10.666666666666666) internal successors, (32), 4 states have internal predecessors, (32), 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 106 [2025-02-08 07:41:04,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:41:04,161 INFO L225 Difference]: With dead ends: 294 [2025-02-08 07:41:04,161 INFO L226 Difference]: Without dead ends: 294 [2025-02-08 07:41:04,161 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-08 07:41:04,161 INFO L435 NwaCegarLoop]: 100 mSDtfsCounter, 180 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 180 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 07:41:04,161 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [180 Valid, 171 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 07:41:04,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2025-02-08 07:41:04,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 279. [2025-02-08 07:41:04,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 279 states, 230 states have (on average 1.326086956521739) internal successors, (305), 276 states have internal predecessors, (305), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 07:41:04,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 307 transitions. [2025-02-08 07:41:04,165 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 307 transitions. Word has length 106 [2025-02-08 07:41:04,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:41:04,166 INFO L471 AbstractCegarLoop]: Abstraction has 279 states and 307 transitions. [2025-02-08 07:41:04,166 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 10.666666666666666) internal successors, (32), 4 states have internal predecessors, (32), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 07:41:04,166 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 307 transitions. [2025-02-08 07:41:04,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2025-02-08 07:41:04,168 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:41:04,168 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 07:41:04,168 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-02-08 07:41:04,168 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr87REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 93 more)] === [2025-02-08 07:41:04,169 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:41:04,169 INFO L85 PathProgramCache]: Analyzing trace with hash -91563671, now seen corresponding path program 1 times [2025-02-08 07:41:04,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:41:04,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1812956947] [2025-02-08 07:41:04,169 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:41:04,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:41:04,197 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-02-08 07:41:04,219 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-02-08 07:41:04,219 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:41:04,219 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:41:04,705 INFO L134 CoverageAnalysis]: Checked inductivity of 382 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2025-02-08 07:41:04,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:41:04,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1812956947] [2025-02-08 07:41:04,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1812956947] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 07:41:04,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1154374949] [2025-02-08 07:41:04,706 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:41:04,706 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 07:41:04,706 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 07:41:04,708 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 07:41:04,710 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-02-08 07:41:04,907 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-02-08 07:41:05,039 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-02-08 07:41:05,040 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:41:05,040 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:41:05,045 INFO L256 TraceCheckSpWp]: Trace formula consists of 1528 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-02-08 07:41:05,048 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 07:41:05,095 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-02-08 07:41:05,096 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2025-02-08 07:41:05,107 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-08 07:41:05,107 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-02-08 07:41:05,169 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-02-08 07:41:05,626 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 8 treesize of output 4 [2025-02-08 07:41:05,707 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 07:41:05,707 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-02-08 07:41:05,719 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-08 07:41:05,719 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-02-08 07:41:05,730 INFO L134 CoverageAnalysis]: Checked inductivity of 382 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 305 trivial. 0 not checked. [2025-02-08 07:41:05,730 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 07:41:06,745 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 07:41:06,746 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 61 [2025-02-08 07:41:06,914 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 49 treesize of output 45 [2025-02-08 07:41:06,933 INFO L349 Elim1Store]: treesize reduction 5, result has 80.0 percent of original size [2025-02-08 07:41:06,933 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 36 treesize of output 49 [2025-02-08 07:41:06,967 INFO L134 CoverageAnalysis]: Checked inductivity of 382 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2025-02-08 07:41:06,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1154374949] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 07:41:06,968 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 07:41:06,968 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 7] total 20 [2025-02-08 07:41:06,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1950253680] [2025-02-08 07:41:06,968 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 07:41:06,969 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-02-08 07:41:06,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:41:06,969 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-02-08 07:41:06,970 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=312, Unknown=0, NotChecked=0, Total=420 [2025-02-08 07:41:06,970 INFO L87 Difference]: Start difference. First operand 279 states and 307 transitions. Second operand has 21 states, 20 states have (on average 3.9) internal successors, (78), 21 states have internal predecessors, (78), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 07:41:07,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:41:07,483 INFO L93 Difference]: Finished difference Result 342 states and 363 transitions. [2025-02-08 07:41:07,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-08 07:41:07,484 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 3.9) internal successors, (78), 21 states have internal predecessors, (78), 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 106 [2025-02-08 07:41:07,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:41:07,485 INFO L225 Difference]: With dead ends: 342 [2025-02-08 07:41:07,485 INFO L226 Difference]: Without dead ends: 342 [2025-02-08 07:41:07,485 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 224 GetRequests, 198 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 204 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=200, Invalid=502, Unknown=0, NotChecked=0, Total=702 [2025-02-08 07:41:07,486 INFO L435 NwaCegarLoop]: 86 mSDtfsCounter, 421 mSDsluCounter, 433 mSDsCounter, 0 mSdLazyCounter, 595 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 421 SdHoareTripleChecker+Valid, 519 SdHoareTripleChecker+Invalid, 620 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 595 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-08 07:41:07,486 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [421 Valid, 519 Invalid, 620 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 595 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-08 07:41:07,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2025-02-08 07:41:07,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 220. [2025-02-08 07:41:07,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 220 states, 175 states have (on average 1.3485714285714285) internal successors, (236), 217 states have internal predecessors, (236), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 07:41:07,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 238 transitions. [2025-02-08 07:41:07,494 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 238 transitions. Word has length 106 [2025-02-08 07:41:07,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:41:07,494 INFO L471 AbstractCegarLoop]: Abstraction has 220 states and 238 transitions. [2025-02-08 07:41:07,494 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 3.9) internal successors, (78), 21 states have internal predecessors, (78), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 07:41:07,494 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 238 transitions. [2025-02-08 07:41:07,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-02-08 07:41:07,495 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:41:07,495 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 07:41:07,508 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-02-08 07:41:07,699 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2025-02-08 07:41:07,700 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr48REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 93 more)] === [2025-02-08 07:41:07,700 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:41:07,700 INFO L85 PathProgramCache]: Analyzing trace with hash -496562367, now seen corresponding path program 1 times [2025-02-08 07:41:07,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:41:07,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1212592334] [2025-02-08 07:41:07,701 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:41:07,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:41:07,728 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-02-08 07:41:07,745 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-02-08 07:41:07,745 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:41:07,745 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:41:08,074 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 381 trivial. 0 not checked. [2025-02-08 07:41:08,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:41:08,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1212592334] [2025-02-08 07:41:08,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1212592334] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 07:41:08,075 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 07:41:08,075 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 07:41:08,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [502556821] [2025-02-08 07:41:08,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 07:41:08,075 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 07:41:08,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:41:08,076 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 07:41:08,076 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-08 07:41:08,076 INFO L87 Difference]: Start difference. First operand 220 states and 238 transitions. Second operand has 6 states, 5 states have (on average 7.0) internal successors, (35), 6 states have internal predecessors, (35), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 07:41:08,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:41:08,195 INFO L93 Difference]: Finished difference Result 232 states and 252 transitions. [2025-02-08 07:41:08,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 07:41:08,196 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 7.0) internal successors, (35), 6 states have internal predecessors, (35), 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 109 [2025-02-08 07:41:08,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:41:08,197 INFO L225 Difference]: With dead ends: 232 [2025-02-08 07:41:08,197 INFO L226 Difference]: Without dead ends: 232 [2025-02-08 07:41:08,197 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-02-08 07:41:08,197 INFO L435 NwaCegarLoop]: 124 mSDtfsCounter, 167 mSDsluCounter, 307 mSDsCounter, 0 mSdLazyCounter, 152 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 431 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 07:41:08,197 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [167 Valid, 431 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 152 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 07:41:08,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2025-02-08 07:41:08,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 219. [2025-02-08 07:41:08,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 175 states have (on average 1.3428571428571427) internal successors, (235), 216 states have internal predecessors, (235), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 07:41:08,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 237 transitions. [2025-02-08 07:41:08,200 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 237 transitions. Word has length 109 [2025-02-08 07:41:08,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:41:08,201 INFO L471 AbstractCegarLoop]: Abstraction has 219 states and 237 transitions. [2025-02-08 07:41:08,201 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 7.0) internal successors, (35), 6 states have internal predecessors, (35), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 07:41:08,201 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 237 transitions. [2025-02-08 07:41:08,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-02-08 07:41:08,201 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:41:08,201 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 07:41:08,202 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-02-08 07:41:08,202 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr83REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 93 more)] === [2025-02-08 07:41:08,202 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:41:08,202 INFO L85 PathProgramCache]: Analyzing trace with hash -468885342, now seen corresponding path program 1 times [2025-02-08 07:41:08,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:41:08,202 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [336966728] [2025-02-08 07:41:08,202 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:41:08,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:41:08,230 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-02-08 07:41:08,253 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-02-08 07:41:08,254 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:41:08,254 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:41:09,058 INFO L134 CoverageAnalysis]: Checked inductivity of 385 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2025-02-08 07:41:09,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:41:09,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [336966728] [2025-02-08 07:41:09,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [336966728] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 07:41:09,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1203154070] [2025-02-08 07:41:09,060 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:41:09,060 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 07:41:09,060 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 07:41:09,062 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 07:41:09,063 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-02-08 07:41:09,280 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-02-08 07:41:09,412 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-02-08 07:41:09,412 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:41:09,412 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:41:09,416 INFO L256 TraceCheckSpWp]: Trace formula consists of 1553 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-02-08 07:41:09,419 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 07:41:09,432 INFO L349 Elim1Store]: treesize reduction 21, result has 34.4 percent of original size [2025-02-08 07:41:09,432 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 23 [2025-02-08 07:41:09,446 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-02-08 07:41:09,452 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 5 [2025-02-08 07:41:09,565 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 07:41:09,576 INFO L349 Elim1Store]: treesize reduction 21, result has 30.0 percent of original size [2025-02-08 07:41:09,576 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 40 treesize of output 40 [2025-02-08 07:41:09,587 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-08 07:41:09,587 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-02-08 07:41:10,207 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 07:41:10,208 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 25 [2025-02-08 07:41:10,228 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-08 07:41:10,228 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-02-08 07:41:10,281 INFO L134 CoverageAnalysis]: Checked inductivity of 385 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2025-02-08 07:41:10,281 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 07:41:10,959 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 07:41:10,959 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 61 [2025-02-08 07:41:11,490 INFO L134 CoverageAnalysis]: Checked inductivity of 385 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2025-02-08 07:41:11,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1203154070] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 07:41:11,491 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 07:41:11,491 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 7] total 21 [2025-02-08 07:41:11,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1913984743] [2025-02-08 07:41:11,491 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 07:41:11,491 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-02-08 07:41:11,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:41:11,493 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-02-08 07:41:11,493 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=362, Unknown=0, NotChecked=0, Total=462 [2025-02-08 07:41:11,493 INFO L87 Difference]: Start difference. First operand 219 states and 237 transitions. Second operand has 22 states, 21 states have (on average 3.857142857142857) internal successors, (81), 22 states have internal predecessors, (81), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 07:41:12,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:41:12,565 INFO L93 Difference]: Finished difference Result 389 states and 418 transitions. [2025-02-08 07:41:12,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-08 07:41:12,565 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 3.857142857142857) internal successors, (81), 22 states have internal predecessors, (81), 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 109 [2025-02-08 07:41:12,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:41:12,566 INFO L225 Difference]: With dead ends: 389 [2025-02-08 07:41:12,566 INFO L226 Difference]: Without dead ends: 389 [2025-02-08 07:41:12,567 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 234 GetRequests, 204 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 185 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=220, Invalid=710, Unknown=0, NotChecked=0, Total=930 [2025-02-08 07:41:12,567 INFO L435 NwaCegarLoop]: 85 mSDtfsCounter, 418 mSDsluCounter, 667 mSDsCounter, 0 mSdLazyCounter, 989 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 418 SdHoareTripleChecker+Valid, 752 SdHoareTripleChecker+Invalid, 1012 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 989 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-08 07:41:12,567 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [418 Valid, 752 Invalid, 1012 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 989 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-08 07:41:12,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 389 states. [2025-02-08 07:41:12,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 389 to 214. [2025-02-08 07:41:12,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 214 states, 171 states have (on average 1.345029239766082) internal successors, (230), 211 states have internal predecessors, (230), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 07:41:12,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 232 transitions. [2025-02-08 07:41:12,572 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 232 transitions. Word has length 109 [2025-02-08 07:41:12,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:41:12,572 INFO L471 AbstractCegarLoop]: Abstraction has 214 states and 232 transitions. [2025-02-08 07:41:12,572 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 3.857142857142857) internal successors, (81), 22 states have internal predecessors, (81), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 07:41:12,572 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 232 transitions. [2025-02-08 07:41:12,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-02-08 07:41:12,573 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:41:12,573 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 07:41:12,585 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-02-08 07:41:12,777 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 07:41:12,777 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr45REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 93 more)] === [2025-02-08 07:41:12,777 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:41:12,777 INFO L85 PathProgramCache]: Analyzing trace with hash -1222010627, now seen corresponding path program 1 times [2025-02-08 07:41:12,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:41:12,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487945277] [2025-02-08 07:41:12,777 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:41:12,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:41:12,813 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-02-08 07:41:12,829 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-02-08 07:41:12,829 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:41:12,829 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:41:13,172 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 381 trivial. 0 not checked. [2025-02-08 07:41:13,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:41:13,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [487945277] [2025-02-08 07:41:13,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [487945277] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 07:41:13,173 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 07:41:13,173 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-08 07:41:13,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1858049370] [2025-02-08 07:41:13,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 07:41:13,174 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 07:41:13,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:41:13,175 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 07:41:13,175 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-08 07:41:13,176 INFO L87 Difference]: Start difference. First operand 214 states and 232 transitions. Second operand has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 7 states have internal predecessors, (38), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 07:41:13,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:41:13,280 INFO L93 Difference]: Finished difference Result 202 states and 218 transitions. [2025-02-08 07:41:13,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 07:41:13,281 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 7 states have internal predecessors, (38), 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 112 [2025-02-08 07:41:13,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:41:13,281 INFO L225 Difference]: With dead ends: 202 [2025-02-08 07:41:13,281 INFO L226 Difference]: Without dead ends: 202 [2025-02-08 07:41:13,282 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-02-08 07:41:13,282 INFO L435 NwaCegarLoop]: 128 mSDtfsCounter, 37 mSDsluCounter, 560 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 688 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 07:41:13,282 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 688 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 07:41:13,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2025-02-08 07:41:13,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 202. [2025-02-08 07:41:13,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 165 states have (on average 1.309090909090909) internal successors, (216), 199 states have internal predecessors, (216), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 07:41:13,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 218 transitions. [2025-02-08 07:41:13,289 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 218 transitions. Word has length 112 [2025-02-08 07:41:13,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:41:13,289 INFO L471 AbstractCegarLoop]: Abstraction has 202 states and 218 transitions. [2025-02-08 07:41:13,289 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 7 states have internal predecessors, (38), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 07:41:13,289 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 218 transitions. [2025-02-08 07:41:13,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-02-08 07:41:13,290 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:41:13,290 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 07:41:13,290 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-02-08 07:41:13,290 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr39REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 93 more)] === [2025-02-08 07:41:13,291 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:41:13,291 INFO L85 PathProgramCache]: Analyzing trace with hash -775206214, now seen corresponding path program 1 times [2025-02-08 07:41:13,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:41:13,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1679417182] [2025-02-08 07:41:13,291 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:41:13,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:41:13,320 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-02-08 07:41:13,332 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-02-08 07:41:13,332 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:41:13,332 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:41:13,451 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 381 trivial. 0 not checked. [2025-02-08 07:41:13,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:41:13,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1679417182] [2025-02-08 07:41:13,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1679417182] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 07:41:13,451 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 07:41:13,451 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 07:41:13,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [514495232] [2025-02-08 07:41:13,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 07:41:13,452 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 07:41:13,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:41:13,452 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 07:41:13,452 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 07:41:13,452 INFO L87 Difference]: Start difference. First operand 202 states and 218 transitions. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 07:41:13,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:41:13,457 INFO L93 Difference]: Finished difference Result 193 states and 206 transitions. [2025-02-08 07:41:13,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 07:41:13,457 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 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 115 [2025-02-08 07:41:13,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:41:13,458 INFO L225 Difference]: With dead ends: 193 [2025-02-08 07:41:13,458 INFO L226 Difference]: Without dead ends: 193 [2025-02-08 07:41:13,458 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 07:41:13,463 INFO L435 NwaCegarLoop]: 121 mSDtfsCounter, 0 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 239 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 07:41:13,463 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 239 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 07:41:13,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2025-02-08 07:41:13,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 193. [2025-02-08 07:41:13,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 160 states have (on average 1.275) internal successors, (204), 190 states have internal predecessors, (204), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 07:41:13,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 206 transitions. [2025-02-08 07:41:13,465 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 206 transitions. Word has length 115 [2025-02-08 07:41:13,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:41:13,466 INFO L471 AbstractCegarLoop]: Abstraction has 193 states and 206 transitions. [2025-02-08 07:41:13,466 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 07:41:13,466 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 206 transitions. [2025-02-08 07:41:13,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-02-08 07:41:13,466 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:41:13,466 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 07:41:13,466 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-02-08 07:41:13,466 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 93 more)] === [2025-02-08 07:41:13,467 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:41:13,467 INFO L85 PathProgramCache]: Analyzing trace with hash 1738428186, now seen corresponding path program 1 times [2025-02-08 07:41:13,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:41:13,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1755156920] [2025-02-08 07:41:13,467 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:41:13,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:41:13,496 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-02-08 07:41:13,509 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-02-08 07:41:13,509 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:41:13,509 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:41:13,655 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 381 trivial. 0 not checked. [2025-02-08 07:41:13,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:41:13,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1755156920] [2025-02-08 07:41:13,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1755156920] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 07:41:13,656 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 07:41:13,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 07:41:13,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [167813169] [2025-02-08 07:41:13,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 07:41:13,657 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 07:41:13,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:41:13,657 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 07:41:13,657 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 07:41:13,657 INFO L87 Difference]: Start difference. First operand 193 states and 206 transitions. Second operand has 3 states, 2 states have (on average 21.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 07:41:13,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:41:13,720 INFO L93 Difference]: Finished difference Result 193 states and 206 transitions. [2025-02-08 07:41:13,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 07:41:13,721 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 21.0) internal successors, (42), 3 states have internal predecessors, (42), 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 116 [2025-02-08 07:41:13,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:41:13,722 INFO L225 Difference]: With dead ends: 193 [2025-02-08 07:41:13,722 INFO L226 Difference]: Without dead ends: 193 [2025-02-08 07:41:13,722 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 07:41:13,722 INFO L435 NwaCegarLoop]: 119 mSDtfsCounter, 1 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 191 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 07:41:13,722 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 191 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 07:41:13,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2025-02-08 07:41:13,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 192. [2025-02-08 07:41:13,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 160 states have (on average 1.26875) internal successors, (203), 189 states have internal predecessors, (203), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 07:41:13,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 205 transitions. [2025-02-08 07:41:13,726 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 205 transitions. Word has length 116 [2025-02-08 07:41:13,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:41:13,726 INFO L471 AbstractCegarLoop]: Abstraction has 192 states and 205 transitions. [2025-02-08 07:41:13,726 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 21.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 07:41:13,726 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 205 transitions. [2025-02-08 07:41:13,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-02-08 07:41:13,727 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:41:13,727 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 07:41:13,727 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-02-08 07:41:13,727 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 93 more)] === [2025-02-08 07:41:13,727 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:41:13,728 INFO L85 PathProgramCache]: Analyzing trace with hash 1738428187, now seen corresponding path program 1 times [2025-02-08 07:41:13,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:41:13,728 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1177114099] [2025-02-08 07:41:13,728 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:41:13,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:41:13,776 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-02-08 07:41:13,801 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-02-08 07:41:13,802 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:41:13,802 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:41:13,994 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 381 trivial. 0 not checked. [2025-02-08 07:41:13,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:41:13,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1177114099] [2025-02-08 07:41:13,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1177114099] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 07:41:13,995 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 07:41:13,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 07:41:13,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [691660795] [2025-02-08 07:41:13,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 07:41:13,996 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 07:41:13,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:41:13,996 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 07:41:13,996 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 07:41:13,996 INFO L87 Difference]: Start difference. First operand 192 states and 205 transitions. Second operand has 3 states, 2 states have (on average 21.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 07:41:14,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:41:14,054 INFO L93 Difference]: Finished difference Result 191 states and 204 transitions. [2025-02-08 07:41:14,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 07:41:14,054 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 21.0) internal successors, (42), 3 states have internal predecessors, (42), 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 116 [2025-02-08 07:41:14,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:41:14,055 INFO L225 Difference]: With dead ends: 191 [2025-02-08 07:41:14,055 INFO L226 Difference]: Without dead ends: 191 [2025-02-08 07:41:14,055 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 07:41:14,055 INFO L435 NwaCegarLoop]: 119 mSDtfsCounter, 0 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 197 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 07:41:14,055 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 197 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 07:41:14,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2025-02-08 07:41:14,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 191. [2025-02-08 07:41:14,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 160 states have (on average 1.2625) internal successors, (202), 188 states have internal predecessors, (202), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 07:41:14,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 204 transitions. [2025-02-08 07:41:14,064 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 204 transitions. Word has length 116 [2025-02-08 07:41:14,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:41:14,064 INFO L471 AbstractCegarLoop]: Abstraction has 191 states and 204 transitions. [2025-02-08 07:41:14,064 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 21.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 07:41:14,064 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 204 transitions. [2025-02-08 07:41:14,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-02-08 07:41:14,065 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:41:14,065 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 07:41:14,065 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-02-08 07:41:14,065 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 93 more)] === [2025-02-08 07:41:14,066 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:41:14,066 INFO L85 PathProgramCache]: Analyzing trace with hash 794763668, now seen corresponding path program 1 times [2025-02-08 07:41:14,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:41:14,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1189101353] [2025-02-08 07:41:14,066 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:41:14,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:41:14,104 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-02-08 07:41:14,117 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-02-08 07:41:14,117 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:41:14,117 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:41:14,248 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 381 trivial. 0 not checked. [2025-02-08 07:41:14,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:41:14,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1189101353] [2025-02-08 07:41:14,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1189101353] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 07:41:14,248 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 07:41:14,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 07:41:14,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [306281757] [2025-02-08 07:41:14,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 07:41:14,249 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 07:41:14,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:41:14,249 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 07:41:14,249 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 07:41:14,249 INFO L87 Difference]: Start difference. First operand 191 states and 204 transitions. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 07:41:14,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:41:14,266 INFO L93 Difference]: Finished difference Result 194 states and 207 transitions. [2025-02-08 07:41:14,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 07:41:14,267 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 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 119 [2025-02-08 07:41:14,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:41:14,267 INFO L225 Difference]: With dead ends: 194 [2025-02-08 07:41:14,267 INFO L226 Difference]: Without dead ends: 194 [2025-02-08 07:41:14,268 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 07:41:14,268 INFO L435 NwaCegarLoop]: 117 mSDtfsCounter, 1 mSDsluCounter, 223 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 340 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 07:41:14,268 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 340 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 07:41:14,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2025-02-08 07:41:14,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 193. [2025-02-08 07:41:14,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 162 states have (on average 1.2592592592592593) internal successors, (204), 190 states have internal predecessors, (204), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 07:41:14,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 206 transitions. [2025-02-08 07:41:14,271 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 206 transitions. Word has length 119 [2025-02-08 07:41:14,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:41:14,271 INFO L471 AbstractCegarLoop]: Abstraction has 193 states and 206 transitions. [2025-02-08 07:41:14,271 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 07:41:14,271 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 206 transitions. [2025-02-08 07:41:14,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-02-08 07:41:14,272 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:41:14,272 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 07:41:14,272 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-02-08 07:41:14,272 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 93 more)] === [2025-02-08 07:41:14,272 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:41:14,272 INFO L85 PathProgramCache]: Analyzing trace with hash 794755722, now seen corresponding path program 1 times [2025-02-08 07:41:14,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:41:14,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2002578119] [2025-02-08 07:41:14,273 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:41:14,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:41:14,309 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-02-08 07:41:14,346 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-02-08 07:41:14,346 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:41:14,346 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:41:14,475 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 381 trivial. 0 not checked. [2025-02-08 07:41:14,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:41:14,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2002578119] [2025-02-08 07:41:14,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2002578119] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 07:41:14,475 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 07:41:14,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 07:41:14,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2123272414] [2025-02-08 07:41:14,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 07:41:14,476 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 07:41:14,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:41:14,477 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 07:41:14,477 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 07:41:14,477 INFO L87 Difference]: Start difference. First operand 193 states and 206 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 07:41:14,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:41:14,484 INFO L93 Difference]: Finished difference Result 194 states and 206 transitions. [2025-02-08 07:41:14,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 07:41:14,485 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 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 119 [2025-02-08 07:41:14,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:41:14,486 INFO L225 Difference]: With dead ends: 194 [2025-02-08 07:41:14,486 INFO L226 Difference]: Without dead ends: 191 [2025-02-08 07:41:14,487 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 07:41:14,487 INFO L435 NwaCegarLoop]: 120 mSDtfsCounter, 0 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 235 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 07:41:14,487 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 235 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 07:41:14,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2025-02-08 07:41:14,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 191. [2025-02-08 07:41:14,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 160 states have (on average 1.25) internal successors, (200), 188 states have internal predecessors, (200), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 07:41:14,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 202 transitions. [2025-02-08 07:41:14,490 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 202 transitions. Word has length 119 [2025-02-08 07:41:14,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:41:14,491 INFO L471 AbstractCegarLoop]: Abstraction has 191 states and 202 transitions. [2025-02-08 07:41:14,491 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 07:41:14,491 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 202 transitions. [2025-02-08 07:41:14,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2025-02-08 07:41:14,492 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:41:14,492 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 07:41:14,492 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-02-08 07:41:14,493 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 93 more)] === [2025-02-08 07:41:14,493 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:41:14,493 INFO L85 PathProgramCache]: Analyzing trace with hash -1015735467, now seen corresponding path program 1 times [2025-02-08 07:41:14,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:41:14,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1533757843] [2025-02-08 07:41:14,493 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:41:14,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:41:14,530 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-02-08 07:41:14,546 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-02-08 07:41:14,547 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:41:14,547 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:41:14,818 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 381 trivial. 0 not checked. [2025-02-08 07:41:14,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:41:14,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1533757843] [2025-02-08 07:41:14,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1533757843] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 07:41:14,818 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 07:41:14,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-08 07:41:14,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1745907009] [2025-02-08 07:41:14,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 07:41:14,819 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-08 07:41:14,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:41:14,819 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-08 07:41:14,820 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-02-08 07:41:14,820 INFO L87 Difference]: Start difference. First operand 191 states and 202 transitions. Second operand has 8 states, 8 states have (on average 5.75) internal successors, (46), 8 states have internal predecessors, (46), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 07:41:14,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:41:14,843 INFO L93 Difference]: Finished difference Result 187 states and 197 transitions. [2025-02-08 07:41:14,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 07:41:14,844 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.75) internal successors, (46), 8 states have internal predecessors, (46), 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 120 [2025-02-08 07:41:14,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:41:14,844 INFO L225 Difference]: With dead ends: 187 [2025-02-08 07:41:14,844 INFO L226 Difference]: Without dead ends: 187 [2025-02-08 07:41:14,845 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2025-02-08 07:41:14,845 INFO L435 NwaCegarLoop]: 107 mSDtfsCounter, 5 mSDsluCounter, 630 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 737 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 07:41:14,845 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 737 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 07:41:14,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2025-02-08 07:41:14,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 187. [2025-02-08 07:41:14,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 158 states have (on average 1.2341772151898733) internal successors, (195), 184 states have internal predecessors, (195), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 07:41:14,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 197 transitions. [2025-02-08 07:41:14,854 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 197 transitions. Word has length 120 [2025-02-08 07:41:14,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:41:14,855 INFO L471 AbstractCegarLoop]: Abstraction has 187 states and 197 transitions. [2025-02-08 07:41:14,855 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.75) internal successors, (46), 8 states have internal predecessors, (46), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 07:41:14,855 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 197 transitions. [2025-02-08 07:41:14,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-02-08 07:41:14,856 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:41:14,856 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 07:41:14,856 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-02-08 07:41:14,856 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 93 more)] === [2025-02-08 07:41:14,856 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:41:14,856 INFO L85 PathProgramCache]: Analyzing trace with hash -1164236914, now seen corresponding path program 1 times [2025-02-08 07:41:14,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:41:14,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1343708957] [2025-02-08 07:41:14,856 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:41:14,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:41:14,886 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-02-08 07:41:14,898 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-02-08 07:41:14,899 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:41:14,899 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:41:15,067 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 381 trivial. 0 not checked. [2025-02-08 07:41:15,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:41:15,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1343708957] [2025-02-08 07:41:15,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1343708957] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 07:41:15,068 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 07:41:15,068 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 07:41:15,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1671062130] [2025-02-08 07:41:15,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 07:41:15,068 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 07:41:15,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:41:15,069 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 07:41:15,069 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 07:41:15,069 INFO L87 Difference]: Start difference. First operand 187 states and 197 transitions. Second operand has 5 states, 4 states have (on average 12.0) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 07:41:15,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:41:15,164 INFO L93 Difference]: Finished difference Result 184 states and 194 transitions. [2025-02-08 07:41:15,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 07:41:15,165 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 12.0) internal successors, (48), 5 states have internal predecessors, (48), 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 122 [2025-02-08 07:41:15,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:41:15,165 INFO L225 Difference]: With dead ends: 184 [2025-02-08 07:41:15,165 INFO L226 Difference]: Without dead ends: 184 [2025-02-08 07:41:15,166 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 07:41:15,166 INFO L435 NwaCegarLoop]: 89 mSDtfsCounter, 27 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 252 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 07:41:15,166 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 252 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 07:41:15,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2025-02-08 07:41:15,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 184. [2025-02-08 07:41:15,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184 states, 158 states have (on average 1.2151898734177216) internal successors, (192), 181 states have internal predecessors, (192), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 07:41:15,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 194 transitions. [2025-02-08 07:41:15,169 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 194 transitions. Word has length 122 [2025-02-08 07:41:15,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:41:15,169 INFO L471 AbstractCegarLoop]: Abstraction has 184 states and 194 transitions. [2025-02-08 07:41:15,169 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 12.0) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 07:41:15,169 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 194 transitions. [2025-02-08 07:41:15,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-02-08 07:41:15,171 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:41:15,171 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 07:41:15,171 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2025-02-08 07:41:15,171 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 93 more)] === [2025-02-08 07:41:15,172 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:41:15,172 INFO L85 PathProgramCache]: Analyzing trace with hash -1731605899, now seen corresponding path program 1 times [2025-02-08 07:41:15,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:41:15,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1592180383] [2025-02-08 07:41:15,172 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:41:15,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:41:15,212 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-02-08 07:41:15,241 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-02-08 07:41:15,242 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:41:15,242 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:41:15,549 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2025-02-08 07:41:15,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:41:15,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1592180383] [2025-02-08 07:41:15,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1592180383] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 07:41:15,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [813477048] [2025-02-08 07:41:15,550 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:41:15,550 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 07:41:15,550 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 07:41:15,553 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 07:41:15,554 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-02-08 07:41:15,907 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-02-08 07:41:16,083 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-02-08 07:41:16,083 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:41:16,083 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:41:16,089 INFO L256 TraceCheckSpWp]: Trace formula consists of 1652 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-02-08 07:41:16,092 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 07:41:16,243 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2025-02-08 07:41:16,243 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 07:41:16,470 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2025-02-08 07:41:16,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [813477048] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 07:41:16,470 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 07:41:16,470 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2025-02-08 07:41:16,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [810335285] [2025-02-08 07:41:16,471 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 07:41:16,471 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-08 07:41:16,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:41:16,471 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-08 07:41:16,472 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2025-02-08 07:41:16,472 INFO L87 Difference]: Start difference. First operand 184 states and 194 transitions. Second operand has 10 states, 10 states have (on average 6.9) internal successors, (69), 10 states have internal predecessors, (69), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 07:41:16,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:41:16,538 INFO L93 Difference]: Finished difference Result 306 states and 318 transitions. [2025-02-08 07:41:16,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 07:41:16,538 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.9) internal successors, (69), 10 states have internal predecessors, (69), 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 123 [2025-02-08 07:41:16,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:41:16,539 INFO L225 Difference]: With dead ends: 306 [2025-02-08 07:41:16,539 INFO L226 Difference]: Without dead ends: 303 [2025-02-08 07:41:16,539 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 251 GetRequests, 241 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2025-02-08 07:41:16,540 INFO L435 NwaCegarLoop]: 102 mSDtfsCounter, 45 mSDsluCounter, 305 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 407 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 07:41:16,540 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 407 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 07:41:16,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2025-02-08 07:41:16,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 244. [2025-02-08 07:41:16,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 244 states, 218 states have (on average 1.1605504587155964) internal successors, (253), 241 states have internal predecessors, (253), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 07:41:16,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 255 transitions. [2025-02-08 07:41:16,543 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 255 transitions. Word has length 123 [2025-02-08 07:41:16,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:41:16,543 INFO L471 AbstractCegarLoop]: Abstraction has 244 states and 255 transitions. [2025-02-08 07:41:16,543 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.9) internal successors, (69), 10 states have internal predecessors, (69), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 07:41:16,543 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 255 transitions. [2025-02-08 07:41:16,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2025-02-08 07:41:16,544 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:41:16,544 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 20, 20, 10, 10, 10, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 07:41:16,554 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-02-08 07:41:16,745 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2025-02-08 07:41:16,745 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 93 more)] === [2025-02-08 07:41:16,746 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:41:16,746 INFO L85 PathProgramCache]: Analyzing trace with hash -1678073559, now seen corresponding path program 2 times [2025-02-08 07:41:16,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:41:16,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1359350066] [2025-02-08 07:41:16,746 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 07:41:16,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:41:16,786 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 183 statements into 2 equivalence classes. [2025-02-08 07:41:16,962 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 183 of 183 statements. [2025-02-08 07:41:16,963 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 07:41:16,963 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:41:17,839 INFO L134 CoverageAnalysis]: Checked inductivity of 1147 backedges. 0 proven. 532 refuted. 0 times theorem prover too weak. 615 trivial. 0 not checked. [2025-02-08 07:41:17,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:41:17,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1359350066] [2025-02-08 07:41:17,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1359350066] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 07:41:17,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2065752192] [2025-02-08 07:41:17,840 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 07:41:17,840 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 07:41:17,840 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 07:41:17,842 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 07:41:17,843 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-02-08 07:41:18,141 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 183 statements into 2 equivalence classes. [2025-02-08 07:41:18,334 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 183 of 183 statements. [2025-02-08 07:41:18,335 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 07:41:18,335 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:41:18,343 INFO L256 TraceCheckSpWp]: Trace formula consists of 2026 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-02-08 07:41:18,348 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 07:41:18,499 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-02-08 07:41:18,644 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 16 treesize of output 8 [2025-02-08 07:41:18,653 INFO L134 CoverageAnalysis]: Checked inductivity of 1147 backedges. 0 proven. 532 refuted. 0 times theorem prover too weak. 615 trivial. 0 not checked. [2025-02-08 07:41:18,654 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 07:41:18,745 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 17 treesize of output 15 [2025-02-08 07:41:18,746 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 22 treesize of output 18 [2025-02-08 07:41:18,838 INFO L134 CoverageAnalysis]: Checked inductivity of 1147 backedges. 0 proven. 532 refuted. 0 times theorem prover too weak. 615 trivial. 0 not checked. [2025-02-08 07:41:18,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2065752192] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 07:41:18,838 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 07:41:18,839 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 8] total 18 [2025-02-08 07:41:18,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1206108695] [2025-02-08 07:41:18,839 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 07:41:18,839 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-02-08 07:41:18,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:41:18,839 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-02-08 07:41:18,839 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=256, Unknown=0, NotChecked=0, Total=306 [2025-02-08 07:41:18,840 INFO L87 Difference]: Start difference. First operand 244 states and 255 transitions. Second operand has 18 states, 18 states have (on average 6.611111111111111) internal successors, (119), 18 states have internal predecessors, (119), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 07:41:18,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:41:18,999 INFO L93 Difference]: Finished difference Result 307 states and 319 transitions. [2025-02-08 07:41:18,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-08 07:41:19,000 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 6.611111111111111) internal successors, (119), 18 states have internal predecessors, (119), 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 183 [2025-02-08 07:41:19,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:41:19,001 INFO L225 Difference]: With dead ends: 307 [2025-02-08 07:41:19,001 INFO L226 Difference]: Without dead ends: 305 [2025-02-08 07:41:19,001 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 378 GetRequests, 360 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=314, Unknown=0, NotChecked=0, Total=380 [2025-02-08 07:41:19,001 INFO L435 NwaCegarLoop]: 108 mSDtfsCounter, 91 mSDsluCounter, 1017 mSDsCounter, 0 mSdLazyCounter, 239 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 1125 SdHoareTripleChecker+Invalid, 239 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 239 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 07:41:19,001 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 1125 Invalid, 239 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 239 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 07:41:19,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2025-02-08 07:41:19,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 304. [2025-02-08 07:41:19,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 304 states, 278 states have (on average 1.129496402877698) internal successors, (314), 301 states have internal predecessors, (314), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 07:41:19,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 316 transitions. [2025-02-08 07:41:19,005 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 316 transitions. Word has length 183 [2025-02-08 07:41:19,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:41:19,006 INFO L471 AbstractCegarLoop]: Abstraction has 304 states and 316 transitions. [2025-02-08 07:41:19,006 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 6.611111111111111) internal successors, (119), 18 states have internal predecessors, (119), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 07:41:19,006 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 316 transitions. [2025-02-08 07:41:19,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2025-02-08 07:41:19,007 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:41:19,007 INFO L218 NwaCegarLoop]: trace histogram [30, 30, 30, 30, 30, 10, 10, 10, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 07:41:19,018 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2025-02-08 07:41:19,208 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2025-02-08 07:41:19,208 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 93 more)] === [2025-02-08 07:41:19,208 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:41:19,208 INFO L85 PathProgramCache]: Analyzing trace with hash -1509207587, now seen corresponding path program 3 times [2025-02-08 07:41:19,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:41:19,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1568307556] [2025-02-08 07:41:19,208 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 07:41:19,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:41:19,270 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 243 statements into 14 equivalence classes. [2025-02-08 07:41:19,472 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 87 of 243 statements. [2025-02-08 07:41:19,473 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-02-08 07:41:19,473 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:41:21,055 INFO L134 CoverageAnalysis]: Checked inductivity of 2443 backedges. 1062 proven. 530 refuted. 0 times theorem prover too weak. 851 trivial. 0 not checked. [2025-02-08 07:41:21,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:41:21,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1568307556] [2025-02-08 07:41:21,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1568307556] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 07:41:21,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1494755736] [2025-02-08 07:41:21,055 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 07:41:21,056 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 07:41:21,056 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 07:41:21,060 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 07:41:21,061 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-02-08 07:41:21,409 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 243 statements into 14 equivalence classes. [2025-02-08 07:41:22,542 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 87 of 243 statements. [2025-02-08 07:41:22,543 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-02-08 07:41:22,543 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:41:22,550 INFO L256 TraceCheckSpWp]: Trace formula consists of 1470 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-02-08 07:41:22,555 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 07:41:22,643 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-02-08 07:41:22,824 INFO L349 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2025-02-08 07:41:22,825 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 14 [2025-02-08 07:41:22,931 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 16 treesize of output 8 [2025-02-08 07:41:22,961 INFO L134 CoverageAnalysis]: Checked inductivity of 2443 backedges. 0 proven. 1593 refuted. 0 times theorem prover too weak. 850 trivial. 0 not checked. [2025-02-08 07:41:22,961 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 07:41:23,388 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 24 treesize of output 22 [2025-02-08 07:41:23,392 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 110 treesize of output 102 [2025-02-08 07:41:23,456 INFO L134 CoverageAnalysis]: Checked inductivity of 2443 backedges. 0 proven. 1593 refuted. 0 times theorem prover too weak. 850 trivial. 0 not checked. [2025-02-08 07:41:23,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1494755736] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 07:41:23,456 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 07:41:23,456 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 12] total 25 [2025-02-08 07:41:23,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2036657360] [2025-02-08 07:41:23,456 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 07:41:23,456 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-02-08 07:41:23,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:41:23,457 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-02-08 07:41:23,457 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=525, Unknown=0, NotChecked=0, Total=600 [2025-02-08 07:41:23,458 INFO L87 Difference]: Start difference. First operand 304 states and 316 transitions. Second operand has 25 states, 25 states have (on average 6.04) internal successors, (151), 25 states have internal predecessors, (151), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 07:41:23,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:41:23,862 INFO L93 Difference]: Finished difference Result 228 states and 232 transitions. [2025-02-08 07:41:23,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-02-08 07:41:23,862 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 6.04) internal successors, (151), 25 states have internal predecessors, (151), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 243 [2025-02-08 07:41:23,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:41:23,863 INFO L225 Difference]: With dead ends: 228 [2025-02-08 07:41:23,863 INFO L226 Difference]: Without dead ends: 0 [2025-02-08 07:41:23,863 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 511 GetRequests, 477 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 235 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=208, Invalid=1052, Unknown=0, NotChecked=0, Total=1260 [2025-02-08 07:41:23,863 INFO L435 NwaCegarLoop]: 39 mSDtfsCounter, 49 mSDsluCounter, 417 mSDsCounter, 0 mSdLazyCounter, 342 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 456 SdHoareTripleChecker+Invalid, 358 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 342 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 07:41:23,864 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 456 Invalid, 358 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 342 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 07:41:23,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-02-08 07:41:23,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-02-08 07:41:23,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 07:41:23,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-02-08 07:41:23,864 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 243 [2025-02-08 07:41:23,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:41:23,864 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-08 07:41:23,865 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 6.04) internal successors, (151), 25 states have internal predecessors, (151), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 07:41:23,865 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-02-08 07:41:23,865 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-02-08 07:41:23,867 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (95 of 96 remaining) [2025-02-08 07:41:23,867 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (94 of 96 remaining) [2025-02-08 07:41:23,868 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (93 of 96 remaining) [2025-02-08 07:41:23,868 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_FREE (92 of 96 remaining) [2025-02-08 07:41:23,868 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_FREE (91 of 96 remaining) [2025-02-08 07:41:23,868 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_FREE (90 of 96 remaining) [2025-02-08 07:41:23,868 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_FREE (89 of 96 remaining) [2025-02-08 07:41:23,868 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_FREE (88 of 96 remaining) [2025-02-08 07:41:23,868 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_FREE (87 of 96 remaining) [2025-02-08 07:41:23,868 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_FREE (86 of 96 remaining) [2025-02-08 07:41:23,868 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE (85 of 96 remaining) [2025-02-08 07:41:23,868 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE (84 of 96 remaining) [2025-02-08 07:41:23,868 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE (83 of 96 remaining) [2025-02-08 07:41:23,868 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (82 of 96 remaining) [2025-02-08 07:41:23,868 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (81 of 96 remaining) [2025-02-08 07:41:23,868 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (80 of 96 remaining) [2025-02-08 07:41:23,868 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (79 of 96 remaining) [2025-02-08 07:41:23,868 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (78 of 96 remaining) [2025-02-08 07:41:23,868 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (77 of 96 remaining) [2025-02-08 07:41:23,868 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE (76 of 96 remaining) [2025-02-08 07:41:23,868 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE (75 of 96 remaining) [2025-02-08 07:41:23,868 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (74 of 96 remaining) [2025-02-08 07:41:23,868 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (73 of 96 remaining) [2025-02-08 07:41:23,868 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE (72 of 96 remaining) [2025-02-08 07:41:23,868 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE (71 of 96 remaining) [2025-02-08 07:41:23,868 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE (70 of 96 remaining) [2025-02-08 07:41:23,868 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_DEREFERENCE (69 of 96 remaining) [2025-02-08 07:41:23,868 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE (68 of 96 remaining) [2025-02-08 07:41:23,868 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE (67 of 96 remaining) [2025-02-08 07:41:23,869 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE (66 of 96 remaining) [2025-02-08 07:41:23,869 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE (65 of 96 remaining) [2025-02-08 07:41:23,869 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_DEREFERENCE (64 of 96 remaining) [2025-02-08 07:41:23,869 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_DEREFERENCE (63 of 96 remaining) [2025-02-08 07:41:23,869 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE (62 of 96 remaining) [2025-02-08 07:41:23,869 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE (61 of 96 remaining) [2025-02-08 07:41:23,869 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE (60 of 96 remaining) [2025-02-08 07:41:23,869 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE (59 of 96 remaining) [2025-02-08 07:41:23,869 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr37REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 96 remaining) [2025-02-08 07:41:23,869 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 96 remaining) [2025-02-08 07:41:23,869 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr39REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 96 remaining) [2025-02-08 07:41:23,870 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 96 remaining) [2025-02-08 07:41:23,870 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr41REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 96 remaining) [2025-02-08 07:41:23,870 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 96 remaining) [2025-02-08 07:41:23,870 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_DEREFERENCE (52 of 96 remaining) [2025-02-08 07:41:23,870 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_DEREFERENCE (51 of 96 remaining) [2025-02-08 07:41:23,870 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr45REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 96 remaining) [2025-02-08 07:41:23,870 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr46REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 96 remaining) [2025-02-08 07:41:23,870 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr47REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 96 remaining) [2025-02-08 07:41:23,870 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr48REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 96 remaining) [2025-02-08 07:41:23,870 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_LEAK (46 of 96 remaining) [2025-02-08 07:41:23,870 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr50REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 96 remaining) [2025-02-08 07:41:23,870 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr51REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 96 remaining) [2025-02-08 07:41:23,870 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr52REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 96 remaining) [2025-02-08 07:41:23,870 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr53REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 96 remaining) [2025-02-08 07:41:23,870 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr54REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 96 remaining) [2025-02-08 07:41:23,870 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr55REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 96 remaining) [2025-02-08 07:41:23,870 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr56REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 96 remaining) [2025-02-08 07:41:23,870 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr57REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 96 remaining) [2025-02-08 07:41:23,870 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr58REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 96 remaining) [2025-02-08 07:41:23,870 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr59REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 96 remaining) [2025-02-08 07:41:23,870 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr60REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 96 remaining) [2025-02-08 07:41:23,870 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr61REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 96 remaining) [2025-02-08 07:41:23,870 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr62REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 96 remaining) [2025-02-08 07:41:23,870 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr63REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 96 remaining) [2025-02-08 07:41:23,870 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr64ASSERT_VIOLATIONMEMORY_DEREFERENCE (31 of 96 remaining) [2025-02-08 07:41:23,870 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr65ASSERT_VIOLATIONMEMORY_DEREFERENCE (30 of 96 remaining) [2025-02-08 07:41:23,870 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr66ASSERT_VIOLATIONMEMORY_DEREFERENCE (29 of 96 remaining) [2025-02-08 07:41:23,870 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr67ASSERT_VIOLATIONMEMORY_DEREFERENCE (28 of 96 remaining) [2025-02-08 07:41:23,870 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr68REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 96 remaining) [2025-02-08 07:41:23,870 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr69REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 96 remaining) [2025-02-08 07:41:23,870 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr70ASSERT_VIOLATIONMEMORY_DEREFERENCE (25 of 96 remaining) [2025-02-08 07:41:23,870 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr71ASSERT_VIOLATIONMEMORY_DEREFERENCE (24 of 96 remaining) [2025-02-08 07:41:23,871 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr72REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 96 remaining) [2025-02-08 07:41:23,871 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr73REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 96 remaining) [2025-02-08 07:41:23,871 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr74REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 96 remaining) [2025-02-08 07:41:23,871 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr75REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 96 remaining) [2025-02-08 07:41:23,871 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr76REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 96 remaining) [2025-02-08 07:41:23,871 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr77REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 96 remaining) [2025-02-08 07:41:23,871 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr78REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 96 remaining) [2025-02-08 07:41:23,871 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr79REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 96 remaining) [2025-02-08 07:41:23,871 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 96 remaining) [2025-02-08 07:41:23,871 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr81REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 96 remaining) [2025-02-08 07:41:23,871 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr82REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 96 remaining) [2025-02-08 07:41:23,871 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr83REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 96 remaining) [2025-02-08 07:41:23,871 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr84REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 96 remaining) [2025-02-08 07:41:23,871 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr85REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 96 remaining) [2025-02-08 07:41:23,871 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr86REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 96 remaining) [2025-02-08 07:41:23,871 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr87REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 96 remaining) [2025-02-08 07:41:23,871 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr88REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 96 remaining) [2025-02-08 07:41:23,871 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr89REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 96 remaining) [2025-02-08 07:41:23,872 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr90REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 96 remaining) [2025-02-08 07:41:23,872 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr91REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 96 remaining) [2025-02-08 07:41:23,872 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr92REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 96 remaining) [2025-02-08 07:41:23,872 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr93REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 96 remaining) [2025-02-08 07:41:23,872 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr94REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 96 remaining) [2025-02-08 07:41:23,872 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr95REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 96 remaining) [2025-02-08 07:41:23,885 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2025-02-08 07:41:24,076 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2025-02-08 07:41:24,079 INFO L422 BasicCegarLoop]: Path program histogram: [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 07:41:24,080 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-08 07:41:24,082 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.02 07:41:24 BoogieIcfgContainer [2025-02-08 07:41:24,083 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-08 07:41:24,083 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-08 07:41:24,083 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-08 07:41:24,083 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-08 07:41:24,084 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 07:40:46" (3/4) ... [2025-02-08 07:41:24,085 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-02-08 07:41:24,090 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2025-02-08 07:41:24,106 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 41 nodes and edges [2025-02-08 07:41:24,110 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 17 nodes and edges [2025-02-08 07:41:24,110 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2025-02-08 07:41:24,111 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2025-02-08 07:41:24,112 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-02-08 07:41:24,112 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-02-08 07:41:24,223 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-08 07:41:24,223 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-08 07:41:24,223 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-08 07:41:24,224 INFO L158 Benchmark]: Toolchain (without parser) took 39096.99ms. Allocated memory was 167.8MB in the beginning and 889.2MB in the end (delta: 721.4MB). Free memory was 130.8MB in the beginning and 544.4MB in the end (delta: -413.7MB). Peak memory consumption was 309.2MB. Max. memory is 16.1GB. [2025-02-08 07:41:24,225 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 201.3MB. Free memory is still 129.0MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 07:41:24,226 INFO L158 Benchmark]: CACSL2BoogieTranslator took 580.51ms. Allocated memory is still 167.8MB. Free memory was 130.3MB in the beginning and 84.6MB in the end (delta: 45.7MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. [2025-02-08 07:41:24,226 INFO L158 Benchmark]: Boogie Procedure Inliner took 83.48ms. Allocated memory is still 167.8MB. Free memory was 84.6MB in the beginning and 77.7MB in the end (delta: 6.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 07:41:24,226 INFO L158 Benchmark]: Boogie Preprocessor took 106.76ms. Allocated memory is still 167.8MB. Free memory was 77.7MB in the beginning and 67.8MB in the end (delta: 9.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-08 07:41:24,226 INFO L158 Benchmark]: IcfgBuilder took 873.79ms. Allocated memory is still 167.8MB. Free memory was 67.8MB in the beginning and 67.6MB in the end (delta: 189.0kB). Peak memory consumption was 38.4MB. Max. memory is 16.1GB. [2025-02-08 07:41:24,226 INFO L158 Benchmark]: TraceAbstraction took 37304.78ms. Allocated memory was 167.8MB in the beginning and 889.2MB in the end (delta: 721.4MB). Free memory was 66.7MB in the beginning and 557.8MB in the end (delta: -491.1MB). Peak memory consumption was 228.8MB. Max. memory is 16.1GB. [2025-02-08 07:41:24,226 INFO L158 Benchmark]: Witness Printer took 140.49ms. Allocated memory is still 889.2MB. Free memory was 557.8MB in the beginning and 544.4MB in the end (delta: 13.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-08 07:41:24,227 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22ms. Allocated memory is still 201.3MB. Free memory is still 129.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 580.51ms. Allocated memory is still 167.8MB. Free memory was 130.3MB in the beginning and 84.6MB in the end (delta: 45.7MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 83.48ms. Allocated memory is still 167.8MB. Free memory was 84.6MB in the beginning and 77.7MB in the end (delta: 6.9MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 106.76ms. Allocated memory is still 167.8MB. Free memory was 77.7MB in the beginning and 67.8MB in the end (delta: 9.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * IcfgBuilder took 873.79ms. Allocated memory is still 167.8MB. Free memory was 67.8MB in the beginning and 67.6MB in the end (delta: 189.0kB). Peak memory consumption was 38.4MB. Max. memory is 16.1GB. * TraceAbstraction took 37304.78ms. Allocated memory was 167.8MB in the beginning and 889.2MB in the end (delta: 721.4MB). Free memory was 66.7MB in the beginning and 557.8MB in the end (delta: -491.1MB). Peak memory consumption was 228.8MB. Max. memory is 16.1GB. * Witness Printer took 140.49ms. Allocated memory is still 889.2MB. Free memory was 557.8MB in the beginning and 544.4MB in the end (delta: 13.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 1573]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 1600]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 1600]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 1600]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 1599]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 1599]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 1599]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 1598]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 1598]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 1598]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 1597]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 1597]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 1597]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1408]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1408]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1408]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1408]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1402]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1402]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1397]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1397]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1488]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1488]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 22]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1383]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1383]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1383]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1383]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1342]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1342]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 233 locations, 96 error locations. Started 1 CEGAR loops. OverallTime: 37.3s, OverallIterations: 39, TraceHistogramMax: 30, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 7.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3881 SdHoareTripleChecker+Valid, 5.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3874 mSDsluCounter, 18250 SdHoareTripleChecker+Invalid, 4.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 13338 mSDsCounter, 139 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 7160 IncrementalHoareTripleChecker+Invalid, 7299 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 139 mSolverCounterUnsat, 4912 mSDtfsCounter, 7160 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2430 GetRequests, 2136 SyntacticMatches, 3 SemanticMatches, 291 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 1139 ImplicationChecksByTransitivity, 3.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=304occurred in iteration=38, InterpolantAutomatonStates: 246, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 39 MinimizatonAttempts, 611 StatesRemovedByMinimization, 23 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.6s SsaConstructionTime, 3.9s SatisfiabilityAnalysisTime, 19.5s InterpolantComputationTime, 3974 NumberOfCodeBlocks, 3466 NumberOfCodeBlocksAsserted, 63 NumberOfCheckSat, 5013 ConstructedInterpolants, 184 QuantifiedInterpolants, 38020 SizeOfPredicates, 60 NumberOfNonLiveVariables, 15869 ConjunctsInSsa, 187 ConjunctsInUnsatCore, 63 InterpolantComputations, 27 PerfectInterpolantSequences, 16827/22433 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 96 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-02-08 07:41:24,248 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE