./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/list-simple/sll2n_remove_all.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/list-simple/sll2n_remove_all.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-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 32bit --witnessprinter.graph.data.programhash bae9bfc842bb010963d083e19e9498cfd3af182f91f0b8fa56907786a4d462dd --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 22:44:02,813 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 22:44:02,873 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-01-09 22:44:02,878 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 22:44:02,878 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 22:44:02,899 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 22:44:02,900 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 22:44:02,900 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 22:44:02,900 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 22:44:02,900 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 22:44:02,901 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 22:44:02,901 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 22:44:02,902 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 22:44:02,902 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 22:44:02,902 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 22:44:02,902 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 22:44:02,902 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 22:44:02,902 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 22:44:02,903 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 22:44:02,903 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 22:44:02,903 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-01-09 22:44:02,903 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-01-09 22:44:02,903 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-01-09 22:44:02,903 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 22:44:02,903 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-09 22:44:02,903 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-09 22:44:02,903 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 22:44:02,903 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 22:44:02,903 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 22:44:02,903 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 22:44:02,904 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 22:44:02,904 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 22:44:02,904 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 22:44:02,904 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 22:44:02,904 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 22:44:02,904 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 22:44:02,904 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 22:44:02,904 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 22:44:02,904 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 22:44:02,905 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 22:44:02,905 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 22:44:02,905 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 22:44:02,905 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 22:44:02,905 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 22:44:02,905 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 22:44:02,905 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 22:44:02,905 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 22:44:02,905 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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> bae9bfc842bb010963d083e19e9498cfd3af182f91f0b8fa56907786a4d462dd [2025-01-09 22:44:03,113 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 22:44:03,122 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 22:44:03,123 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 22:44:03,125 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 22:44:03,125 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 22:44:03,126 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-simple/sll2n_remove_all.i [2025-01-09 22:44:04,233 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/59222a861/7df62ddfa358482ab86c5e61d3095496/FLAGf9ad1bd98 [2025-01-09 22:44:04,462 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 22:44:04,463 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/list-simple/sll2n_remove_all.i [2025-01-09 22:44:04,469 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/59222a861/7df62ddfa358482ab86c5e61d3095496/FLAGf9ad1bd98 [2025-01-09 22:44:04,803 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/59222a861/7df62ddfa358482ab86c5e61d3095496 [2025-01-09 22:44:04,805 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 22:44:04,806 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 22:44:04,806 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 22:44:04,806 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 22:44:04,810 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 22:44:04,810 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 10:44:04" (1/1) ... [2025-01-09 22:44:04,811 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@48c12871 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:44:04, skipping insertion in model container [2025-01-09 22:44:04,811 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 10:44:04" (1/1) ... [2025-01-09 22:44:04,828 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 22:44:04,999 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 22:44:05,005 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 22:44:05,031 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 22:44:05,047 INFO L204 MainTranslator]: Completed translation [2025-01-09 22:44:05,049 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:44:05 WrapperNode [2025-01-09 22:44:05,049 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 22:44:05,050 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 22:44:05,050 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 22:44:05,050 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 22:44:05,054 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:44:05" (1/1) ... [2025-01-09 22:44:05,062 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:44:05" (1/1) ... [2025-01-09 22:44:05,077 INFO L138 Inliner]: procedures = 126, calls = 26, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 82 [2025-01-09 22:44:05,078 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 22:44:05,078 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 22:44:05,078 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 22:44:05,078 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 22:44:05,083 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:44:05" (1/1) ... [2025-01-09 22:44:05,084 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:44:05" (1/1) ... [2025-01-09 22:44:05,087 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:44:05" (1/1) ... [2025-01-09 22:44:05,104 INFO L175 MemorySlicer]: Split 11 memory accesses to 3 slices as follows [2, 5, 4]. 45 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 1, 0]. The 4 writes are split as follows [0, 1, 3]. [2025-01-09 22:44:05,104 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:44:05" (1/1) ... [2025-01-09 22:44:05,104 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:44:05" (1/1) ... [2025-01-09 22:44:05,108 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:44:05" (1/1) ... [2025-01-09 22:44:05,109 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:44:05" (1/1) ... [2025-01-09 22:44:05,113 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:44:05" (1/1) ... [2025-01-09 22:44:05,114 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:44:05" (1/1) ... [2025-01-09 22:44:05,114 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:44:05" (1/1) ... [2025-01-09 22:44:05,117 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 22:44:05,117 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 22:44:05,117 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 22:44:05,118 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 22:44:05,118 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:44:05" (1/1) ... [2025-01-09 22:44:05,124 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 22:44:05,132 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:44:05,141 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 22:44:05,143 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 22:44:05,158 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-09 22:44:05,158 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-09 22:44:05,159 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-01-09 22:44:05,159 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-09 22:44:05,159 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 22:44:05,159 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-01-09 22:44:05,159 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-01-09 22:44:05,159 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-01-09 22:44:05,159 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-01-09 22:44:05,159 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-01-09 22:44:05,159 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-01-09 22:44:05,159 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-01-09 22:44:05,159 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-09 22:44:05,159 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-01-09 22:44:05,159 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-01-09 22:44:05,159 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-01-09 22:44:05,159 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 22:44:05,159 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-09 22:44:05,159 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-09 22:44:05,159 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 22:44:05,159 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 22:44:05,237 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 22:44:05,238 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 22:44:05,397 INFO L? ?]: Removed 63 outVars from TransFormulas that were not future-live. [2025-01-09 22:44:05,397 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 22:44:05,405 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 22:44:05,406 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-09 22:44:05,406 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 10:44:05 BoogieIcfgContainer [2025-01-09 22:44:05,406 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 22:44:05,408 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 22:44:05,408 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 22:44:05,411 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 22:44:05,411 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 10:44:04" (1/3) ... [2025-01-09 22:44:05,416 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4dc37a4f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 10:44:05, skipping insertion in model container [2025-01-09 22:44:05,416 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:44:05" (2/3) ... [2025-01-09 22:44:05,417 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4dc37a4f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 10:44:05, skipping insertion in model container [2025-01-09 22:44:05,417 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 10:44:05" (3/3) ... [2025-01-09 22:44:05,418 INFO L128 eAbstractionObserver]: Analyzing ICFG sll2n_remove_all.i [2025-01-09 22:44:05,431 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 22:44:05,432 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG sll2n_remove_all.i that has 1 procedures, 52 locations, 1 initial locations, 2 loop locations, and 21 error locations. [2025-01-09 22:44:05,460 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 22:44:05,477 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;@7b0841cb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 22:44:05,478 INFO L334 AbstractCegarLoop]: Starting to check reachability of 21 error locations. [2025-01-09 22:44:05,480 INFO L276 IsEmpty]: Start isEmpty. Operand has 52 states, 30 states have (on average 1.8666666666666667) internal successors, (56), 51 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:44:05,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-01-09 22:44:05,484 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:44:05,484 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-01-09 22:44:05,484 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2025-01-09 22:44:05,488 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:44:05,489 INFO L85 PathProgramCache]: Analyzing trace with hash 28694887, now seen corresponding path program 1 times [2025-01-09 22:44:05,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:44:05,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1491387722] [2025-01-09 22:44:05,495 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:44:05,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:44:05,555 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-09 22:44:05,576 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-09 22:44:05,576 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:44:05,577 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:44:05,735 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:44:05,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:44:05,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1491387722] [2025-01-09 22:44:05,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1491387722] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:44:05,736 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:44:05,736 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 22:44:05,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [303751676] [2025-01-09 22:44:05,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:44:05,739 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 22:44:05,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:44:05,754 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 22:44:05,755 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:44:05,756 INFO L87 Difference]: Start difference. First operand has 52 states, 30 states have (on average 1.8666666666666667) internal successors, (56), 51 states have internal predecessors, (56), 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) Second operand has 3 states, 2 states have (on average 2.5) 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-01-09 22:44:05,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:44:05,807 INFO L93 Difference]: Finished difference Result 49 states and 51 transitions. [2025-01-09 22:44:05,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 22:44:05,811 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) 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-01-09 22:44:05,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:44:05,815 INFO L225 Difference]: With dead ends: 49 [2025-01-09 22:44:05,815 INFO L226 Difference]: Without dead ends: 46 [2025-01-09 22:44:05,816 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:44:05,818 INFO L435 NwaCegarLoop]: 44 mSDtfsCounter, 2 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 22:44:05,818 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 72 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:44:05,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2025-01-09 22:44:05,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2025-01-09 22:44:05,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 27 states have (on average 1.7407407407407407) internal successors, (47), 45 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:44:05,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 47 transitions. [2025-01-09 22:44:05,841 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 47 transitions. Word has length 5 [2025-01-09 22:44:05,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:44:05,841 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 47 transitions. [2025-01-09 22:44:05,841 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) 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-01-09 22:44:05,842 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 47 transitions. [2025-01-09 22:44:05,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-01-09 22:44:05,842 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:44:05,842 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-01-09 22:44:05,842 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 22:44:05,842 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2025-01-09 22:44:05,842 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:44:05,842 INFO L85 PathProgramCache]: Analyzing trace with hash 28694886, now seen corresponding path program 1 times [2025-01-09 22:44:05,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:44:05,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [776191882] [2025-01-09 22:44:05,843 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:44:05,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:44:05,849 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-09 22:44:05,852 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-09 22:44:05,853 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:44:05,853 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:44:05,892 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:44:05,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:44:05,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [776191882] [2025-01-09 22:44:05,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [776191882] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:44:05,892 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:44:05,892 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 22:44:05,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [443174104] [2025-01-09 22:44:05,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:44:05,893 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 22:44:05,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:44:05,893 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 22:44:05,893 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:44:05,893 INFO L87 Difference]: Start difference. First operand 46 states and 47 transitions. Second operand has 3 states, 2 states have (on average 2.5) 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-01-09 22:44:05,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:44:05,928 INFO L93 Difference]: Finished difference Result 44 states and 45 transitions. [2025-01-09 22:44:05,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 22:44:05,929 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) 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-01-09 22:44:05,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:44:05,929 INFO L225 Difference]: With dead ends: 44 [2025-01-09 22:44:05,930 INFO L226 Difference]: Without dead ends: 44 [2025-01-09 22:44:05,930 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:44:05,930 INFO L435 NwaCegarLoop]: 41 mSDtfsCounter, 2 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 22:44:05,931 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 62 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:44:05,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2025-01-09 22:44:05,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2025-01-09 22:44:05,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 27 states have (on average 1.6666666666666667) internal successors, (45), 43 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:44:05,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 45 transitions. [2025-01-09 22:44:05,936 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 45 transitions. Word has length 5 [2025-01-09 22:44:05,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:44:05,936 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 45 transitions. [2025-01-09 22:44:05,936 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) 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-01-09 22:44:05,936 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 45 transitions. [2025-01-09 22:44:05,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-01-09 22:44:05,936 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:44:05,936 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-01-09 22:44:05,936 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 22:44:05,949 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2025-01-09 22:44:05,949 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:44:05,949 INFO L85 PathProgramCache]: Analyzing trace with hash 890214791, now seen corresponding path program 1 times [2025-01-09 22:44:05,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:44:05,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [950715499] [2025-01-09 22:44:05,949 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:44:05,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:44:05,958 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-09 22:44:05,961 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-09 22:44:05,963 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:44:05,963 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:44:06,003 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:44:06,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:44:06,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [950715499] [2025-01-09 22:44:06,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [950715499] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:44:06,004 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:44:06,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 22:44:06,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1672135632] [2025-01-09 22:44:06,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:44:06,004 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 22:44:06,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:44:06,005 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 22:44:06,006 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:44:06,006 INFO L87 Difference]: Start difference. First operand 44 states and 45 transitions. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:44:06,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:44:06,017 INFO L93 Difference]: Finished difference Result 54 states and 55 transitions. [2025-01-09 22:44:06,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 22:44:06,017 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2025-01-09 22:44:06,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:44:06,018 INFO L225 Difference]: With dead ends: 54 [2025-01-09 22:44:06,019 INFO L226 Difference]: Without dead ends: 54 [2025-01-09 22:44:06,019 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-01-09 22:44:06,020 INFO L435 NwaCegarLoop]: 43 mSDtfsCounter, 9 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 22:44:06,020 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 83 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:44:06,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2025-01-09 22:44:06,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 45. [2025-01-09 22:44:06,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 28 states have (on average 1.6428571428571428) internal successors, (46), 44 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:44:06,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 46 transitions. [2025-01-09 22:44:06,026 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 46 transitions. Word has length 6 [2025-01-09 22:44:06,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:44:06,026 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 46 transitions. [2025-01-09 22:44:06,027 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:44:06,027 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 46 transitions. [2025-01-09 22:44:06,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-01-09 22:44:06,027 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:44:06,027 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:44:06,027 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 22:44:06,027 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2025-01-09 22:44:06,027 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:44:06,028 INFO L85 PathProgramCache]: Analyzing trace with hash 381200138, now seen corresponding path program 1 times [2025-01-09 22:44:06,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:44:06,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1088708645] [2025-01-09 22:44:06,028 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:44:06,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:44:06,041 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-09 22:44:06,049 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-09 22:44:06,051 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:44:06,051 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:44:06,125 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:44:06,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:44:06,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1088708645] [2025-01-09 22:44:06,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1088708645] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:44:06,126 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:44:06,126 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 22:44:06,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [513687340] [2025-01-09 22:44:06,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:44:06,126 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 22:44:06,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:44:06,126 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 22:44:06,127 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 22:44:06,127 INFO L87 Difference]: Start difference. First operand 45 states and 46 transitions. Second operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:44:06,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:44:06,183 INFO L93 Difference]: Finished difference Result 44 states and 45 transitions. [2025-01-09 22:44:06,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 22:44:06,183 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2025-01-09 22:44:06,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:44:06,184 INFO L225 Difference]: With dead ends: 44 [2025-01-09 22:44:06,184 INFO L226 Difference]: Without dead ends: 44 [2025-01-09 22:44:06,184 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-01-09 22:44:06,185 INFO L435 NwaCegarLoop]: 36 mSDtfsCounter, 2 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:44:06,185 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 92 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:44:06,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2025-01-09 22:44:06,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2025-01-09 22:44:06,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 28 states have (on average 1.6071428571428572) internal successors, (45), 43 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:44:06,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 45 transitions. [2025-01-09 22:44:06,187 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 45 transitions. Word has length 9 [2025-01-09 22:44:06,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:44:06,187 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 45 transitions. [2025-01-09 22:44:06,187 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:44:06,187 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 45 transitions. [2025-01-09 22:44:06,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-01-09 22:44:06,187 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:44:06,187 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:44:06,188 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 22:44:06,188 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2025-01-09 22:44:06,188 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:44:06,188 INFO L85 PathProgramCache]: Analyzing trace with hash 381200139, now seen corresponding path program 1 times [2025-01-09 22:44:06,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:44:06,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [346703015] [2025-01-09 22:44:06,188 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:44:06,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:44:06,195 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-09 22:44:06,198 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-09 22:44:06,198 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:44:06,198 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:44:06,308 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:44:06,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:44:06,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [346703015] [2025-01-09 22:44:06,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [346703015] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:44:06,308 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:44:06,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 22:44:06,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [919933131] [2025-01-09 22:44:06,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:44:06,309 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 22:44:06,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:44:06,310 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 22:44:06,310 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 22:44:06,310 INFO L87 Difference]: Start difference. First operand 44 states and 45 transitions. Second operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:44:06,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:44:06,361 INFO L93 Difference]: Finished difference Result 43 states and 44 transitions. [2025-01-09 22:44:06,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 22:44:06,361 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2025-01-09 22:44:06,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:44:06,361 INFO L225 Difference]: With dead ends: 43 [2025-01-09 22:44:06,361 INFO L226 Difference]: Without dead ends: 43 [2025-01-09 22:44:06,362 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-01-09 22:44:06,362 INFO L435 NwaCegarLoop]: 36 mSDtfsCounter, 1 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 22:44:06,363 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 104 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:44:06,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2025-01-09 22:44:06,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2025-01-09 22:44:06,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 28 states have (on average 1.5714285714285714) internal successors, (44), 42 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:44:06,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 44 transitions. [2025-01-09 22:44:06,364 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 44 transitions. Word has length 9 [2025-01-09 22:44:06,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:44:06,365 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 44 transitions. [2025-01-09 22:44:06,365 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:44:06,365 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 44 transitions. [2025-01-09 22:44:06,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-01-09 22:44:06,366 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:44:06,366 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:44:06,368 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 22:44:06,368 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2025-01-09 22:44:06,369 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:44:06,369 INFO L85 PathProgramCache]: Analyzing trace with hash 1718544629, now seen corresponding path program 1 times [2025-01-09 22:44:06,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:44:06,369 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1048145594] [2025-01-09 22:44:06,369 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:44:06,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:44:06,381 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-01-09 22:44:06,388 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-01-09 22:44:06,389 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:44:06,389 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:44:06,446 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:44:06,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:44:06,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1048145594] [2025-01-09 22:44:06,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1048145594] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:44:06,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [676140369] [2025-01-09 22:44:06,447 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:44:06,447 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:44:06,447 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:44:06,450 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 22:44:06,451 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 22:44:06,506 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-01-09 22:44:06,524 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-01-09 22:44:06,524 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:44:06,524 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:44:06,526 INFO L256 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-09 22:44:06,529 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:44:06,567 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:44:06,568 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:44:06,614 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:44:06,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [676140369] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 22:44:06,615 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 22:44:06,615 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2025-01-09 22:44:06,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [27186361] [2025-01-09 22:44:06,615 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 22:44:06,615 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 22:44:06,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:44:06,616 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 22:44:06,616 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-01-09 22:44:06,616 INFO L87 Difference]: Start difference. First operand 43 states and 44 transitions. Second operand has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:44:06,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:44:06,631 INFO L93 Difference]: Finished difference Result 51 states and 52 transitions. [2025-01-09 22:44:06,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 22:44:06,632 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 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 14 [2025-01-09 22:44:06,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:44:06,633 INFO L225 Difference]: With dead ends: 51 [2025-01-09 22:44:06,633 INFO L226 Difference]: Without dead ends: 51 [2025-01-09 22:44:06,633 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 25 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-01-09 22:44:06,633 INFO L435 NwaCegarLoop]: 41 mSDtfsCounter, 7 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 22:44:06,634 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 79 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:44:06,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2025-01-09 22:44:06,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2025-01-09 22:44:06,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 36 states have (on average 1.4444444444444444) internal successors, (52), 50 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:44:06,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 52 transitions. [2025-01-09 22:44:06,640 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 52 transitions. Word has length 14 [2025-01-09 22:44:06,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:44:06,640 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 52 transitions. [2025-01-09 22:44:06,640 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:44:06,640 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 52 transitions. [2025-01-09 22:44:06,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-01-09 22:44:06,640 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:44:06,640 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2025-01-09 22:44:06,648 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-01-09 22:44:06,841 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:44:06,841 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2025-01-09 22:44:06,841 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:44:06,841 INFO L85 PathProgramCache]: Analyzing trace with hash -1669928349, now seen corresponding path program 2 times [2025-01-09 22:44:06,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:44:06,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [959469814] [2025-01-09 22:44:06,842 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 22:44:06,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:44:06,857 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-01-09 22:44:06,871 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-01-09 22:44:06,871 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 22:44:06,871 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:44:07,022 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-09 22:44:07,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:44:07,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [959469814] [2025-01-09 22:44:07,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [959469814] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:44:07,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [117787064] [2025-01-09 22:44:07,022 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 22:44:07,022 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:44:07,022 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:44:07,024 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 22:44:07,026 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-09 22:44:07,086 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-01-09 22:44:07,113 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-01-09 22:44:07,113 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 22:44:07,113 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:44:07,117 INFO L256 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-01-09 22:44:07,120 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:44:07,140 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-01-09 22:44:07,162 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 22:44:07,164 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 14 treesize of output 9 [2025-01-09 22:44:07,204 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-01-09 22:44:07,204 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 14 treesize of output 13 [2025-01-09 22:44:07,306 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 22:44:07,306 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:44:07,462 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 22:44:07,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [117787064] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 22:44:07,463 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 22:44:07,463 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7, 7] total 12 [2025-01-09 22:44:07,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1407292550] [2025-01-09 22:44:07,463 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 22:44:07,464 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-09 22:44:07,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:44:07,464 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-09 22:44:07,465 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2025-01-09 22:44:07,465 INFO L87 Difference]: Start difference. First operand 51 states and 52 transitions. Second operand has 13 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 13 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:44:07,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:44:07,588 INFO L93 Difference]: Finished difference Result 71 states and 74 transitions. [2025-01-09 22:44:07,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 22:44:07,589 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 13 states have internal predecessors, (37), 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 22 [2025-01-09 22:44:07,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:44:07,589 INFO L225 Difference]: With dead ends: 71 [2025-01-09 22:44:07,589 INFO L226 Difference]: Without dead ends: 71 [2025-01-09 22:44:07,592 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=132, Unknown=0, NotChecked=0, Total=210 [2025-01-09 22:44:07,592 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 135 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:44:07,592 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 84 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:44:07,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2025-01-09 22:44:07,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 53. [2025-01-09 22:44:07,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 39 states have (on average 1.4615384615384615) internal successors, (57), 52 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:44:07,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 57 transitions. [2025-01-09 22:44:07,595 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 57 transitions. Word has length 22 [2025-01-09 22:44:07,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:44:07,595 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 57 transitions. [2025-01-09 22:44:07,595 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 13 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:44:07,595 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 57 transitions. [2025-01-09 22:44:07,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-01-09 22:44:07,595 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:44:07,595 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2025-01-09 22:44:07,603 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-01-09 22:44:07,801 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:44:07,801 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2025-01-09 22:44:07,802 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:44:07,802 INFO L85 PathProgramCache]: Analyzing trace with hash -1669928348, now seen corresponding path program 1 times [2025-01-09 22:44:07,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:44:07,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [678513053] [2025-01-09 22:44:07,802 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:44:07,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:44:07,816 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-01-09 22:44:07,829 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-01-09 22:44:07,830 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:44:07,830 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:44:08,099 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:44:08,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:44:08,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [678513053] [2025-01-09 22:44:08,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [678513053] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:44:08,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1776154732] [2025-01-09 22:44:08,100 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:44:08,100 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:44:08,100 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:44:08,103 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 22:44:08,104 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-09 22:44:08,168 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-01-09 22:44:08,193 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-01-09 22:44:08,193 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:44:08,193 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:44:08,194 INFO L256 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-01-09 22:44:08,196 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:44:08,207 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-01-09 22:44:08,239 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 22:44:08,240 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 14 treesize of output 9 [2025-01-09 22:44:08,305 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 22:44:08,306 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 14 treesize of output 9 [2025-01-09 22:44:08,371 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 22:44:08,371 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:44:12,623 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_23| Int)) (or (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_node_create_~temp~0#1.base_23| 1)) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_21| Int) (v_ArrVal_259 Int)) (or (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_node_create_~temp~0#1.base_21| 1)) (forall ((v_ArrVal_260 Int)) (<= (+ |c_ULTIMATE.start_main_~#s~0#1.offset| 4) (select (store (store |c_#length| |v_ULTIMATE.start_node_create_~temp~0#1.base_23| v_ArrVal_259) |v_ULTIMATE.start_node_create_~temp~0#1.base_21| v_ArrVal_260) |c_ULTIMATE.start_main_~#s~0#1.base|))))))) (<= 0 |c_ULTIMATE.start_main_~#s~0#1.offset|)) is different from false [2025-01-09 22:44:12,709 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2025-01-09 22:44:12,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1776154732] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 22:44:12,709 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 22:44:12,709 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 4, 5] total 14 [2025-01-09 22:44:12,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [595825607] [2025-01-09 22:44:12,709 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 22:44:12,709 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-01-09 22:44:12,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:44:12,710 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-01-09 22:44:12,710 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=127, Unknown=1, NotChecked=24, Total=210 [2025-01-09 22:44:12,710 INFO L87 Difference]: Start difference. First operand 53 states and 57 transitions. Second operand has 15 states, 14 states have (on average 4.571428571428571) internal successors, (64), 15 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:44:12,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:44:12,865 INFO L93 Difference]: Finished difference Result 60 states and 62 transitions. [2025-01-09 22:44:12,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 22:44:12,865 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 4.571428571428571) internal successors, (64), 15 states have internal predecessors, (64), 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 22 [2025-01-09 22:44:12,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:44:12,866 INFO L225 Difference]: With dead ends: 60 [2025-01-09 22:44:12,866 INFO L226 Difference]: Without dead ends: 60 [2025-01-09 22:44:12,866 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=93, Invalid=182, Unknown=1, NotChecked=30, Total=306 [2025-01-09 22:44:12,867 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 148 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 47 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:44:12,871 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 80 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 124 Invalid, 0 Unknown, 47 Unchecked, 0.1s Time] [2025-01-09 22:44:12,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2025-01-09 22:44:12,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 49. [2025-01-09 22:44:12,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 39 states have (on average 1.3076923076923077) internal successors, (51), 48 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:44:12,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 51 transitions. [2025-01-09 22:44:12,873 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 51 transitions. Word has length 22 [2025-01-09 22:44:12,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:44:12,873 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 51 transitions. [2025-01-09 22:44:12,873 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 4.571428571428571) internal successors, (64), 15 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:44:12,873 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 51 transitions. [2025-01-09 22:44:12,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-01-09 22:44:12,874 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:44:12,874 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:44:12,880 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-01-09 22:44:13,074 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-01-09 22:44:13,074 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2025-01-09 22:44:13,075 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:44:13,075 INFO L85 PathProgramCache]: Analyzing trace with hash -228171259, now seen corresponding path program 1 times [2025-01-09 22:44:13,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:44:13,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1239562470] [2025-01-09 22:44:13,075 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:44:13,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:44:13,086 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-01-09 22:44:13,093 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-01-09 22:44:13,093 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:44:13,093 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:44:13,257 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-09 22:44:13,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:44:13,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1239562470] [2025-01-09 22:44:13,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1239562470] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:44:13,257 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:44:13,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 22:44:13,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1161705667] [2025-01-09 22:44:13,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:44:13,258 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 22:44:13,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:44:13,258 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 22:44:13,258 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-01-09 22:44:13,258 INFO L87 Difference]: Start difference. First operand 49 states and 51 transitions. Second operand has 10 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 10 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:44:13,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:44:13,443 INFO L93 Difference]: Finished difference Result 59 states and 61 transitions. [2025-01-09 22:44:13,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-09 22:44:13,444 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 10 states have internal predecessors, (21), 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 23 [2025-01-09 22:44:13,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:44:13,444 INFO L225 Difference]: With dead ends: 59 [2025-01-09 22:44:13,444 INFO L226 Difference]: Without dead ends: 59 [2025-01-09 22:44:13,445 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2025-01-09 22:44:13,445 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 28 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 274 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 276 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 274 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:44:13,445 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 108 Invalid, 276 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 274 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:44:13,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2025-01-09 22:44:13,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 50. [2025-01-09 22:44:13,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 40 states have (on average 1.325) internal successors, (53), 49 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:44:13,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 53 transitions. [2025-01-09 22:44:13,450 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 53 transitions. Word has length 23 [2025-01-09 22:44:13,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:44:13,450 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 53 transitions. [2025-01-09 22:44:13,450 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 10 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:44:13,450 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 53 transitions. [2025-01-09 22:44:13,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-01-09 22:44:13,450 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:44:13,450 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:44:13,451 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 22:44:13,451 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2025-01-09 22:44:13,451 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:44:13,451 INFO L85 PathProgramCache]: Analyzing trace with hash -228171258, now seen corresponding path program 1 times [2025-01-09 22:44:13,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:44:13,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1714427165] [2025-01-09 22:44:13,451 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:44:13,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:44:13,462 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-01-09 22:44:13,467 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-01-09 22:44:13,467 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:44:13,467 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:44:13,719 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 22:44:13,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:44:13,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1714427165] [2025-01-09 22:44:13,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1714427165] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:44:13,719 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:44:13,720 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 22:44:13,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [241689338] [2025-01-09 22:44:13,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:44:13,720 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 22:44:13,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:44:13,721 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 22:44:13,721 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-01-09 22:44:13,721 INFO L87 Difference]: Start difference. First operand 50 states and 53 transitions. Second operand has 10 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 10 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:44:13,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:44:13,921 INFO L93 Difference]: Finished difference Result 60 states and 62 transitions. [2025-01-09 22:44:13,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-09 22:44:13,921 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 10 states have internal predecessors, (23), 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 23 [2025-01-09 22:44:13,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:44:13,922 INFO L225 Difference]: With dead ends: 60 [2025-01-09 22:44:13,922 INFO L226 Difference]: Without dead ends: 60 [2025-01-09 22:44:13,922 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2025-01-09 22:44:13,923 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 28 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 222 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:44:13,923 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 160 Invalid, 223 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 222 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:44:13,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2025-01-09 22:44:13,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 50. [2025-01-09 22:44:13,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 40 states have (on average 1.3) internal successors, (52), 49 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:44:13,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 52 transitions. [2025-01-09 22:44:13,928 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 52 transitions. Word has length 23 [2025-01-09 22:44:13,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:44:13,928 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 52 transitions. [2025-01-09 22:44:13,928 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 10 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:44:13,929 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 52 transitions. [2025-01-09 22:44:13,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-01-09 22:44:13,930 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:44:13,930 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:44:13,930 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 22:44:13,930 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2025-01-09 22:44:13,931 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:44:13,931 INFO L85 PathProgramCache]: Analyzing trace with hash 1517333743, now seen corresponding path program 1 times [2025-01-09 22:44:13,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:44:13,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1704610052] [2025-01-09 22:44:13,931 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:44:13,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:44:13,939 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-01-09 22:44:13,943 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-01-09 22:44:13,943 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:44:13,943 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:44:13,999 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 22:44:13,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:44:13,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1704610052] [2025-01-09 22:44:13,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1704610052] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:44:13,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1373357708] [2025-01-09 22:44:13,999 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:44:13,999 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:44:13,999 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:44:14,001 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-01-09 22:44:14,003 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-01-09 22:44:14,061 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-01-09 22:44:14,081 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-01-09 22:44:14,081 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:44:14,081 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:44:14,083 INFO L256 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 22:44:14,084 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:44:14,102 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-01-09 22:44:14,102 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 22:44:14,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1373357708] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:44:14,102 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 22:44:14,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 5 [2025-01-09 22:44:14,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [280296098] [2025-01-09 22:44:14,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:44:14,103 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 22:44:14,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:44:14,103 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 22:44:14,103 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 22:44:14,103 INFO L87 Difference]: Start difference. First operand 50 states and 52 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:44:14,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:44:14,110 INFO L93 Difference]: Finished difference Result 60 states and 61 transitions. [2025-01-09 22:44:14,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 22:44:14,110 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 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 24 [2025-01-09 22:44:14,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:44:14,111 INFO L225 Difference]: With dead ends: 60 [2025-01-09 22:44:14,111 INFO L226 Difference]: Without dead ends: 60 [2025-01-09 22:44:14,111 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 22:44:14,111 INFO L435 NwaCegarLoop]: 35 mSDtfsCounter, 13 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 93 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-01-09 22:44:14,111 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 93 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:44:14,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2025-01-09 22:44:14,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 49. [2025-01-09 22:44:14,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 39 states have (on average 1.2820512820512822) internal successors, (50), 48 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:44:14,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 50 transitions. [2025-01-09 22:44:14,113 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 50 transitions. Word has length 24 [2025-01-09 22:44:14,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:44:14,113 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 50 transitions. [2025-01-09 22:44:14,113 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:44:14,113 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 50 transitions. [2025-01-09 22:44:14,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-01-09 22:44:14,113 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:44:14,113 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:44:14,120 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-01-09 22:44:14,314 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,SelfDestructingSolverStorable10 [2025-01-09 22:44:14,314 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2025-01-09 22:44:14,314 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:44:14,314 INFO L85 PathProgramCache]: Analyzing trace with hash 1483263656, now seen corresponding path program 1 times [2025-01-09 22:44:14,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:44:14,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630783050] [2025-01-09 22:44:14,315 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:44:14,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:44:14,326 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-01-09 22:44:14,330 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-01-09 22:44:14,330 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:44:14,330 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:44:14,430 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 22:44:14,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:44:14,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1630783050] [2025-01-09 22:44:14,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1630783050] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:44:14,430 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:44:14,431 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 22:44:14,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [491538357] [2025-01-09 22:44:14,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:44:14,431 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 22:44:14,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:44:14,431 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 22:44:14,431 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-01-09 22:44:14,431 INFO L87 Difference]: Start difference. First operand 49 states and 50 transitions. Second operand has 10 states, 9 states have (on average 2.888888888888889) internal successors, (26), 10 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:44:14,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:44:14,519 INFO L93 Difference]: Finished difference Result 58 states and 59 transitions. [2025-01-09 22:44:14,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 22:44:14,520 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.888888888888889) internal successors, (26), 10 states have internal predecessors, (26), 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 26 [2025-01-09 22:44:14,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:44:14,520 INFO L225 Difference]: With dead ends: 58 [2025-01-09 22:44:14,520 INFO L226 Difference]: Without dead ends: 58 [2025-01-09 22:44:14,520 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2025-01-09 22:44:14,521 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 23 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:44:14,521 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 194 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:44:14,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2025-01-09 22:44:14,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 52. [2025-01-09 22:44:14,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 42 states have (on average 1.2619047619047619) internal successors, (53), 51 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:44:14,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 53 transitions. [2025-01-09 22:44:14,522 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 53 transitions. Word has length 26 [2025-01-09 22:44:14,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:44:14,522 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 53 transitions. [2025-01-09 22:44:14,522 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.888888888888889) internal successors, (26), 10 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:44:14,522 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 53 transitions. [2025-01-09 22:44:14,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-01-09 22:44:14,523 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:44:14,523 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:44:14,523 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 22:44:14,523 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2025-01-09 22:44:14,523 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:44:14,523 INFO L85 PathProgramCache]: Analyzing trace with hash -1263466842, now seen corresponding path program 1 times [2025-01-09 22:44:14,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:44:14,523 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1558752031] [2025-01-09 22:44:14,523 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:44:14,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:44:14,534 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-01-09 22:44:14,538 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-01-09 22:44:14,538 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:44:14,538 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:44:14,643 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 22:44:14,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:44:14,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1558752031] [2025-01-09 22:44:14,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1558752031] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:44:14,643 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:44:14,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 22:44:14,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1303222912] [2025-01-09 22:44:14,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:44:14,644 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 22:44:14,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:44:14,644 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 22:44:14,644 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-01-09 22:44:14,644 INFO L87 Difference]: Start difference. First operand 52 states and 53 transitions. Second operand has 10 states, 9 states have (on average 3.0) internal successors, (27), 10 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:44:14,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:44:14,787 INFO L93 Difference]: Finished difference Result 57 states and 58 transitions. [2025-01-09 22:44:14,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-09 22:44:14,787 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.0) internal successors, (27), 10 states have internal predecessors, (27), 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 27 [2025-01-09 22:44:14,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:44:14,787 INFO L225 Difference]: With dead ends: 57 [2025-01-09 22:44:14,787 INFO L226 Difference]: Without dead ends: 57 [2025-01-09 22:44:14,788 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2025-01-09 22:44:14,788 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 22 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 230 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 231 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 230 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:44:14,788 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 151 Invalid, 231 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 230 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:44:14,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2025-01-09 22:44:14,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 53. [2025-01-09 22:44:14,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 43 states have (on average 1.255813953488372) internal successors, (54), 52 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:44:14,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 54 transitions. [2025-01-09 22:44:14,790 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 54 transitions. Word has length 27 [2025-01-09 22:44:14,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:44:14,790 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 54 transitions. [2025-01-09 22:44:14,790 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.0) internal successors, (27), 10 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:44:14,790 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 54 transitions. [2025-01-09 22:44:14,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-01-09 22:44:14,790 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:44:14,790 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:44:14,790 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 22:44:14,790 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2025-01-09 22:44:14,790 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:44:14,790 INFO L85 PathProgramCache]: Analyzing trace with hash -512766358, now seen corresponding path program 1 times [2025-01-09 22:44:14,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:44:14,791 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1861974994] [2025-01-09 22:44:14,791 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:44:14,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:44:14,798 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-01-09 22:44:14,815 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-01-09 22:44:14,816 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:44:14,816 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:44:14,848 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-01-09 22:44:14,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:44:14,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1861974994] [2025-01-09 22:44:14,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1861974994] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:44:14,849 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:44:14,849 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 22:44:14,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2012755967] [2025-01-09 22:44:14,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:44:14,849 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 22:44:14,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:44:14,849 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 22:44:14,849 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 22:44:14,849 INFO L87 Difference]: Start difference. First operand 53 states and 54 transitions. Second operand has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:44:14,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:44:14,890 INFO L93 Difference]: Finished difference Result 52 states and 53 transitions. [2025-01-09 22:44:14,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 22:44:14,890 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 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 28 [2025-01-09 22:44:14,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:44:14,890 INFO L225 Difference]: With dead ends: 52 [2025-01-09 22:44:14,890 INFO L226 Difference]: Without dead ends: 52 [2025-01-09 22:44:14,891 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-01-09 22:44:14,891 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 6 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 22:44:14,891 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 73 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:44:14,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2025-01-09 22:44:14,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2025-01-09 22:44:14,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 43 states have (on average 1.2325581395348837) internal successors, (53), 51 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:44:14,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 53 transitions. [2025-01-09 22:44:14,896 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 53 transitions. Word has length 28 [2025-01-09 22:44:14,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:44:14,896 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 53 transitions. [2025-01-09 22:44:14,896 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:44:14,896 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 53 transitions. [2025-01-09 22:44:14,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-01-09 22:44:14,896 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:44:14,896 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:44:14,897 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 22:44:14,897 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2025-01-09 22:44:14,897 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:44:14,897 INFO L85 PathProgramCache]: Analyzing trace with hash 1284112169, now seen corresponding path program 1 times [2025-01-09 22:44:14,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:44:14,897 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [109317313] [2025-01-09 22:44:14,897 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:44:14,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:44:14,906 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-01-09 22:44:14,910 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-01-09 22:44:14,910 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:44:14,910 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:44:15,046 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 22:44:15,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:44:15,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [109317313] [2025-01-09 22:44:15,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [109317313] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:44:15,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1282428003] [2025-01-09 22:44:15,046 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:44:15,047 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:44:15,047 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:44:15,048 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-01-09 22:44:15,050 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-01-09 22:44:15,113 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-01-09 22:44:15,135 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-01-09 22:44:15,136 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:44:15,136 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:44:15,137 INFO L256 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-09 22:44:15,138 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:44:15,210 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 22:44:15,210 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 14 treesize of output 9 [2025-01-09 22:44:15,215 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-01-09 22:44:15,215 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 22:44:15,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1282428003] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:44:15,215 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 22:44:15,215 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [12] total 15 [2025-01-09 22:44:15,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1501858025] [2025-01-09 22:44:15,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:44:15,215 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 22:44:15,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:44:15,215 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 22:44:15,216 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2025-01-09 22:44:15,216 INFO L87 Difference]: Start difference. First operand 52 states and 53 transitions. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:44:15,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:44:15,276 INFO L93 Difference]: Finished difference Result 51 states and 52 transitions. [2025-01-09 22:44:15,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 22:44:15,276 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 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 29 [2025-01-09 22:44:15,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:44:15,276 INFO L225 Difference]: With dead ends: 51 [2025-01-09 22:44:15,276 INFO L226 Difference]: Without dead ends: 51 [2025-01-09 22:44:15,277 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=285, Unknown=0, NotChecked=0, Total=342 [2025-01-09 22:44:15,277 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 36 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 22:44:15,277 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 60 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:44:15,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2025-01-09 22:44:15,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2025-01-09 22:44:15,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 43 states have (on average 1.2093023255813953) internal successors, (52), 50 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:44:15,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 52 transitions. [2025-01-09 22:44:15,279 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 52 transitions. Word has length 29 [2025-01-09 22:44:15,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:44:15,279 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 52 transitions. [2025-01-09 22:44:15,279 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:44:15,279 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 52 transitions. [2025-01-09 22:44:15,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-01-09 22:44:15,279 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:44:15,279 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:44:15,286 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-01-09 22:44:15,479 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,SelfDestructingSolverStorable14 [2025-01-09 22:44:15,480 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2025-01-09 22:44:15,480 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:44:15,480 INFO L85 PathProgramCache]: Analyzing trace with hash -288054639, now seen corresponding path program 1 times [2025-01-09 22:44:15,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:44:15,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1556626330] [2025-01-09 22:44:15,480 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:44:15,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:44:15,489 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-01-09 22:44:15,493 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-01-09 22:44:15,493 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:44:15,493 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:44:15,532 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-01-09 22:44:15,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:44:15,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1556626330] [2025-01-09 22:44:15,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1556626330] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:44:15,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [609037441] [2025-01-09 22:44:15,533 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:44:15,533 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:44:15,533 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:44:15,534 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-01-09 22:44:15,536 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-01-09 22:44:15,603 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-01-09 22:44:15,629 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-01-09 22:44:15,629 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:44:15,629 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:44:15,630 INFO L256 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-01-09 22:44:15,632 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:44:15,635 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-01-09 22:44:15,655 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2025-01-09 22:44:15,656 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 12 treesize of output 14 [2025-01-09 22:44:15,688 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2025-01-09 22:44:15,688 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 12 treesize of output 14 [2025-01-09 22:44:15,748 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 22:44:15,748 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 14 treesize of output 9 [2025-01-09 22:44:15,753 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-01-09 22:44:15,753 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:44:17,493 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_25| Int) (|ULTIMATE.start_sll_remove_first_#t~mem8#1.base| Int) (v_ArrVal_745 Int)) (or (= (select (store (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_25| 1) |ULTIMATE.start_sll_remove_first_#t~mem8#1.base| v_ArrVal_745) |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (< |c_#StackHeapBarrier| (+ |ULTIMATE.start_sll_remove_first_#t~mem8#1.base| 1)))) is different from false [2025-01-09 22:44:19,038 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_25| Int) (|v_ULTIMATE.start_node_create_~temp~0#1.base_27| Int) (|ULTIMATE.start_sll_remove_first_#t~mem8#1.base| Int) (v_ArrVal_745 Int)) (or (= (select (store (store (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| 1) |v_ULTIMATE.start_node_create_~temp~0#1.base_25| 1) |ULTIMATE.start_sll_remove_first_#t~mem8#1.base| v_ArrVal_745) |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (< |c_#StackHeapBarrier| (+ |ULTIMATE.start_sll_remove_first_#t~mem8#1.base| 1)))) is different from false [2025-01-09 22:44:19,048 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 10 not checked. [2025-01-09 22:44:19,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [609037441] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 22:44:19,048 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 22:44:19,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 7] total 10 [2025-01-09 22:44:19,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1132313502] [2025-01-09 22:44:19,048 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 22:44:19,048 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 22:44:19,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:44:19,049 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 22:44:19,049 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=53, Unknown=2, NotChecked=30, Total=110 [2025-01-09 22:44:19,049 INFO L87 Difference]: Start difference. First operand 51 states and 52 transitions. Second operand has 11 states, 10 states have (on average 7.1) internal successors, (71), 11 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:44:19,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:44:19,113 INFO L93 Difference]: Finished difference Result 49 states and 50 transitions. [2025-01-09 22:44:19,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 22:44:19,113 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 7.1) internal successors, (71), 11 states have internal predecessors, (71), 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 32 [2025-01-09 22:44:19,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:44:19,113 INFO L225 Difference]: With dead ends: 49 [2025-01-09 22:44:19,113 INFO L226 Difference]: Without dead ends: 49 [2025-01-09 22:44:19,114 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 55 SyntacticMatches, 4 SemanticMatches, 11 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=42, Invalid=74, Unknown=2, NotChecked=38, Total=156 [2025-01-09 22:44:19,114 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 50 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 59 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 22:44:19,114 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 54 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 57 Invalid, 0 Unknown, 59 Unchecked, 0.0s Time] [2025-01-09 22:44:19,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2025-01-09 22:44:19,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2025-01-09 22:44:19,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 43 states have (on average 1.1627906976744187) internal successors, (50), 48 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:44:19,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 50 transitions. [2025-01-09 22:44:19,115 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 50 transitions. Word has length 32 [2025-01-09 22:44:19,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:44:19,115 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 50 transitions. [2025-01-09 22:44:19,116 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 7.1) internal successors, (71), 11 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:44:19,116 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 50 transitions. [2025-01-09 22:44:19,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-01-09 22:44:19,116 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:44:19,116 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:44:19,126 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-01-09 22:44:19,316 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,SelfDestructingSolverStorable15 [2025-01-09 22:44:19,316 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2025-01-09 22:44:19,317 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:44:19,317 INFO L85 PathProgramCache]: Analyzing trace with hash -339759209, now seen corresponding path program 1 times [2025-01-09 22:44:19,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:44:19,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [211523493] [2025-01-09 22:44:19,317 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:44:19,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:44:19,325 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-01-09 22:44:19,334 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-01-09 22:44:19,334 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:44:19,334 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:44:20,048 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:44:20,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:44:20,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [211523493] [2025-01-09 22:44:20,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [211523493] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:44:20,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [745305412] [2025-01-09 22:44:20,049 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:44:20,049 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:44:20,049 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:44:20,051 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-01-09 22:44:20,052 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-01-09 22:44:20,124 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-01-09 22:44:20,152 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-01-09 22:44:20,152 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:44:20,152 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:44:20,154 INFO L256 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 68 conjuncts are in the unsatisfiable core [2025-01-09 22:44:20,157 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:44:20,165 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-01-09 22:44:20,185 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-01-09 22:44:20,186 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2025-01-09 22:44:20,216 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 15 treesize of output 1 [2025-01-09 22:44:20,310 INFO L349 Elim1Store]: treesize reduction 12, result has 50.0 percent of original size [2025-01-09 22:44:20,310 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 38 treesize of output 28 [2025-01-09 22:44:20,420 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 42 treesize of output 34 [2025-01-09 22:44:20,513 INFO L349 Elim1Store]: treesize reduction 29, result has 14.7 percent of original size [2025-01-09 22:44:20,513 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 30 treesize of output 17 [2025-01-09 22:44:20,558 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 0 case distinctions, treesize of input 28 treesize of output 8 [2025-01-09 22:44:20,563 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 9 [2025-01-09 22:44:20,564 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:44:20,564 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:44:20,804 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-01-09 22:44:20,872 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 29 treesize of output 17 [2025-01-09 22:44:20,881 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-01-09 22:44:20,882 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 28 treesize of output 26 [2025-01-09 22:44:21,088 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:44:21,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [745305412] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 22:44:21,088 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 22:44:21,088 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 22] total 40 [2025-01-09 22:44:21,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [335293938] [2025-01-09 22:44:21,089 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 22:44:21,089 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2025-01-09 22:44:21,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:44:21,089 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2025-01-09 22:44:21,090 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=1509, Unknown=0, NotChecked=0, Total=1640 [2025-01-09 22:44:21,090 INFO L87 Difference]: Start difference. First operand 49 states and 50 transitions. Second operand has 41 states, 40 states have (on average 1.6) internal successors, (64), 41 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:44:21,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:44:21,964 INFO L93 Difference]: Finished difference Result 70 states and 72 transitions. [2025-01-09 22:44:21,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-01-09 22:44:21,964 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 40 states have (on average 1.6) internal successors, (64), 41 states have internal predecessors, (64), 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 33 [2025-01-09 22:44:21,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:44:21,964 INFO L225 Difference]: With dead ends: 70 [2025-01-09 22:44:21,965 INFO L226 Difference]: Without dead ends: 70 [2025-01-09 22:44:21,966 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 47 SyntacticMatches, 4 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 588 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=274, Invalid=2806, Unknown=0, NotChecked=0, Total=3080 [2025-01-09 22:44:21,966 INFO L435 NwaCegarLoop]: 14 mSDtfsCounter, 42 mSDsluCounter, 187 mSDsCounter, 0 mSdLazyCounter, 947 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 954 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 947 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 22:44:21,966 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 201 Invalid, 954 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 947 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 22:44:21,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2025-01-09 22:44:21,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 55. [2025-01-09 22:44:21,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 49 states have (on average 1.183673469387755) internal successors, (58), 54 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:44:21,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 58 transitions. [2025-01-09 22:44:21,970 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 58 transitions. Word has length 33 [2025-01-09 22:44:21,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:44:21,970 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 58 transitions. [2025-01-09 22:44:21,970 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 40 states have (on average 1.6) internal successors, (64), 41 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:44:21,970 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 58 transitions. [2025-01-09 22:44:21,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-01-09 22:44:21,970 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:44:21,970 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:44:21,977 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-01-09 22:44:22,171 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:44:22,171 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2025-01-09 22:44:22,172 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:44:22,172 INFO L85 PathProgramCache]: Analyzing trace with hash -339759208, now seen corresponding path program 1 times [2025-01-09 22:44:22,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:44:22,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1562739137] [2025-01-09 22:44:22,172 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:44:22,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:44:22,186 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-01-09 22:44:22,194 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-01-09 22:44:22,195 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:44:22,195 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:44:23,106 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:44:23,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:44:23,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1562739137] [2025-01-09 22:44:23,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1562739137] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:44:23,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1361183517] [2025-01-09 22:44:23,107 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:44:23,107 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:44:23,107 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:44:23,109 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-01-09 22:44:23,110 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-01-09 22:44:23,189 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-01-09 22:44:23,216 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-01-09 22:44:23,217 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:44:23,217 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:44:23,218 INFO L256 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 91 conjuncts are in the unsatisfiable core [2025-01-09 22:44:23,221 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:44:23,227 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-01-09 22:44:23,234 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-01-09 22:44:23,272 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-01-09 22:44:23,274 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 14 treesize of output 13 [2025-01-09 22:44:23,284 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-09 22:44:23,284 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-01-09 22:44:23,390 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 11 treesize of output 7 [2025-01-09 22:44:23,394 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-01-09 22:44:23,647 INFO L349 Elim1Store]: treesize reduction 12, result has 50.0 percent of original size [2025-01-09 22:44:23,647 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 47 treesize of output 29 [2025-01-09 22:44:23,661 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 22:44:23,665 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:44:23,665 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 29 treesize of output 19 [2025-01-09 22:44:23,939 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 0 case distinctions, treesize of input 28 treesize of output 8 [2025-01-09 22:44:23,943 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 0 case distinctions, treesize of input 19 treesize of output 11 [2025-01-09 22:44:23,956 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 9 [2025-01-09 22:44:23,958 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:44:23,958 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:44:24,393 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:44:24,393 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 134 treesize of output 133 [2025-01-09 22:44:24,513 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 46 treesize of output 30 [2025-01-09 22:44:24,632 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 14 treesize of output 12 [2025-01-09 22:44:24,636 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 20 [2025-01-09 22:44:25,150 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:44:25,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1361183517] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 22:44:25,150 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 22:44:25,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 21, 21] total 55 [2025-01-09 22:44:25,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2143980516] [2025-01-09 22:44:25,150 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 22:44:25,151 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 56 states [2025-01-09 22:44:25,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:44:25,151 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2025-01-09 22:44:25,152 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=181, Invalid=2899, Unknown=0, NotChecked=0, Total=3080 [2025-01-09 22:44:25,153 INFO L87 Difference]: Start difference. First operand 55 states and 58 transitions. Second operand has 56 states, 55 states have (on average 1.5636363636363637) internal successors, (86), 56 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:44:26,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:44:26,350 INFO L93 Difference]: Finished difference Result 70 states and 72 transitions. [2025-01-09 22:44:26,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-01-09 22:44:26,350 INFO L78 Accepts]: Start accepts. Automaton has has 56 states, 55 states have (on average 1.5636363636363637) internal successors, (86), 56 states have internal predecessors, (86), 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 33 [2025-01-09 22:44:26,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:44:26,350 INFO L225 Difference]: With dead ends: 70 [2025-01-09 22:44:26,350 INFO L226 Difference]: Without dead ends: 70 [2025-01-09 22:44:26,352 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 894 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=346, Invalid=4484, Unknown=0, NotChecked=0, Total=4830 [2025-01-09 22:44:26,352 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 67 mSDsluCounter, 477 mSDsCounter, 0 mSdLazyCounter, 1391 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 496 SdHoareTripleChecker+Invalid, 1400 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 1391 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 22:44:26,352 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 496 Invalid, 1400 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 1391 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 22:44:26,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2025-01-09 22:44:26,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 55. [2025-01-09 22:44:26,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 49 states have (on average 1.163265306122449) internal successors, (57), 54 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:44:26,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 57 transitions. [2025-01-09 22:44:26,354 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 57 transitions. Word has length 33 [2025-01-09 22:44:26,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:44:26,355 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 57 transitions. [2025-01-09 22:44:26,355 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 56 states, 55 states have (on average 1.5636363636363637) internal successors, (86), 56 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:44:26,355 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 57 transitions. [2025-01-09 22:44:26,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-01-09 22:44:26,356 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:44:26,356 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-01-09 22:44:26,363 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-01-09 22:44:26,557 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,SelfDestructingSolverStorable17 [2025-01-09 22:44:26,557 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2025-01-09 22:44:26,557 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:44:26,558 INFO L85 PathProgramCache]: Analyzing trace with hash -1941892707, now seen corresponding path program 1 times [2025-01-09 22:44:26,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:44:26,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1834898376] [2025-01-09 22:44:26,558 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:44:26,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:44:26,566 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-01-09 22:44:26,570 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-01-09 22:44:26,570 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:44:26,570 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:44:26,616 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-01-09 22:44:26,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:44:26,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1834898376] [2025-01-09 22:44:26,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1834898376] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:44:26,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [43596406] [2025-01-09 22:44:26,617 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:44:26,617 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:44:26,617 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:44:26,620 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-01-09 22:44:26,620 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-01-09 22:44:26,703 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-01-09 22:44:26,730 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-01-09 22:44:26,730 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:44:26,730 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:44:26,731 INFO L256 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-09 22:44:26,733 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:44:26,769 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-01-09 22:44:26,769 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:44:26,802 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-01-09 22:44:26,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [43596406] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 22:44:26,802 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 22:44:26,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2025-01-09 22:44:26,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1089400634] [2025-01-09 22:44:26,804 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 22:44:26,804 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 22:44:26,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:44:26,805 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 22:44:26,805 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-01-09 22:44:26,805 INFO L87 Difference]: Start difference. First operand 55 states and 57 transitions. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:44:26,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:44:26,817 INFO L93 Difference]: Finished difference Result 55 states and 56 transitions. [2025-01-09 22:44:26,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 22:44:26,817 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 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 34 [2025-01-09 22:44:26,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:44:26,818 INFO L225 Difference]: With dead ends: 55 [2025-01-09 22:44:26,818 INFO L226 Difference]: Without dead ends: 55 [2025-01-09 22:44:26,818 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 64 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-01-09 22:44:26,818 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 13 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 22:44:26,818 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 148 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:44:26,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2025-01-09 22:44:26,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2025-01-09 22:44:26,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 49 states have (on average 1.1428571428571428) internal successors, (56), 54 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:44:26,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 56 transitions. [2025-01-09 22:44:26,821 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 56 transitions. Word has length 34 [2025-01-09 22:44:26,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:44:26,821 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 56 transitions. [2025-01-09 22:44:26,821 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:44:26,822 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 56 transitions. [2025-01-09 22:44:26,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-01-09 22:44:26,822 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:44:26,822 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:44:26,828 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-01-09 22:44:27,022 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:44:27,023 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2025-01-09 22:44:27,023 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:44:27,023 INFO L85 PathProgramCache]: Analyzing trace with hash 1471332310, now seen corresponding path program 1 times [2025-01-09 22:44:27,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:44:27,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1411728614] [2025-01-09 22:44:27,023 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:44:27,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:44:27,035 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-01-09 22:44:27,040 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-01-09 22:44:27,040 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:44:27,040 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:44:27,486 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 9 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:44:27,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:44:27,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1411728614] [2025-01-09 22:44:27,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1411728614] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:44:27,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1370392464] [2025-01-09 22:44:27,486 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:44:27,487 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:44:27,487 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:44:27,488 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-01-09 22:44:27,490 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-01-09 22:44:27,575 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-01-09 22:44:27,619 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-01-09 22:44:27,619 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:44:27,619 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:44:27,621 INFO L256 TraceCheckSpWp]: Trace formula consists of 317 conjuncts, 61 conjuncts are in the unsatisfiable core [2025-01-09 22:44:27,623 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:44:27,814 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 11 treesize of output 7 [2025-01-09 22:44:27,961 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-01-09 22:44:28,008 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:44:28,008 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 21 treesize of output 19 [2025-01-09 22:44:28,164 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 0 case distinctions, treesize of input 19 treesize of output 11 [2025-01-09 22:44:28,221 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:44:28,221 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:44:28,404 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:44:28,404 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 44 treesize of output 47 [2025-01-09 22:44:28,428 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 20 treesize of output 12 [2025-01-09 22:44:28,474 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 12 treesize of output 10 [2025-01-09 22:44:28,475 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 18 treesize of output 16 [2025-01-09 22:44:28,498 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:44:28,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1370392464] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 22:44:28,498 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 22:44:28,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 22, 21] total 47 [2025-01-09 22:44:28,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [912564081] [2025-01-09 22:44:28,498 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 22:44:28,499 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2025-01-09 22:44:28,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:44:28,501 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2025-01-09 22:44:28,501 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=181, Invalid=2075, Unknown=0, NotChecked=0, Total=2256 [2025-01-09 22:44:28,501 INFO L87 Difference]: Start difference. First operand 55 states and 56 transitions. Second operand has 48 states, 47 states have (on average 1.702127659574468) internal successors, (80), 48 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:44:28,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:44:28,966 INFO L93 Difference]: Finished difference Result 62 states and 63 transitions. [2025-01-09 22:44:28,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-01-09 22:44:28,966 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 47 states have (on average 1.702127659574468) internal successors, (80), 48 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2025-01-09 22:44:28,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:44:28,966 INFO L225 Difference]: With dead ends: 62 [2025-01-09 22:44:28,966 INFO L226 Difference]: Without dead ends: 62 [2025-01-09 22:44:28,967 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 44 SyntacticMatches, 1 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 818 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=314, Invalid=3226, Unknown=0, NotChecked=0, Total=3540 [2025-01-09 22:44:28,967 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 60 mSDsluCounter, 402 mSDsCounter, 0 mSdLazyCounter, 731 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 422 SdHoareTripleChecker+Invalid, 735 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 731 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 22:44:28,968 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 422 Invalid, 735 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 731 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 22:44:28,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2025-01-09 22:44:28,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 58. [2025-01-09 22:44:28,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 52 states have (on average 1.1346153846153846) internal successors, (59), 57 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:44:28,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 59 transitions. [2025-01-09 22:44:28,969 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 59 transitions. Word has length 36 [2025-01-09 22:44:28,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:44:28,969 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 59 transitions. [2025-01-09 22:44:28,969 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 47 states have (on average 1.702127659574468) internal successors, (80), 48 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:44:28,969 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 59 transitions. [2025-01-09 22:44:28,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-01-09 22:44:28,969 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:44:28,969 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:44:28,976 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-01-09 22:44:29,170 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,11 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:44:29,170 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2025-01-09 22:44:29,170 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:44:29,171 INFO L85 PathProgramCache]: Analyzing trace with hash -1633338568, now seen corresponding path program 1 times [2025-01-09 22:44:29,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:44:29,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [164543812] [2025-01-09 22:44:29,171 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:44:29,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:44:29,179 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-01-09 22:44:29,189 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-01-09 22:44:29,189 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:44:29,189 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:44:29,774 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:44:29,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:44:29,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [164543812] [2025-01-09 22:44:29,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [164543812] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:44:29,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1986774512] [2025-01-09 22:44:29,775 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:44:29,775 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:44:29,776 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:44:29,777 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-01-09 22:44:29,799 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-01-09 22:44:29,888 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-01-09 22:44:29,923 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-01-09 22:44:29,923 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:44:29,923 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:44:29,930 INFO L256 TraceCheckSpWp]: Trace formula consists of 319 conjuncts, 49 conjuncts are in the unsatisfiable core [2025-01-09 22:44:29,933 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:44:29,963 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 15 treesize of output 1 [2025-01-09 22:44:30,045 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:44:30,046 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 31 treesize of output 21 [2025-01-09 22:44:30,117 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 20 treesize of output 12 [2025-01-09 22:44:30,157 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 15 treesize of output 1 [2025-01-09 22:44:30,167 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 9 [2025-01-09 22:44:30,170 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:44:30,170 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:44:30,415 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-01-09 22:44:30,483 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 20 treesize of output 12 [2025-01-09 22:44:30,522 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 12 treesize of output 10 [2025-01-09 22:44:30,524 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 18 treesize of output 16 [2025-01-09 22:44:30,566 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:44:30,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1986774512] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 22:44:30,567 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 22:44:30,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 32 [2025-01-09 22:44:30,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [410434281] [2025-01-09 22:44:30,567 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 22:44:30,567 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2025-01-09 22:44:30,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:44:30,567 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2025-01-09 22:44:30,568 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=963, Unknown=0, NotChecked=0, Total=1056 [2025-01-09 22:44:30,568 INFO L87 Difference]: Start difference. First operand 58 states and 59 transitions. Second operand has 33 states, 32 states have (on average 1.65625) internal successors, (53), 33 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:44:31,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:44:31,208 INFO L93 Difference]: Finished difference Result 63 states and 64 transitions. [2025-01-09 22:44:31,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-01-09 22:44:31,208 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 1.65625) internal successors, (53), 33 states have internal predecessors, (53), 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 37 [2025-01-09 22:44:31,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:44:31,209 INFO L225 Difference]: With dead ends: 63 [2025-01-09 22:44:31,209 INFO L226 Difference]: Without dead ends: 63 [2025-01-09 22:44:31,209 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 49 SyntacticMatches, 13 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 399 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=195, Invalid=1875, Unknown=0, NotChecked=0, Total=2070 [2025-01-09 22:44:31,210 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 34 mSDsluCounter, 271 mSDsCounter, 0 mSdLazyCounter, 919 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 290 SdHoareTripleChecker+Invalid, 921 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 919 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 22:44:31,210 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 290 Invalid, 921 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 919 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 22:44:31,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2025-01-09 22:44:31,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 59. [2025-01-09 22:44:31,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 53 states have (on average 1.1320754716981132) internal successors, (60), 58 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:44:31,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 60 transitions. [2025-01-09 22:44:31,211 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 60 transitions. Word has length 37 [2025-01-09 22:44:31,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:44:31,211 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 60 transitions. [2025-01-09 22:44:31,211 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 1.65625) internal successors, (53), 33 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:44:31,211 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 60 transitions. [2025-01-09 22:44:31,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-01-09 22:44:31,211 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:44:31,211 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2025-01-09 22:44:31,218 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-01-09 22:44:31,416 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,SelfDestructingSolverStorable20 [2025-01-09 22:44:31,416 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2025-01-09 22:44:31,416 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:44:31,416 INFO L85 PathProgramCache]: Analyzing trace with hash 2114629289, now seen corresponding path program 2 times [2025-01-09 22:44:31,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:44:31,416 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [184314547] [2025-01-09 22:44:31,416 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 22:44:31,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:44:31,429 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 43 statements into 2 equivalence classes. [2025-01-09 22:44:31,434 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 43 of 43 statements. [2025-01-09 22:44:31,434 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 22:44:31,434 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:44:31,707 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 5 proven. 11 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-01-09 22:44:31,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:44:31,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [184314547] [2025-01-09 22:44:31,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [184314547] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:44:31,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1720673336] [2025-01-09 22:44:31,707 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 22:44:31,707 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:44:31,707 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:44:31,709 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-01-09 22:44:31,711 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-01-09 22:44:31,880 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 43 statements into 2 equivalence classes. [2025-01-09 22:44:31,939 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 43 of 43 statements. [2025-01-09 22:44:31,939 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 22:44:31,939 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:44:31,941 INFO L256 TraceCheckSpWp]: Trace formula consists of 359 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-09 22:44:31,942 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:44:32,005 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-01-09 22:44:32,005 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 22:44:32,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1720673336] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:44:32,005 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 22:44:32,005 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 8 [2025-01-09 22:44:32,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1201844417] [2025-01-09 22:44:32,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:44:32,006 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 22:44:32,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:44:32,006 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 22:44:32,006 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-01-09 22:44:32,006 INFO L87 Difference]: Start difference. First operand 59 states and 60 transitions. Second operand has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 6 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-01-09 22:44:32,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:44:32,015 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2025-01-09 22:44:32,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 22:44:32,016 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 6 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 43 [2025-01-09 22:44:32,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:44:32,016 INFO L225 Difference]: With dead ends: 49 [2025-01-09 22:44:32,016 INFO L226 Difference]: Without dead ends: 49 [2025-01-09 22:44:32,016 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-01-09 22:44:32,017 INFO L435 NwaCegarLoop]: 34 mSDtfsCounter, 0 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 22:44:32,017 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 99 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:44:32,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2025-01-09 22:44:32,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2025-01-09 22:44:32,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 47 states have (on average 1.0425531914893618) internal successors, (49), 48 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:44:32,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions. [2025-01-09 22:44:32,019 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 49 transitions. Word has length 43 [2025-01-09 22:44:32,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:44:32,019 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 49 transitions. [2025-01-09 22:44:32,019 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 6 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-01-09 22:44:32,019 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2025-01-09 22:44:32,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-01-09 22:44:32,019 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:44:32,019 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:44:32,026 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-01-09 22:44:32,220 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,13 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:44:32,220 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2025-01-09 22:44:32,220 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:44:32,220 INFO L85 PathProgramCache]: Analyzing trace with hash 1129706699, now seen corresponding path program 2 times [2025-01-09 22:44:32,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:44:32,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [267163371] [2025-01-09 22:44:32,220 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 22:44:32,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:44:32,231 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 44 statements into 2 equivalence classes. [2025-01-09 22:44:32,243 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 44 of 44 statements. [2025-01-09 22:44:32,244 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 22:44:32,244 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:44:33,179 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:44:33,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:44:33,179 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [267163371] [2025-01-09 22:44:33,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [267163371] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:44:33,179 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [944446822] [2025-01-09 22:44:33,179 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 22:44:33,179 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:44:33,179 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:44:33,181 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 22:44:33,182 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-01-09 22:44:33,311 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 44 statements into 2 equivalence classes. [2025-01-09 22:44:33,343 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 44 of 44 statements. [2025-01-09 22:44:33,343 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 22:44:33,343 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:44:33,345 INFO L256 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 87 conjuncts are in the unsatisfiable core [2025-01-09 22:44:33,350 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:44:34,317 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-01-09 22:44:35,024 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 22:44:35,028 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:44:35,028 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 198 treesize of output 124 [2025-01-09 22:44:35,518 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 249 treesize of output 241 [2025-01-09 22:44:36,102 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 193 treesize of output 142 [2025-01-09 22:44:36,521 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 180 treesize of output 124 [2025-01-09 22:44:37,081 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:44:37,081 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:44:37,754 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-01-09 22:44:37,905 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 71 treesize of output 47 [2025-01-09 22:44:38,181 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 58 treesize of output 52 [2025-01-09 22:44:38,184 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 93 treesize of output 87 [2025-01-09 22:44:41,243 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:44:41,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [944446822] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 22:44:41,244 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 22:44:41,244 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 71 [2025-01-09 22:44:41,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [812687837] [2025-01-09 22:44:41,244 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 22:44:41,244 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 72 states [2025-01-09 22:44:41,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:44:41,245 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2025-01-09 22:44:41,245 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=234, Invalid=4878, Unknown=0, NotChecked=0, Total=5112 [2025-01-09 22:44:41,246 INFO L87 Difference]: Start difference. First operand 49 states and 49 transitions. Second operand has 72 states, 71 states have (on average 1.7464788732394365) internal successors, (124), 72 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:44:49,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:44:49,515 INFO L93 Difference]: Finished difference Result 86 states and 86 transitions. [2025-01-09 22:44:49,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-01-09 22:44:49,515 INFO L78 Accepts]: Start accepts. Automaton has has 72 states, 71 states have (on average 1.7464788732394365) internal successors, (124), 72 states have internal predecessors, (124), 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 44 [2025-01-09 22:44:49,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:44:49,516 INFO L225 Difference]: With dead ends: 86 [2025-01-09 22:44:49,516 INFO L226 Difference]: Without dead ends: 85 [2025-01-09 22:44:49,517 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1454 ImplicationChecksByTransitivity, 10.3s TimeCoverageRelationStatistics Valid=354, Invalid=6452, Unknown=0, NotChecked=0, Total=6806 [2025-01-09 22:44:49,517 INFO L435 NwaCegarLoop]: 12 mSDtfsCounter, 47 mSDsluCounter, 311 mSDsCounter, 0 mSdLazyCounter, 1536 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 323 SdHoareTripleChecker+Invalid, 1544 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 1536 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2025-01-09 22:44:49,517 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 323 Invalid, 1544 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 1536 Invalid, 0 Unknown, 0 Unchecked, 4.2s Time] [2025-01-09 22:44:49,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2025-01-09 22:44:49,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 81. [2025-01-09 22:44:49,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 79 states have (on average 1.0379746835443038) internal successors, (82), 80 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:44:49,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 82 transitions. [2025-01-09 22:44:49,519 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 82 transitions. Word has length 44 [2025-01-09 22:44:49,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:44:49,519 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 82 transitions. [2025-01-09 22:44:49,519 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 72 states, 71 states have (on average 1.7464788732394365) internal successors, (124), 72 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:44:49,519 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 82 transitions. [2025-01-09 22:44:49,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-01-09 22:44:49,519 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:44:49,519 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:44:49,527 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2025-01-09 22:44:49,720 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,14 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:44:49,720 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2025-01-09 22:44:49,720 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:44:49,720 INFO L85 PathProgramCache]: Analyzing trace with hash -978655997, now seen corresponding path program 1 times [2025-01-09 22:44:49,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:44:49,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1641770579] [2025-01-09 22:44:49,720 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:44:49,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:44:49,732 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-01-09 22:44:49,741 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-01-09 22:44:49,741 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:44:49,741 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:44:51,572 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:44:51,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:44:51,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1641770579] [2025-01-09 22:44:51,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1641770579] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:44:51,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1111213896] [2025-01-09 22:44:51,573 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:44:51,573 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:44:51,573 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:44:51,575 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 22:44:51,577 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-01-09 22:44:51,687 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-01-09 22:44:51,715 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-01-09 22:44:51,715 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:44:51,715 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:44:51,717 INFO L256 TraceCheckSpWp]: Trace formula consists of 354 conjuncts, 113 conjuncts are in the unsatisfiable core [2025-01-09 22:44:51,719 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:44:51,860 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 11 treesize of output 7 [2025-01-09 22:44:51,864 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 11 treesize of output 7 [2025-01-09 22:44:51,984 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-01-09 22:44:51,985 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 16 treesize of output 15 [2025-01-09 22:44:51,997 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-01-09 22:44:51,997 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 16 treesize of output 15 [2025-01-09 22:44:52,046 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-01-09 22:44:52,046 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 20 treesize of output 19 [2025-01-09 22:44:52,061 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-01-09 22:44:52,061 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 20 treesize of output 19 [2025-01-09 22:44:52,166 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2025-01-09 22:44:52,166 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 28 treesize of output 31 [2025-01-09 22:44:52,177 INFO L349 Elim1Store]: treesize reduction 25, result has 43.2 percent of original size [2025-01-09 22:44:52,177 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 35 treesize of output 31 [2025-01-09 22:44:52,622 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 17 [2025-01-09 22:44:52,783 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 10 treesize of output 9 [2025-01-09 22:44:52,861 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 0 case distinctions, treesize of input 91 treesize of output 55 [2025-01-09 22:44:53,287 INFO L349 Elim1Store]: treesize reduction 76, result has 41.1 percent of original size [2025-01-09 22:44:53,287 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 117 treesize of output 122 [2025-01-09 22:44:53,307 INFO L349 Elim1Store]: treesize reduction 28, result has 42.9 percent of original size [2025-01-09 22:44:53,307 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 81 treesize of output 79 [2025-01-09 22:44:53,341 INFO L349 Elim1Store]: treesize reduction 4, result has 93.4 percent of original size [2025-01-09 22:44:53,341 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 65 treesize of output 109 [2025-01-09 22:44:53,660 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 11 treesize of output 7 [2025-01-09 22:44:53,662 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 0 case distinctions, treesize of input 19 treesize of output 11 [2025-01-09 22:44:53,717 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:44:53,717 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:44:54,070 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:44:54,071 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 69 treesize of output 72 [2025-01-09 22:44:54,281 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 34 treesize of output 20 [2025-01-09 22:44:54,673 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-01-09 22:44:54,802 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 55 treesize of output 35 [2025-01-09 22:44:55,274 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-01-09 22:44:56,170 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:44:56,170 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 21 [2025-01-09 22:44:56,171 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 22:44:56,174 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:44:56,175 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 16 [2025-01-09 22:44:56,183 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:44:56,183 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2025-01-09 22:44:56,187 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 22:44:56,195 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 8 [2025-01-09 22:44:56,439 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:44:56,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1111213896] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 22:44:56,439 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 22:44:56,439 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32, 33] total 90 [2025-01-09 22:44:56,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1895882485] [2025-01-09 22:44:56,439 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 22:44:56,439 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 90 states [2025-01-09 22:44:56,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:44:56,440 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2025-01-09 22:44:56,441 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=323, Invalid=7639, Unknown=48, NotChecked=0, Total=8010 [2025-01-09 22:44:56,441 INFO L87 Difference]: Start difference. First operand 81 states and 82 transitions. Second operand has 90 states, 90 states have (on average 1.3888888888888888) internal successors, (125), 90 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:44:58,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:44:58,679 INFO L93 Difference]: Finished difference Result 83 states and 83 transitions. [2025-01-09 22:44:58,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2025-01-09 22:44:58,680 INFO L78 Accepts]: Start accepts. Automaton has has 90 states, 90 states have (on average 1.3888888888888888) internal successors, (125), 90 states have internal predecessors, (125), 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 46 [2025-01-09 22:44:58,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:44:58,680 INFO L225 Difference]: With dead ends: 83 [2025-01-09 22:44:58,680 INFO L226 Difference]: Without dead ends: 59 [2025-01-09 22:44:58,682 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2235 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=585, Invalid=12477, Unknown=48, NotChecked=0, Total=13110 [2025-01-09 22:44:58,683 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 50 mSDsluCounter, 474 mSDsCounter, 0 mSdLazyCounter, 2071 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 487 SdHoareTripleChecker+Invalid, 2087 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 2071 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-01-09 22:44:58,683 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 487 Invalid, 2087 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 2071 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-01-09 22:44:58,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2025-01-09 22:44:58,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 57. [2025-01-09 22:44:58,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 55 states have (on average 1.0363636363636364) internal successors, (57), 56 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:44:58,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 57 transitions. [2025-01-09 22:44:58,684 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 57 transitions. Word has length 46 [2025-01-09 22:44:58,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:44:58,684 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 57 transitions. [2025-01-09 22:44:58,684 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 90 states, 90 states have (on average 1.3888888888888888) internal successors, (125), 90 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:44:58,684 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2025-01-09 22:44:58,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-01-09 22:44:58,684 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:44:58,684 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:44:58,691 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2025-01-09 22:44:58,884 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2025-01-09 22:44:58,885 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2025-01-09 22:44:58,885 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:44:58,885 INFO L85 PathProgramCache]: Analyzing trace with hash 539771321, now seen corresponding path program 3 times [2025-01-09 22:44:58,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:44:58,885 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1800942936] [2025-01-09 22:44:58,885 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-09 22:44:58,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:44:58,897 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 52 statements into 4 equivalence classes. [2025-01-09 22:44:58,907 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 52 of 52 statements. [2025-01-09 22:44:58,907 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-01-09 22:44:58,908 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:44:58,953 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 18 proven. 9 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-09 22:44:58,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:44:58,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1800942936] [2025-01-09 22:44:58,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1800942936] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:44:58,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [410003488] [2025-01-09 22:44:58,955 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-09 22:44:58,955 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:44:58,955 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:44:58,956 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 22:44:58,958 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-01-09 22:44:59,075 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 52 statements into 4 equivalence classes. [2025-01-09 22:44:59,288 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 52 of 52 statements. [2025-01-09 22:44:59,288 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-01-09 22:44:59,288 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:44:59,290 INFO L256 TraceCheckSpWp]: Trace formula consists of 440 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-09 22:44:59,291 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:44:59,308 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-09 22:44:59,308 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 22:44:59,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [410003488] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:44:59,309 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 22:44:59,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 6 [2025-01-09 22:44:59,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721376303] [2025-01-09 22:44:59,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:44:59,309 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 22:44:59,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:44:59,309 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 22:44:59,309 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-01-09 22:44:59,309 INFO L87 Difference]: Start difference. First operand 57 states and 57 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:44:59,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:44:59,317 INFO L93 Difference]: Finished difference Result 19 states and 18 transitions. [2025-01-09 22:44:59,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 22:44:59,317 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 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 52 [2025-01-09 22:44:59,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:44:59,317 INFO L225 Difference]: With dead ends: 19 [2025-01-09 22:44:59,317 INFO L226 Difference]: Without dead ends: 0 [2025-01-09 22:44:59,318 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-01-09 22:44:59,318 INFO L435 NwaCegarLoop]: 14 mSDtfsCounter, 0 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 33 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-01-09 22:44:59,318 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 33 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:44:59,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-01-09 22:44:59,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-01-09 22:44:59,318 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-01-09 22:44:59,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-01-09 22:44:59,318 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 52 [2025-01-09 22:44:59,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:44:59,318 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-01-09 22:44:59,318 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:44:59,318 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-01-09 22:44:59,319 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-01-09 22:44:59,320 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 21 remaining) [2025-01-09 22:44:59,321 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 21 remaining) [2025-01-09 22:44:59,321 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 21 remaining) [2025-01-09 22:44:59,321 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 21 remaining) [2025-01-09 22:44:59,321 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 21 remaining) [2025-01-09 22:44:59,321 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 21 remaining) [2025-01-09 22:44:59,321 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 21 remaining) [2025-01-09 22:44:59,321 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 21 remaining) [2025-01-09 22:44:59,321 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 21 remaining) [2025-01-09 22:44:59,321 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 21 remaining) [2025-01-09 22:44:59,321 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 21 remaining) [2025-01-09 22:44:59,321 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 21 remaining) [2025-01-09 22:44:59,321 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE (8 of 21 remaining) [2025-01-09 22:44:59,322 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE (7 of 21 remaining) [2025-01-09 22:44:59,322 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE (6 of 21 remaining) [2025-01-09 22:44:59,322 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 21 remaining) [2025-01-09 22:44:59,322 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 21 remaining) [2025-01-09 22:44:59,322 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 21 remaining) [2025-01-09 22:44:59,322 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 21 remaining) [2025-01-09 22:44:59,322 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK (1 of 21 remaining) [2025-01-09 22:44:59,322 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK (0 of 21 remaining) [2025-01-09 22:44:59,330 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2025-01-09 22:44:59,522 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2025-01-09 22:44:59,525 INFO L422 BasicCegarLoop]: Path program histogram: [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:44:59,526 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 22:44:59,529 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 10:44:59 BoogieIcfgContainer [2025-01-09 22:44:59,529 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 22:44:59,529 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 22:44:59,529 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 22:44:59,530 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 22:44:59,530 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 10:44:05" (3/4) ... [2025-01-09 22:44:59,531 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-01-09 22:44:59,538 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2025-01-09 22:44:59,538 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2025-01-09 22:44:59,538 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-01-09 22:44:59,539 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-01-09 22:44:59,595 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-09 22:44:59,595 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-09 22:44:59,595 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 22:44:59,597 INFO L158 Benchmark]: Toolchain (without parser) took 54790.30ms. Allocated memory was 142.6MB in the beginning and 503.3MB in the end (delta: 360.7MB). Free memory was 111.3MB in the beginning and 206.2MB in the end (delta: -94.8MB). Peak memory consumption was 262.1MB. Max. memory is 16.1GB. [2025-01-09 22:44:59,597 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 201.3MB. Free memory is still 124.2MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 22:44:59,598 INFO L158 Benchmark]: CACSL2BoogieTranslator took 242.74ms. Allocated memory is still 142.6MB. Free memory was 110.9MB in the beginning and 93.9MB in the end (delta: 17.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 22:44:59,598 INFO L158 Benchmark]: Boogie Procedure Inliner took 28.16ms. Allocated memory is still 142.6MB. Free memory was 93.9MB in the beginning and 92.4MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 22:44:59,598 INFO L158 Benchmark]: Boogie Preprocessor took 38.73ms. Allocated memory is still 142.6MB. Free memory was 92.4MB in the beginning and 89.8MB in the end (delta: 2.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 22:44:59,598 INFO L158 Benchmark]: RCFGBuilder took 289.19ms. Allocated memory is still 142.6MB. Free memory was 89.8MB in the beginning and 73.1MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 22:44:59,600 INFO L158 Benchmark]: TraceAbstraction took 54121.40ms. Allocated memory was 142.6MB in the beginning and 503.3MB in the end (delta: 360.7MB). Free memory was 72.6MB in the beginning and 210.3MB in the end (delta: -137.7MB). Peak memory consumption was 220.2MB. Max. memory is 16.1GB. [2025-01-09 22:44:59,600 INFO L158 Benchmark]: Witness Printer took 66.04ms. Allocated memory is still 503.3MB. Free memory was 210.3MB in the beginning and 206.2MB in the end (delta: 4.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 22:44:59,601 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.19ms. Allocated memory is still 201.3MB. Free memory is still 124.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 242.74ms. Allocated memory is still 142.6MB. Free memory was 110.9MB in the beginning and 93.9MB in the end (delta: 17.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 28.16ms. Allocated memory is still 142.6MB. Free memory was 93.9MB in the beginning and 92.4MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 38.73ms. Allocated memory is still 142.6MB. Free memory was 92.4MB in the beginning and 89.8MB in the end (delta: 2.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 289.19ms. Allocated memory is still 142.6MB. Free memory was 89.8MB in the beginning and 73.1MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 54121.40ms. Allocated memory was 142.6MB in the beginning and 503.3MB in the end (delta: 360.7MB). Free memory was 72.6MB in the beginning and 210.3MB in the end (delta: -137.7MB). Peak memory consumption was 220.2MB. Max. memory is 16.1GB. * Witness Printer took 66.04ms. Allocated memory is still 503.3MB. Free memory was 210.3MB in the beginning and 206.2MB in the end (delta: 4.1MB). There was no memory consumed. 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: -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: 594]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 594]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 594]: 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: 12]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 597]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 52 locations, 21 error locations. Started 1 CEGAR loops. OverallTime: 54.1s, OverallIterations: 25, TraceHistogramMax: 3, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 15.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 825 SdHoareTripleChecker+Valid, 7.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 825 mSDsluCounter, 4048 SdHoareTripleChecker+Invalid, 7.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 106 IncrementalHoareTripleChecker+Unchecked, 3403 mSDsCounter, 77 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 9146 IncrementalHoareTripleChecker+Invalid, 9329 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 77 mSolverCounterUnsat, 645 mSDtfsCounter, 9146 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1214 GetRequests, 624 SyntacticMatches, 29 SemanticMatches, 561 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 6530 ImplicationChecksByTransitivity, 29.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=81occurred in iteration=23, InterpolantAutomatonStates: 283, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 25 MinimizatonAttempts, 122 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 33.2s InterpolantComputationTime, 1163 NumberOfCodeBlocks, 1163 NumberOfCodeBlocksAsserted, 52 NumberOfCheckSat, 1465 ConstructedInterpolants, 136 QuantifiedInterpolants, 25540 SizeOfPredicates, 117 NumberOfNonLiveVariables, 4429 ConjunctsInSsa, 553 ConjunctsInUnsatCore, 51 InterpolantComputations, 14 PerfectInterpolantSequences, 289/661 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 21 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-01-09 22:44:59,639 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE