./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memcleanup.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_FNV_nondet_test2-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (memcleanup) Using default analysis Version 48c9605d Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/uthash-2.0.2/uthash_FNV_nondet_test2-1.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-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-memcleanup) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e277983cfe4b30513b023d34f2b840358d8a25fd7a5c39241cadd105379bfb92 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 05:53:40,321 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 05:53:40,387 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Default.epf [2025-02-08 05:53:40,394 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 05:53:40,394 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 05:53:40,418 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 05:53:40,419 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 05:53:40,419 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 05:53:40,420 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 05:53:40,420 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 05:53:40,420 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 05:53:40,420 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 05:53:40,420 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 05:53:40,421 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 05:53:40,421 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 05:53:40,421 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 05:53:40,421 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 05:53:40,421 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 05:53:40,421 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 05:53:40,421 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 05:53:40,421 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 05:53:40,422 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 05:53:40,422 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-02-08 05:53:40,422 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-02-08 05:53:40,422 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 05:53:40,422 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 05:53:40,422 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-08 05:53:40,422 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 05:53:40,422 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 05:53:40,422 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 05:53:40,423 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 05:53:40,423 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 05:53:40,423 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 05:53:40,423 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 05:53:40,423 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 05:53:40,423 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 05:53:40,423 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 05:53:40,424 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 05:53:40,424 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 05:53:40,424 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 05:53:40,424 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 05:53:40,424 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 05:53:40,424 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 05:53:40,424 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 05:53:40,424 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 05:53:40,425 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-memcleanup) ) 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 -> e277983cfe4b30513b023d34f2b840358d8a25fd7a5c39241cadd105379bfb92 [2025-02-08 05:53:40,690 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 05:53:40,702 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 05:53:40,704 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 05:53:40,706 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 05:53:40,706 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 05:53:40,708 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_FNV_nondet_test2-1.i [2025-02-08 05:53:41,968 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ea7c4ec51/d5e5fa714a844df883f91f0f9cc3dfe8/FLAG798f8ffa3 [2025-02-08 05:53:42,298 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 05:53:42,298 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_nondet_test2-1.i [2025-02-08 05:53:42,315 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ea7c4ec51/d5e5fa714a844df883f91f0f9cc3dfe8/FLAG798f8ffa3 [2025-02-08 05:53:42,327 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ea7c4ec51/d5e5fa714a844df883f91f0f9cc3dfe8 [2025-02-08 05:53:42,330 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 05:53:42,331 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 05:53:42,333 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 05:53:42,333 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 05:53:42,336 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 05:53:42,337 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 05:53:42" (1/1) ... [2025-02-08 05:53:42,339 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6340505d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:53:42, skipping insertion in model container [2025-02-08 05:53:42,339 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 05:53:42" (1/1) ... [2025-02-08 05:53:42,375 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 05:53:42,750 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 05:53:42,785 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 05:53:42,790 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 05:53:42,793 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 05:53:42,805 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 05:53:42,850 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 05:53:42,852 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 05:53:42,854 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 05:53:42,854 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 05:53:42,863 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 05:53:42,873 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 05:53:42,990 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 05:53:43,037 INFO L204 MainTranslator]: Completed translation [2025-02-08 05:53:43,037 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:53:43 WrapperNode [2025-02-08 05:53:43,038 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 05:53:43,040 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 05:53:43,040 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 05:53:43,040 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 05:53:43,045 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:53:43" (1/1) ... [2025-02-08 05:53:43,079 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:53:43" (1/1) ... [2025-02-08 05:53:43,151 INFO L138 Inliner]: procedures = 207, calls = 222, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 1241 [2025-02-08 05:53:43,152 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 05:53:43,152 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 05:53:43,152 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 05:53:43,153 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 05:53:43,163 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:53:43" (1/1) ... [2025-02-08 05:53:43,164 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:53:43" (1/1) ... [2025-02-08 05:53:43,172 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:53:43" (1/1) ... [2025-02-08 05:53:43,234 INFO L175 MemorySlicer]: Split 206 memory accesses to 3 slices as follows [2, 34, 170]. 83 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 46 writes are split as follows [0, 4, 42]. [2025-02-08 05:53:43,234 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:53:43" (1/1) ... [2025-02-08 05:53:43,234 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:53:43" (1/1) ... [2025-02-08 05:53:43,271 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:53:43" (1/1) ... [2025-02-08 05:53:43,278 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:53:43" (1/1) ... [2025-02-08 05:53:43,285 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:53:43" (1/1) ... [2025-02-08 05:53:43,294 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:53:43" (1/1) ... [2025-02-08 05:53:43,305 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 05:53:43,306 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 05:53:43,307 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 05:53:43,307 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 05:53:43,308 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:53:43" (1/1) ... [2025-02-08 05:53:43,312 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 05:53:43,324 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 05:53:43,341 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-08 05:53:43,344 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-08 05:53:43,367 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2025-02-08 05:53:43,367 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2025-02-08 05:53:43,367 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2025-02-08 05:53:43,367 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2025-02-08 05:53:43,368 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2025-02-08 05:53:43,368 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2025-02-08 05:53:43,368 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-08 05:53:43,368 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-02-08 05:53:43,368 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-02-08 05:53:43,368 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-02-08 05:53:43,368 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-08 05:53:43,368 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-08 05:53:43,368 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-08 05:53:43,369 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-08 05:53:43,369 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-08 05:53:43,369 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-08 05:53:43,369 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-08 05:53:43,369 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-08 05:53:43,369 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 05:53:43,369 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-02-08 05:53:43,369 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-02-08 05:53:43,369 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-02-08 05:53:43,370 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-08 05:53:43,370 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-08 05:53:43,370 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-08 05:53:43,370 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 05:53:43,370 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 05:53:43,561 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 05:53:43,562 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 05:53:44,747 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L812: call ULTIMATE.dealloc(main_~#i~0#1.base, main_~#i~0#1.offset);havoc main_~#i~0#1.base, main_~#i~0#1.offset; [2025-02-08 05:53:44,886 INFO L? ?]: Removed 296 outVars from TransFormulas that were not future-live. [2025-02-08 05:53:44,887 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 05:53:44,946 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 05:53:44,947 INFO L337 CfgBuilder]: Removed 1 assume(true) statements. [2025-02-08 05:53:44,947 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:53:44 BoogieIcfgContainer [2025-02-08 05:53:44,947 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 05:53:44,949 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 05:53:44,949 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 05:53:44,954 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 05:53:44,954 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 05:53:42" (1/3) ... [2025-02-08 05:53:44,955 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@693fccc6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 05:53:44, skipping insertion in model container [2025-02-08 05:53:44,955 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:53:43" (2/3) ... [2025-02-08 05:53:44,955 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@693fccc6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 05:53:44, skipping insertion in model container [2025-02-08 05:53:44,955 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:53:44" (3/3) ... [2025-02-08 05:53:44,958 INFO L128 eAbstractionObserver]: Analyzing ICFG uthash_FNV_nondet_test2-1.i [2025-02-08 05:53:44,973 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 05:53:44,975 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG uthash_FNV_nondet_test2-1.i that has 4 procedures, 372 locations, 1 initial locations, 33 loop locations, and 2 error locations. [2025-02-08 05:53:45,025 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 05:53:45,037 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;@619b94bd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 05:53:45,037 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-02-08 05:53:45,043 INFO L276 IsEmpty]: Start isEmpty. Operand has 364 states, 357 states have (on average 1.619047619047619) internal successors, (578), 359 states have internal predecessors, (578), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 05:53:45,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2025-02-08 05:53:45,048 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 05:53:45,049 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2025-02-08 05:53:45,049 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-02-08 05:53:45,053 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:53:45,054 INFO L85 PathProgramCache]: Analyzing trace with hash 661615, now seen corresponding path program 1 times [2025-02-08 05:53:45,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:53:45,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [200787255] [2025-02-08 05:53:45,061 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:53:45,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:53:45,131 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-08 05:53:45,146 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-08 05:53:45,148 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:53:45,148 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:53:45,286 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:53:45,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:53:45,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [200787255] [2025-02-08 05:53:45,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [200787255] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:53:45,288 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:53:45,289 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:53:45,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [374180728] [2025-02-08 05:53:45,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:53:45,293 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 05:53:45,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:53:45,313 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 05:53:45,314 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 05:53:45,318 INFO L87 Difference]: Start difference. First operand has 364 states, 357 states have (on average 1.619047619047619) internal successors, (578), 359 states have internal predecessors, (578), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:53:45,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 05:53:45,673 INFO L93 Difference]: Finished difference Result 526 states and 767 transitions. [2025-02-08 05:53:45,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 05:53:45,677 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2025-02-08 05:53:45,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 05:53:45,689 INFO L225 Difference]: With dead ends: 526 [2025-02-08 05:53:45,691 INFO L226 Difference]: Without dead ends: 522 [2025-02-08 05:53:45,693 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 05:53:45,695 INFO L435 NwaCegarLoop]: 476 mSDtfsCounter, 238 mSDsluCounter, 938 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 238 SdHoareTripleChecker+Valid, 1414 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-08 05:53:45,697 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [238 Valid, 1414 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-08 05:53:45,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 522 states. [2025-02-08 05:53:45,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 522 to 519. [2025-02-08 05:53:45,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 519 states, 513 states have (on average 1.4678362573099415) internal successors, (753), 514 states have internal predecessors, (753), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 05:53:45,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 519 states to 519 states and 759 transitions. [2025-02-08 05:53:45,755 INFO L78 Accepts]: Start accepts. Automaton has 519 states and 759 transitions. Word has length 3 [2025-02-08 05:53:45,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 05:53:45,756 INFO L471 AbstractCegarLoop]: Abstraction has 519 states and 759 transitions. [2025-02-08 05:53:45,756 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:53:45,756 INFO L276 IsEmpty]: Start isEmpty. Operand 519 states and 759 transitions. [2025-02-08 05:53:45,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-02-08 05:53:45,759 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 05:53:45,759 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:53:45,759 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 05:53:45,760 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-02-08 05:53:45,760 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:53:45,760 INFO L85 PathProgramCache]: Analyzing trace with hash 1540687687, now seen corresponding path program 1 times [2025-02-08 05:53:45,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:53:45,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [458727692] [2025-02-08 05:53:45,761 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:53:45,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:53:45,784 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-02-08 05:53:45,799 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-02-08 05:53:45,799 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:53:45,799 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:53:46,036 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:53:46,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:53:46,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [458727692] [2025-02-08 05:53:46,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [458727692] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:53:46,038 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:53:46,038 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 05:53:46,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1302349189] [2025-02-08 05:53:46,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:53:46,039 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 05:53:46,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:53:46,039 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 05:53:46,039 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 05:53:46,040 INFO L87 Difference]: Start difference. First operand 519 states and 759 transitions. Second operand has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:53:46,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 05:53:46,218 INFO L93 Difference]: Finished difference Result 525 states and 751 transitions. [2025-02-08 05:53:46,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 05:53:46,219 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 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 65 [2025-02-08 05:53:46,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 05:53:46,222 INFO L225 Difference]: With dead ends: 525 [2025-02-08 05:53:46,222 INFO L226 Difference]: Without dead ends: 525 [2025-02-08 05:53:46,222 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-08 05:53:46,224 INFO L435 NwaCegarLoop]: 456 mSDtfsCounter, 105 mSDsluCounter, 828 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 1284 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 05:53:46,224 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 1284 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 05:53:46,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 525 states. [2025-02-08 05:53:46,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 525 to 519. [2025-02-08 05:53:46,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 519 states, 513 states have (on average 1.4405458089668617) internal successors, (739), 514 states have internal predecessors, (739), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 05:53:46,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 519 states to 519 states and 745 transitions. [2025-02-08 05:53:46,257 INFO L78 Accepts]: Start accepts. Automaton has 519 states and 745 transitions. Word has length 65 [2025-02-08 05:53:46,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 05:53:46,257 INFO L471 AbstractCegarLoop]: Abstraction has 519 states and 745 transitions. [2025-02-08 05:53:46,257 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:53:46,257 INFO L276 IsEmpty]: Start isEmpty. Operand 519 states and 745 transitions. [2025-02-08 05:53:46,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-02-08 05:53:46,260 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 05:53:46,260 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:53:46,260 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 05:53:46,260 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-02-08 05:53:46,260 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:53:46,260 INFO L85 PathProgramCache]: Analyzing trace with hash 1392940128, now seen corresponding path program 1 times [2025-02-08 05:53:46,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:53:46,264 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [74784486] [2025-02-08 05:53:46,265 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:53:46,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:53:46,286 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-02-08 05:53:46,334 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-02-08 05:53:46,335 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:53:46,335 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:53:46,834 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:53:46,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:53:46,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [74784486] [2025-02-08 05:53:46,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [74784486] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:53:46,834 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:53:46,834 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-08 05:53:46,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2110255981] [2025-02-08 05:53:46,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:53:46,834 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 05:53:46,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:53:46,835 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 05:53:46,835 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-02-08 05:53:46,835 INFO L87 Difference]: Start difference. First operand 519 states and 745 transitions. Second operand has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 7 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:53:47,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 05:53:47,169 INFO L93 Difference]: Finished difference Result 716 states and 1028 transitions. [2025-02-08 05:53:47,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 05:53:47,170 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 7 states have internal predecessors, (65), 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 65 [2025-02-08 05:53:47,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 05:53:47,173 INFO L225 Difference]: With dead ends: 716 [2025-02-08 05:53:47,175 INFO L226 Difference]: Without dead ends: 713 [2025-02-08 05:53:47,175 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-02-08 05:53:47,178 INFO L435 NwaCegarLoop]: 461 mSDtfsCounter, 500 mSDsluCounter, 1827 mSDsCounter, 0 mSdLazyCounter, 297 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 503 SdHoareTripleChecker+Valid, 2288 SdHoareTripleChecker+Invalid, 299 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 297 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-08 05:53:47,178 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [503 Valid, 2288 Invalid, 299 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 297 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-08 05:53:47,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 713 states. [2025-02-08 05:53:47,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 713 to 363. [2025-02-08 05:53:47,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 363 states, 357 states have (on average 1.4369747899159664) internal successors, (513), 358 states have internal predecessors, (513), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 05:53:47,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363 states to 363 states and 519 transitions. [2025-02-08 05:53:47,192 INFO L78 Accepts]: Start accepts. Automaton has 363 states and 519 transitions. Word has length 65 [2025-02-08 05:53:47,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 05:53:47,193 INFO L471 AbstractCegarLoop]: Abstraction has 363 states and 519 transitions. [2025-02-08 05:53:47,193 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 7 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:53:47,193 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 519 transitions. [2025-02-08 05:53:47,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-02-08 05:53:47,195 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 05:53:47,195 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:53:47,196 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 05:53:47,196 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-02-08 05:53:47,196 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:53:47,196 INFO L85 PathProgramCache]: Analyzing trace with hash 1317434251, now seen corresponding path program 1 times [2025-02-08 05:53:47,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:53:47,197 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [689656256] [2025-02-08 05:53:47,197 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:53:47,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:53:47,238 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-02-08 05:53:47,245 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-02-08 05:53:47,245 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:53:47,245 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:53:47,467 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:53:47,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:53:47,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [689656256] [2025-02-08 05:53:47,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [689656256] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:53:47,468 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:53:47,468 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:53:47,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [39274548] [2025-02-08 05:53:47,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:53:47,469 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 05:53:47,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:53:47,469 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 05:53:47,469 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-08 05:53:47,469 INFO L87 Difference]: Start difference. First operand 363 states and 519 transitions. Second operand has 5 states, 5 states have (on average 16.8) internal successors, (84), 5 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:53:47,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 05:53:47,625 INFO L93 Difference]: Finished difference Result 366 states and 515 transitions. [2025-02-08 05:53:47,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 05:53:47,626 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.8) internal successors, (84), 5 states have internal predecessors, (84), 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 84 [2025-02-08 05:53:47,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 05:53:47,628 INFO L225 Difference]: With dead ends: 366 [2025-02-08 05:53:47,628 INFO L226 Difference]: Without dead ends: 366 [2025-02-08 05:53:47,628 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-08 05:53:47,629 INFO L435 NwaCegarLoop]: 449 mSDtfsCounter, 108 mSDsluCounter, 814 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 1263 SdHoareTripleChecker+Invalid, 183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 05:53:47,629 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 1263 Invalid, 183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 05:53:47,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2025-02-08 05:53:47,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 363. [2025-02-08 05:53:47,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 363 states, 357 states have (on average 1.4173669467787116) internal successors, (506), 358 states have internal predecessors, (506), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 05:53:47,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363 states to 363 states and 512 transitions. [2025-02-08 05:53:47,644 INFO L78 Accepts]: Start accepts. Automaton has 363 states and 512 transitions. Word has length 84 [2025-02-08 05:53:47,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 05:53:47,644 INFO L471 AbstractCegarLoop]: Abstraction has 363 states and 512 transitions. [2025-02-08 05:53:47,644 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.8) internal successors, (84), 5 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:53:47,645 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 512 transitions. [2025-02-08 05:53:47,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-02-08 05:53:47,648 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 05:53:47,648 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:53:47,648 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 05:53:47,649 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-02-08 05:53:47,649 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:53:47,649 INFO L85 PathProgramCache]: Analyzing trace with hash 586055941, now seen corresponding path program 1 times [2025-02-08 05:53:47,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:53:47,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1064636595] [2025-02-08 05:53:47,650 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:53:47,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:53:47,703 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-02-08 05:53:47,719 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-02-08 05:53:47,719 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:53:47,720 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:53:47,831 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:53:47,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:53:47,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1064636595] [2025-02-08 05:53:47,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1064636595] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:53:47,833 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:53:47,833 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:53:47,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1603023080] [2025-02-08 05:53:47,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:53:47,834 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:53:47,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:53:47,834 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:53:47,834 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:53:47,835 INFO L87 Difference]: Start difference. First operand 363 states and 512 transitions. Second operand has 3 states, 3 states have (on average 28.0) internal successors, (84), 2 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:53:48,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 05:53:48,008 INFO L93 Difference]: Finished difference Result 631 states and 898 transitions. [2025-02-08 05:53:48,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:53:48,008 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 2 states have internal predecessors, (84), 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 84 [2025-02-08 05:53:48,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 05:53:48,012 INFO L225 Difference]: With dead ends: 631 [2025-02-08 05:53:48,013 INFO L226 Difference]: Without dead ends: 631 [2025-02-08 05:53:48,013 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:53:48,013 INFO L435 NwaCegarLoop]: 639 mSDtfsCounter, 332 mSDsluCounter, 454 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 332 SdHoareTripleChecker+Valid, 1093 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 05:53:48,014 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [332 Valid, 1093 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 05:53:48,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 631 states. [2025-02-08 05:53:48,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 631 to 625. [2025-02-08 05:53:48,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 625 states, 619 states have (on average 1.4345718901453959) internal successors, (888), 620 states have internal predecessors, (888), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 05:53:48,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 625 states to 625 states and 894 transitions. [2025-02-08 05:53:48,034 INFO L78 Accepts]: Start accepts. Automaton has 625 states and 894 transitions. Word has length 84 [2025-02-08 05:53:48,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 05:53:48,035 INFO L471 AbstractCegarLoop]: Abstraction has 625 states and 894 transitions. [2025-02-08 05:53:48,035 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 2 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:53:48,036 INFO L276 IsEmpty]: Start isEmpty. Operand 625 states and 894 transitions. [2025-02-08 05:53:48,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-02-08 05:53:48,037 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 05:53:48,037 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:53:48,037 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 05:53:48,037 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-02-08 05:53:48,038 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:53:48,038 INFO L85 PathProgramCache]: Analyzing trace with hash -1402310795, now seen corresponding path program 1 times [2025-02-08 05:53:48,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:53:48,038 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1552619525] [2025-02-08 05:53:48,038 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:53:48,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:53:48,096 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-02-08 05:53:48,355 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-02-08 05:53:48,357 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:53:48,357 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:53:48,615 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 05:53:48,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:53:48,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1552619525] [2025-02-08 05:53:48,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1552619525] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 05:53:48,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1247622804] [2025-02-08 05:53:48,616 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:53:48,616 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 05:53:48,616 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 05:53:48,620 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 05:53:48,622 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-08 05:53:48,805 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-02-08 05:53:48,900 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-02-08 05:53:48,901 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:53:48,901 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:53:48,908 INFO L256 TraceCheckSpWp]: Trace formula consists of 589 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-02-08 05:53:48,916 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 05:53:48,943 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-02-08 05:53:48,967 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 16 treesize of output 17 [2025-02-08 05:53:49,836 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-08 05:53:49,836 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 05:53:49,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1247622804] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:53:49,836 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 05:53:49,837 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [4] total 13 [2025-02-08 05:53:49,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [869625] [2025-02-08 05:53:49,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:53:49,837 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-08 05:53:49,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:53:49,840 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-08 05:53:49,840 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2025-02-08 05:53:49,841 INFO L87 Difference]: Start difference. First operand 625 states and 894 transitions. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 05:53:51,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 05:53:51,831 INFO L93 Difference]: Finished difference Result 899 states and 1271 transitions. [2025-02-08 05:53:51,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-08 05:53:51,831 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 99 [2025-02-08 05:53:51,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 05:53:51,836 INFO L225 Difference]: With dead ends: 899 [2025-02-08 05:53:51,836 INFO L226 Difference]: Without dead ends: 899 [2025-02-08 05:53:51,836 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=99, Invalid=321, Unknown=0, NotChecked=0, Total=420 [2025-02-08 05:53:51,837 INFO L435 NwaCegarLoop]: 496 mSDtfsCounter, 765 mSDsluCounter, 2282 mSDsCounter, 0 mSdLazyCounter, 1153 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 767 SdHoareTripleChecker+Valid, 2778 SdHoareTripleChecker+Invalid, 1158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-02-08 05:53:51,838 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [767 Valid, 2778 Invalid, 1158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1153 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-02-08 05:53:51,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 899 states. [2025-02-08 05:53:51,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 899 to 650. [2025-02-08 05:53:51,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 650 states, 644 states have (on average 1.4254658385093169) internal successors, (918), 645 states have internal predecessors, (918), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 05:53:51,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 650 states to 650 states and 924 transitions. [2025-02-08 05:53:51,858 INFO L78 Accepts]: Start accepts. Automaton has 650 states and 924 transitions. Word has length 99 [2025-02-08 05:53:51,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 05:53:51,859 INFO L471 AbstractCegarLoop]: Abstraction has 650 states and 924 transitions. [2025-02-08 05:53:51,859 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 05:53:51,859 INFO L276 IsEmpty]: Start isEmpty. Operand 650 states and 924 transitions. [2025-02-08 05:53:51,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-02-08 05:53:51,863 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 05:53:51,863 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:53:51,874 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-08 05:53:52,064 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-02-08 05:53:52,064 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-02-08 05:53:52,064 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:53:52,065 INFO L85 PathProgramCache]: Analyzing trace with hash -103711961, now seen corresponding path program 1 times [2025-02-08 05:53:52,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:53:52,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [28781526] [2025-02-08 05:53:52,065 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:53:52,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:53:52,106 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-02-08 05:53:52,230 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-02-08 05:53:52,233 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:53:52,233 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:53:52,437 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 05:53:52,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:53:52,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [28781526] [2025-02-08 05:53:52,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [28781526] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 05:53:52,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [396513150] [2025-02-08 05:53:52,438 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:53:52,438 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 05:53:52,438 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 05:53:52,440 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 05:53:52,443 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-08 05:53:52,637 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-02-08 05:53:52,752 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-02-08 05:53:52,752 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:53:52,752 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:53:52,755 INFO L256 TraceCheckSpWp]: Trace formula consists of 590 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-02-08 05:53:52,759 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 05:53:52,764 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-02-08 05:53:52,779 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 7 treesize of output 3 [2025-02-08 05:53:52,989 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-02-08 05:53:53,024 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-08 05:53:53,025 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 05:53:53,277 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-08 05:53:53,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [396513150] provided 1 perfect and 1 imperfect interpolant sequences [2025-02-08 05:53:53,277 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-02-08 05:53:53,278 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [4, 7] total 11 [2025-02-08 05:53:53,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [923387046] [2025-02-08 05:53:53,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:53:53,278 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 05:53:53,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:53:53,280 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 05:53:53,280 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2025-02-08 05:53:53,280 INFO L87 Difference]: Start difference. First operand 650 states and 924 transitions. Second operand has 5 states, 5 states have (on average 18.6) internal successors, (93), 5 states have internal predecessors, (93), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 05:53:53,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 05:53:53,496 INFO L93 Difference]: Finished difference Result 814 states and 1157 transitions. [2025-02-08 05:53:53,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 05:53:53,497 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.6) internal successors, (93), 5 states have internal predecessors, (93), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 100 [2025-02-08 05:53:53,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 05:53:53,502 INFO L225 Difference]: With dead ends: 814 [2025-02-08 05:53:53,504 INFO L226 Difference]: Without dead ends: 814 [2025-02-08 05:53:53,504 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 192 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2025-02-08 05:53:53,505 INFO L435 NwaCegarLoop]: 459 mSDtfsCounter, 862 mSDsluCounter, 902 mSDsCounter, 0 mSdLazyCounter, 174 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 863 SdHoareTripleChecker+Valid, 1361 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 05:53:53,505 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [863 Valid, 1361 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 174 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 05:53:53,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 814 states. [2025-02-08 05:53:53,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 814 to 652. [2025-02-08 05:53:53,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 652 states, 646 states have (on average 1.4241486068111455) internal successors, (920), 647 states have internal predecessors, (920), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 05:53:53,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 652 states to 652 states and 926 transitions. [2025-02-08 05:53:53,522 INFO L78 Accepts]: Start accepts. Automaton has 652 states and 926 transitions. Word has length 100 [2025-02-08 05:53:53,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 05:53:53,523 INFO L471 AbstractCegarLoop]: Abstraction has 652 states and 926 transitions. [2025-02-08 05:53:53,523 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.6) internal successors, (93), 5 states have internal predecessors, (93), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 05:53:53,523 INFO L276 IsEmpty]: Start isEmpty. Operand 652 states and 926 transitions. [2025-02-08 05:53:53,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-02-08 05:53:53,525 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 05:53:53,525 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:53:53,536 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-02-08 05:53:53,726 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-02-08 05:53:53,726 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-02-08 05:53:53,727 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:53:53,727 INFO L85 PathProgramCache]: Analyzing trace with hash 337983586, now seen corresponding path program 1 times [2025-02-08 05:53:53,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:53:53,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [452872889] [2025-02-08 05:53:53,727 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:53:53,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:53:53,769 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-02-08 05:53:53,792 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-02-08 05:53:53,793 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:53:53,793 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:53:53,960 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-08 05:53:53,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:53:53,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [452872889] [2025-02-08 05:53:53,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [452872889] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:53:53,960 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:53:53,961 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:53:53,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [769735048] [2025-02-08 05:53:53,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:53:53,961 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 05:53:53,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:53:53,962 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 05:53:53,962 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-08 05:53:53,962 INFO L87 Difference]: Start difference. First operand 652 states and 926 transitions. Second operand has 5 states, 5 states have (on average 29.8) internal successors, (149), 5 states have internal predecessors, (149), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 05:53:54,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 05:53:54,411 INFO L93 Difference]: Finished difference Result 736 states and 1033 transitions. [2025-02-08 05:53:54,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 05:53:54,411 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 29.8) internal successors, (149), 5 states have internal predecessors, (149), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 156 [2025-02-08 05:53:54,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 05:53:54,415 INFO L225 Difference]: With dead ends: 736 [2025-02-08 05:53:54,416 INFO L226 Difference]: Without dead ends: 736 [2025-02-08 05:53:54,416 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-02-08 05:53:54,416 INFO L435 NwaCegarLoop]: 597 mSDtfsCounter, 1152 mSDsluCounter, 778 mSDsCounter, 0 mSdLazyCounter, 234 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1153 SdHoareTripleChecker+Valid, 1375 SdHoareTripleChecker+Invalid, 237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 234 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-08 05:53:54,417 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1153 Valid, 1375 Invalid, 237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 234 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-08 05:53:54,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 736 states. [2025-02-08 05:53:54,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 736 to 518. [2025-02-08 05:53:54,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 518 states, 512 states have (on average 1.412109375) internal successors, (723), 513 states have internal predecessors, (723), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 05:53:54,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 518 states to 518 states and 729 transitions. [2025-02-08 05:53:54,430 INFO L78 Accepts]: Start accepts. Automaton has 518 states and 729 transitions. Word has length 156 [2025-02-08 05:53:54,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 05:53:54,430 INFO L471 AbstractCegarLoop]: Abstraction has 518 states and 729 transitions. [2025-02-08 05:53:54,430 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 29.8) internal successors, (149), 5 states have internal predecessors, (149), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 05:53:54,430 INFO L276 IsEmpty]: Start isEmpty. Operand 518 states and 729 transitions. [2025-02-08 05:53:54,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2025-02-08 05:53:54,432 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 05:53:54,432 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:53:54,432 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-08 05:53:54,432 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-02-08 05:53:54,433 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:53:54,433 INFO L85 PathProgramCache]: Analyzing trace with hash 1071288532, now seen corresponding path program 1 times [2025-02-08 05:53:54,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:53:54,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939779652] [2025-02-08 05:53:54,433 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:53:54,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:53:54,492 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-02-08 05:53:54,706 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-02-08 05:53:54,707 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:53:54,707 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:53:54,987 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 05:53:54,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:53:54,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [939779652] [2025-02-08 05:53:54,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [939779652] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 05:53:54,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1437820586] [2025-02-08 05:53:54,987 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:53:54,987 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 05:53:54,987 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 05:53:54,992 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 05:53:54,997 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-08 05:53:55,207 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-02-08 05:53:55,357 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-02-08 05:53:55,357 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:53:55,357 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:53:55,366 INFO L256 TraceCheckSpWp]: Trace formula consists of 771 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-02-08 05:53:55,371 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 05:53:55,431 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-08 05:53:55,431 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 05:53:55,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1437820586] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:53:55,431 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 05:53:55,431 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2025-02-08 05:53:55,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [849472306] [2025-02-08 05:53:55,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:53:55,432 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 05:53:55,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:53:55,432 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 05:53:55,432 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-08 05:53:55,433 INFO L87 Difference]: Start difference. First operand 518 states and 729 transitions. Second operand has 4 states, 4 states have (on average 39.75) internal successors, (159), 4 states have internal predecessors, (159), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 05:53:55,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 05:53:55,701 INFO L93 Difference]: Finished difference Result 561 states and 786 transitions. [2025-02-08 05:53:55,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 05:53:55,701 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 39.75) internal successors, (159), 4 states have internal predecessors, (159), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 166 [2025-02-08 05:53:55,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 05:53:55,704 INFO L225 Difference]: With dead ends: 561 [2025-02-08 05:53:55,704 INFO L226 Difference]: Without dead ends: 561 [2025-02-08 05:53:55,704 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 165 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-08 05:53:55,704 INFO L435 NwaCegarLoop]: 460 mSDtfsCounter, 17 mSDsluCounter, 754 mSDsCounter, 0 mSdLazyCounter, 314 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 1214 SdHoareTripleChecker+Invalid, 314 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 314 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-08 05:53:55,705 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 1214 Invalid, 314 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 314 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-08 05:53:55,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 561 states. [2025-02-08 05:53:55,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 561 to 545. [2025-02-08 05:53:55,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 545 states, 539 states have (on average 1.4025974025974026) internal successors, (756), 540 states have internal predecessors, (756), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 05:53:55,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 545 states to 545 states and 762 transitions. [2025-02-08 05:53:55,716 INFO L78 Accepts]: Start accepts. Automaton has 545 states and 762 transitions. Word has length 166 [2025-02-08 05:53:55,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 05:53:55,716 INFO L471 AbstractCegarLoop]: Abstraction has 545 states and 762 transitions. [2025-02-08 05:53:55,716 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 39.75) internal successors, (159), 4 states have internal predecessors, (159), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 05:53:55,717 INFO L276 IsEmpty]: Start isEmpty. Operand 545 states and 762 transitions. [2025-02-08 05:53:55,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2025-02-08 05:53:55,718 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 05:53:55,718 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:53:55,728 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-02-08 05:53:55,923 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 05:53:55,923 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-02-08 05:53:55,924 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:53:55,924 INFO L85 PathProgramCache]: Analyzing trace with hash -833186497, now seen corresponding path program 1 times [2025-02-08 05:53:55,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:53:55,924 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1744057500] [2025-02-08 05:53:55,924 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:53:55,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:53:55,966 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-02-08 05:53:56,000 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-02-08 05:53:56,000 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:53:56,000 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:53:56,322 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-08 05:53:56,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:53:56,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1744057500] [2025-02-08 05:53:56,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1744057500] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:53:56,323 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:53:56,323 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-08 05:53:56,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2002925377] [2025-02-08 05:53:56,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:53:56,323 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 05:53:56,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:53:56,324 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 05:53:56,325 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-08 05:53:56,325 INFO L87 Difference]: Start difference. First operand 545 states and 762 transitions. Second operand has 6 states, 6 states have (on average 26.666666666666668) internal successors, (160), 6 states have internal predecessors, (160), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 05:53:56,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 05:53:56,807 INFO L93 Difference]: Finished difference Result 557 states and 776 transitions. [2025-02-08 05:53:56,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 05:53:56,808 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 26.666666666666668) internal successors, (160), 6 states have internal predecessors, (160), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 167 [2025-02-08 05:53:56,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 05:53:56,810 INFO L225 Difference]: With dead ends: 557 [2025-02-08 05:53:56,810 INFO L226 Difference]: Without dead ends: 557 [2025-02-08 05:53:56,810 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-08 05:53:56,811 INFO L435 NwaCegarLoop]: 459 mSDtfsCounter, 8 mSDsluCounter, 1051 mSDsCounter, 0 mSdLazyCounter, 561 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 1510 SdHoareTripleChecker+Invalid, 562 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 561 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-08 05:53:56,811 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 1510 Invalid, 562 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 561 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-08 05:53:56,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 557 states. [2025-02-08 05:53:56,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 557 to 553. [2025-02-08 05:53:56,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 553 states, 547 states have (on average 1.40036563071298) internal successors, (766), 548 states have internal predecessors, (766), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 05:53:56,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 553 states to 553 states and 772 transitions. [2025-02-08 05:53:56,821 INFO L78 Accepts]: Start accepts. Automaton has 553 states and 772 transitions. Word has length 167 [2025-02-08 05:53:56,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 05:53:56,822 INFO L471 AbstractCegarLoop]: Abstraction has 553 states and 772 transitions. [2025-02-08 05:53:56,822 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 26.666666666666668) internal successors, (160), 6 states have internal predecessors, (160), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 05:53:56,822 INFO L276 IsEmpty]: Start isEmpty. Operand 553 states and 772 transitions. [2025-02-08 05:53:56,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2025-02-08 05:53:56,824 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 05:53:56,824 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:53:56,824 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-08 05:53:56,824 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-02-08 05:53:56,825 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:53:56,825 INFO L85 PathProgramCache]: Analyzing trace with hash 1673234416, now seen corresponding path program 1 times [2025-02-08 05:53:56,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:53:56,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1876457101] [2025-02-08 05:53:56,825 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:53:56,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:53:56,870 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-02-08 05:53:56,909 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-02-08 05:53:56,910 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:53:56,910 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:53:57,208 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-08 05:53:57,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:53:57,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1876457101] [2025-02-08 05:53:57,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1876457101] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:53:57,209 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:53:57,209 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-08 05:53:57,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [407088341] [2025-02-08 05:53:57,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:53:57,210 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 05:53:57,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:53:57,210 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 05:53:57,211 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-08 05:53:57,211 INFO L87 Difference]: Start difference. First operand 553 states and 772 transitions. Second operand has 7 states, 7 states have (on average 23.0) internal successors, (161), 7 states have internal predecessors, (161), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 05:53:57,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 05:53:57,849 INFO L93 Difference]: Finished difference Result 575 states and 802 transitions. [2025-02-08 05:53:57,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 05:53:57,849 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 23.0) internal successors, (161), 7 states have internal predecessors, (161), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 168 [2025-02-08 05:53:57,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 05:53:57,852 INFO L225 Difference]: With dead ends: 575 [2025-02-08 05:53:57,852 INFO L226 Difference]: Without dead ends: 575 [2025-02-08 05:53:57,852 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-08 05:53:57,853 INFO L435 NwaCegarLoop]: 451 mSDtfsCounter, 12 mSDsluCounter, 1708 mSDsCounter, 0 mSdLazyCounter, 899 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 2159 SdHoareTripleChecker+Invalid, 900 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 899 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-08 05:53:57,853 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 2159 Invalid, 900 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 899 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-08 05:53:57,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 575 states. [2025-02-08 05:53:57,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 575 to 569. [2025-02-08 05:53:57,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 569 states, 563 states have (on average 1.3996447602131439) internal successors, (788), 564 states have internal predecessors, (788), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 05:53:57,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 569 states to 569 states and 794 transitions. [2025-02-08 05:53:57,865 INFO L78 Accepts]: Start accepts. Automaton has 569 states and 794 transitions. Word has length 168 [2025-02-08 05:53:57,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 05:53:57,865 INFO L471 AbstractCegarLoop]: Abstraction has 569 states and 794 transitions. [2025-02-08 05:53:57,866 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 23.0) internal successors, (161), 7 states have internal predecessors, (161), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 05:53:57,866 INFO L276 IsEmpty]: Start isEmpty. Operand 569 states and 794 transitions. [2025-02-08 05:53:57,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2025-02-08 05:53:57,868 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 05:53:57,868 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:53:57,868 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-08 05:53:57,869 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-02-08 05:53:57,869 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:53:57,869 INFO L85 PathProgramCache]: Analyzing trace with hash 1995430609, now seen corresponding path program 1 times [2025-02-08 05:53:57,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:53:57,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [453922186] [2025-02-08 05:53:57,869 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:53:57,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:53:57,922 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-02-08 05:53:58,098 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-02-08 05:53:58,098 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:53:58,098 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:53:58,299 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 05:53:58,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:53:58,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [453922186] [2025-02-08 05:53:58,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [453922186] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 05:53:58,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [120267795] [2025-02-08 05:53:58,300 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:53:58,300 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 05:53:58,300 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 05:53:58,302 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 05:53:58,304 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-08 05:53:58,550 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-02-08 05:53:58,709 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-02-08 05:53:58,709 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:53:58,709 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:53:58,718 INFO L256 TraceCheckSpWp]: Trace formula consists of 770 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-02-08 05:53:58,723 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 05:53:58,740 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-02-08 05:53:59,324 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-08 05:53:59,325 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 05:53:59,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [120267795] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:53:59,325 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 05:53:59,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [4] total 12 [2025-02-08 05:53:59,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1386481790] [2025-02-08 05:53:59,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:53:59,325 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-08 05:53:59,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:53:59,326 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-08 05:53:59,326 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2025-02-08 05:53:59,326 INFO L87 Difference]: Start difference. First operand 569 states and 794 transitions. Second operand has 10 states, 10 states have (on average 16.0) internal successors, (160), 10 states have internal predecessors, (160), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 05:54:00,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 05:54:00,390 INFO L93 Difference]: Finished difference Result 825 states and 1148 transitions. [2025-02-08 05:54:00,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-08 05:54:00,390 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 16.0) internal successors, (160), 10 states have internal predecessors, (160), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 168 [2025-02-08 05:54:00,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 05:54:00,394 INFO L225 Difference]: With dead ends: 825 [2025-02-08 05:54:00,394 INFO L226 Difference]: Without dead ends: 825 [2025-02-08 05:54:00,395 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 161 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=79, Invalid=263, Unknown=0, NotChecked=0, Total=342 [2025-02-08 05:54:00,396 INFO L435 NwaCegarLoop]: 506 mSDtfsCounter, 548 mSDsluCounter, 1611 mSDsCounter, 0 mSdLazyCounter, 693 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 551 SdHoareTripleChecker+Valid, 2117 SdHoareTripleChecker+Invalid, 694 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 693 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-08 05:54:00,396 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [551 Valid, 2117 Invalid, 694 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 693 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-08 05:54:00,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 825 states. [2025-02-08 05:54:00,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 825 to 597. [2025-02-08 05:54:00,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 597 states, 591 states have (on average 1.38917089678511) internal successors, (821), 592 states have internal predecessors, (821), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 05:54:00,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 597 states to 597 states and 827 transitions. [2025-02-08 05:54:00,410 INFO L78 Accepts]: Start accepts. Automaton has 597 states and 827 transitions. Word has length 168 [2025-02-08 05:54:00,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 05:54:00,410 INFO L471 AbstractCegarLoop]: Abstraction has 597 states and 827 transitions. [2025-02-08 05:54:00,410 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 16.0) internal successors, (160), 10 states have internal predecessors, (160), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 05:54:00,410 INFO L276 IsEmpty]: Start isEmpty. Operand 597 states and 827 transitions. [2025-02-08 05:54:00,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2025-02-08 05:54:00,412 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 05:54:00,412 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:54:00,424 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-02-08 05:54:00,613 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,SelfDestructingSolverStorable11 [2025-02-08 05:54:00,614 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-02-08 05:54:00,615 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:54:00,615 INFO L85 PathProgramCache]: Analyzing trace with hash 448814689, now seen corresponding path program 1 times [2025-02-08 05:54:00,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:54:00,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1640677177] [2025-02-08 05:54:00,615 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:54:00,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:54:00,663 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 169 statements into 1 equivalence classes. [2025-02-08 05:54:00,820 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 169 of 169 statements. [2025-02-08 05:54:00,820 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:54:00,820 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:54:01,061 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 05:54:01,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:54:01,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1640677177] [2025-02-08 05:54:01,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1640677177] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 05:54:01,062 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1017726333] [2025-02-08 05:54:01,062 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:54:01,062 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 05:54:01,062 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 05:54:01,064 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 05:54:01,066 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-08 05:54:01,336 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 169 statements into 1 equivalence classes. [2025-02-08 05:54:01,431 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 169 of 169 statements. [2025-02-08 05:54:01,431 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:54:01,431 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:54:01,435 INFO L256 TraceCheckSpWp]: Trace formula consists of 771 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-02-08 05:54:01,439 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 05:54:01,537 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-08 05:54:01,538 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 05:54:01,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1017726333] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:54:01,539 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 05:54:01,539 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [4] total 8 [2025-02-08 05:54:01,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1536817237] [2025-02-08 05:54:01,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:54:01,540 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 05:54:01,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:54:01,540 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 05:54:01,540 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-08 05:54:01,540 INFO L87 Difference]: Start difference. First operand 597 states and 827 transitions. Second operand has 6 states, 6 states have (on average 26.833333333333332) internal successors, (161), 6 states have internal predecessors, (161), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 05:54:02,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 05:54:02,002 INFO L93 Difference]: Finished difference Result 637 states and 879 transitions. [2025-02-08 05:54:02,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 05:54:02,002 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 26.833333333333332) internal successors, (161), 6 states have internal predecessors, (161), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 169 [2025-02-08 05:54:02,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 05:54:02,004 INFO L225 Difference]: With dead ends: 637 [2025-02-08 05:54:02,005 INFO L226 Difference]: Without dead ends: 637 [2025-02-08 05:54:02,005 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 166 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-08 05:54:02,005 INFO L435 NwaCegarLoop]: 452 mSDtfsCounter, 34 mSDsluCounter, 1476 mSDsCounter, 0 mSdLazyCounter, 623 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 1928 SdHoareTripleChecker+Invalid, 623 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 623 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-08 05:54:02,005 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 1928 Invalid, 623 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 623 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-08 05:54:02,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 637 states. [2025-02-08 05:54:02,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 637 to 623. [2025-02-08 05:54:02,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 623 states, 617 states have (on average 1.3824959481361425) internal successors, (853), 618 states have internal predecessors, (853), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 05:54:02,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 623 states to 623 states and 859 transitions. [2025-02-08 05:54:02,018 INFO L78 Accepts]: Start accepts. Automaton has 623 states and 859 transitions. Word has length 169 [2025-02-08 05:54:02,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 05:54:02,018 INFO L471 AbstractCegarLoop]: Abstraction has 623 states and 859 transitions. [2025-02-08 05:54:02,019 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 26.833333333333332) internal successors, (161), 6 states have internal predecessors, (161), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 05:54:02,019 INFO L276 IsEmpty]: Start isEmpty. Operand 623 states and 859 transitions. [2025-02-08 05:54:02,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2025-02-08 05:54:02,020 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 05:54:02,021 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:54:02,035 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-02-08 05:54:02,221 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,SelfDestructingSolverStorable12 [2025-02-08 05:54:02,221 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-02-08 05:54:02,222 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:54:02,222 INFO L85 PathProgramCache]: Analyzing trace with hash 1859521940, now seen corresponding path program 1 times [2025-02-08 05:54:02,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:54:02,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1535129505] [2025-02-08 05:54:02,222 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:54:02,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:54:02,269 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes. [2025-02-08 05:54:02,293 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements. [2025-02-08 05:54:02,294 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:54:02,294 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:54:02,563 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-08 05:54:02,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:54:02,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1535129505] [2025-02-08 05:54:02,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1535129505] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:54:02,564 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:54:02,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-08 05:54:02,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1151266796] [2025-02-08 05:54:02,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:54:02,564 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 05:54:02,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:54:02,565 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 05:54:02,565 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-08 05:54:02,565 INFO L87 Difference]: Start difference. First operand 623 states and 859 transitions. Second operand has 6 states, 6 states have (on average 27.0) internal successors, (162), 6 states have internal predecessors, (162), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 05:54:03,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 05:54:03,084 INFO L93 Difference]: Finished difference Result 629 states and 866 transitions. [2025-02-08 05:54:03,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 05:54:03,084 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 27.0) internal successors, (162), 6 states have internal predecessors, (162), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 170 [2025-02-08 05:54:03,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 05:54:03,087 INFO L225 Difference]: With dead ends: 629 [2025-02-08 05:54:03,087 INFO L226 Difference]: Without dead ends: 629 [2025-02-08 05:54:03,087 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-08 05:54:03,088 INFO L435 NwaCegarLoop]: 459 mSDtfsCounter, 8 mSDsluCounter, 1364 mSDsCounter, 0 mSdLazyCounter, 725 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 1823 SdHoareTripleChecker+Invalid, 726 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 725 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-08 05:54:03,088 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 1823 Invalid, 726 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 725 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-08 05:54:03,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 629 states. [2025-02-08 05:54:03,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 629 to 627. [2025-02-08 05:54:03,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 627 states, 621 states have (on average 1.3816425120772946) internal successors, (858), 622 states have internal predecessors, (858), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 05:54:03,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 627 states to 627 states and 864 transitions. [2025-02-08 05:54:03,102 INFO L78 Accepts]: Start accepts. Automaton has 627 states and 864 transitions. Word has length 170 [2025-02-08 05:54:03,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 05:54:03,102 INFO L471 AbstractCegarLoop]: Abstraction has 627 states and 864 transitions. [2025-02-08 05:54:03,102 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 27.0) internal successors, (162), 6 states have internal predecessors, (162), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 05:54:03,103 INFO L276 IsEmpty]: Start isEmpty. Operand 627 states and 864 transitions. [2025-02-08 05:54:03,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2025-02-08 05:54:03,104 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 05:54:03,104 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:54:03,105 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-08 05:54:03,105 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-02-08 05:54:03,105 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:54:03,105 INFO L85 PathProgramCache]: Analyzing trace with hash 1149157509, now seen corresponding path program 1 times [2025-02-08 05:54:03,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:54:03,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429478389] [2025-02-08 05:54:03,106 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:54:03,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:54:03,149 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 171 statements into 1 equivalence classes. [2025-02-08 05:54:03,175 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 171 of 171 statements. [2025-02-08 05:54:03,175 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:54:03,175 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:54:03,411 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-08 05:54:03,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:54:03,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1429478389] [2025-02-08 05:54:03,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1429478389] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:54:03,412 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:54:03,412 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-08 05:54:03,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1297669891] [2025-02-08 05:54:03,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:54:03,413 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 05:54:03,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:54:03,413 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 05:54:03,413 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-08 05:54:03,413 INFO L87 Difference]: Start difference. First operand 627 states and 864 transitions. Second operand has 7 states, 7 states have (on average 23.285714285714285) internal successors, (163), 7 states have internal predecessors, (163), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 05:54:04,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 05:54:04,060 INFO L93 Difference]: Finished difference Result 638 states and 879 transitions. [2025-02-08 05:54:04,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 05:54:04,061 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 23.285714285714285) internal successors, (163), 7 states have internal predecessors, (163), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 171 [2025-02-08 05:54:04,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 05:54:04,063 INFO L225 Difference]: With dead ends: 638 [2025-02-08 05:54:04,063 INFO L226 Difference]: Without dead ends: 638 [2025-02-08 05:54:04,063 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-08 05:54:04,064 INFO L435 NwaCegarLoop]: 451 mSDtfsCounter, 12 mSDsluCounter, 1708 mSDsCounter, 0 mSdLazyCounter, 899 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 2159 SdHoareTripleChecker+Invalid, 900 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 899 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-08 05:54:04,064 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 2159 Invalid, 900 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 899 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-08 05:54:04,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 638 states. [2025-02-08 05:54:04,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 638 to 635. [2025-02-08 05:54:04,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 635 states, 629 states have (on average 1.381558028616852) internal successors, (869), 630 states have internal predecessors, (869), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 05:54:04,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 635 states to 635 states and 875 transitions. [2025-02-08 05:54:04,077 INFO L78 Accepts]: Start accepts. Automaton has 635 states and 875 transitions. Word has length 171 [2025-02-08 05:54:04,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 05:54:04,078 INFO L471 AbstractCegarLoop]: Abstraction has 635 states and 875 transitions. [2025-02-08 05:54:04,078 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 23.285714285714285) internal successors, (163), 7 states have internal predecessors, (163), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 05:54:04,078 INFO L276 IsEmpty]: Start isEmpty. Operand 635 states and 875 transitions. [2025-02-08 05:54:04,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2025-02-08 05:54:04,080 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 05:54:04,080 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:54:04,080 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-08 05:54:04,080 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-02-08 05:54:04,081 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:54:04,081 INFO L85 PathProgramCache]: Analyzing trace with hash -1851828364, now seen corresponding path program 1 times [2025-02-08 05:54:04,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:54:04,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [39359853] [2025-02-08 05:54:04,081 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:54:04,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:54:04,121 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 171 statements into 1 equivalence classes. [2025-02-08 05:54:04,194 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 171 of 171 statements. [2025-02-08 05:54:04,195 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:54:04,195 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:54:04,368 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 05:54:04,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:54:04,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [39359853] [2025-02-08 05:54:04,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [39359853] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 05:54:04,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1321984591] [2025-02-08 05:54:04,369 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:54:04,369 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 05:54:04,369 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 05:54:04,372 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 05:54:04,373 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-02-08 05:54:04,670 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 171 statements into 1 equivalence classes. [2025-02-08 05:54:04,825 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 171 of 171 statements. [2025-02-08 05:54:04,825 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:54:04,825 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:54:04,831 INFO L256 TraceCheckSpWp]: Trace formula consists of 770 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-02-08 05:54:04,834 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 05:54:05,086 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-08 05:54:05,087 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 05:54:05,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1321984591] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:54:05,087 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 05:54:05,088 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [4] total 9 [2025-02-08 05:54:05,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [425338964] [2025-02-08 05:54:05,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:54:05,088 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 05:54:05,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:54:05,089 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 05:54:05,090 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-02-08 05:54:05,090 INFO L87 Difference]: Start difference. First operand 635 states and 875 transitions. Second operand has 7 states, 7 states have (on average 23.428571428571427) internal successors, (164), 7 states have internal predecessors, (164), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 05:54:05,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 05:54:05,723 INFO L93 Difference]: Finished difference Result 649 states and 893 transitions. [2025-02-08 05:54:05,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 05:54:05,724 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 23.428571428571427) internal successors, (164), 7 states have internal predecessors, (164), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 171 [2025-02-08 05:54:05,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 05:54:05,726 INFO L225 Difference]: With dead ends: 649 [2025-02-08 05:54:05,726 INFO L226 Difference]: Without dead ends: 649 [2025-02-08 05:54:05,726 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 167 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-02-08 05:54:05,727 INFO L435 NwaCegarLoop]: 456 mSDtfsCounter, 12 mSDsluCounter, 1709 mSDsCounter, 0 mSdLazyCounter, 925 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 2165 SdHoareTripleChecker+Invalid, 926 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 925 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-08 05:54:05,727 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 2165 Invalid, 926 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 925 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-08 05:54:05,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 649 states. [2025-02-08 05:54:05,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 649 to 635. [2025-02-08 05:54:05,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 635 states, 629 states have (on average 1.381558028616852) internal successors, (869), 630 states have internal predecessors, (869), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 05:54:05,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 635 states to 635 states and 875 transitions. [2025-02-08 05:54:05,742 INFO L78 Accepts]: Start accepts. Automaton has 635 states and 875 transitions. Word has length 171 [2025-02-08 05:54:05,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 05:54:05,742 INFO L471 AbstractCegarLoop]: Abstraction has 635 states and 875 transitions. [2025-02-08 05:54:05,742 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 23.428571428571427) internal successors, (164), 7 states have internal predecessors, (164), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 05:54:05,743 INFO L276 IsEmpty]: Start isEmpty. Operand 635 states and 875 transitions. [2025-02-08 05:54:05,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2025-02-08 05:54:05,745 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 05:54:05,745 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:54:05,757 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-02-08 05:54:05,946 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-02-08 05:54:05,946 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-02-08 05:54:05,947 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:54:05,947 INFO L85 PathProgramCache]: Analyzing trace with hash -34940883, now seen corresponding path program 1 times [2025-02-08 05:54:05,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:54:05,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1013966595] [2025-02-08 05:54:05,947 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:54:05,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:54:06,000 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 172 statements into 1 equivalence classes. [2025-02-08 05:54:06,041 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 172 of 172 statements. [2025-02-08 05:54:06,041 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:54:06,041 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:54:06,342 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-08 05:54:06,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:54:06,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1013966595] [2025-02-08 05:54:06,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1013966595] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:54:06,343 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:54:06,343 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-08 05:54:06,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1526094988] [2025-02-08 05:54:06,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:54:06,344 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-08 05:54:06,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:54:06,346 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-08 05:54:06,346 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-02-08 05:54:06,346 INFO L87 Difference]: Start difference. First operand 635 states and 875 transitions. Second operand has 9 states, 9 states have (on average 18.333333333333332) internal successors, (165), 9 states have internal predecessors, (165), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 05:54:07,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 05:54:07,062 INFO L93 Difference]: Finished difference Result 661 states and 907 transitions. [2025-02-08 05:54:07,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-08 05:54:07,062 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 18.333333333333332) internal successors, (165), 9 states have internal predecessors, (165), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 172 [2025-02-08 05:54:07,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 05:54:07,065 INFO L225 Difference]: With dead ends: 661 [2025-02-08 05:54:07,065 INFO L226 Difference]: Without dead ends: 661 [2025-02-08 05:54:07,065 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-02-08 05:54:07,066 INFO L435 NwaCegarLoop]: 451 mSDtfsCounter, 20 mSDsluCounter, 2501 mSDsCounter, 0 mSdLazyCounter, 1126 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 2952 SdHoareTripleChecker+Invalid, 1127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-08 05:54:07,066 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 2952 Invalid, 1127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1126 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-08 05:54:07,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 661 states. [2025-02-08 05:54:07,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 661 to 649. [2025-02-08 05:54:07,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 649 states, 643 states have (on average 1.3794712286158632) internal successors, (887), 644 states have internal predecessors, (887), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 05:54:07,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 649 states to 649 states and 893 transitions. [2025-02-08 05:54:07,077 INFO L78 Accepts]: Start accepts. Automaton has 649 states and 893 transitions. Word has length 172 [2025-02-08 05:54:07,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 05:54:07,077 INFO L471 AbstractCegarLoop]: Abstraction has 649 states and 893 transitions. [2025-02-08 05:54:07,078 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 18.333333333333332) internal successors, (165), 9 states have internal predecessors, (165), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 05:54:07,078 INFO L276 IsEmpty]: Start isEmpty. Operand 649 states and 893 transitions. [2025-02-08 05:54:07,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2025-02-08 05:54:07,080 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 05:54:07,080 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:54:07,080 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-08 05:54:07,080 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-02-08 05:54:07,081 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:54:07,081 INFO L85 PathProgramCache]: Analyzing trace with hash -418852210, now seen corresponding path program 1 times [2025-02-08 05:54:07,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:54:07,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1735143695] [2025-02-08 05:54:07,081 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:54:07,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:54:07,125 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 172 statements into 1 equivalence classes. [2025-02-08 05:54:07,256 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 172 of 172 statements. [2025-02-08 05:54:07,256 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:54:07,256 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:54:07,407 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 05:54:07,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:54:07,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1735143695] [2025-02-08 05:54:07,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1735143695] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 05:54:07,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [279724981] [2025-02-08 05:54:07,408 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:54:07,409 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 05:54:07,409 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 05:54:07,411 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 05:54:07,414 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-02-08 05:54:07,737 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 172 statements into 1 equivalence classes. [2025-02-08 05:54:07,871 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 172 of 172 statements. [2025-02-08 05:54:07,871 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:54:07,871 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:54:07,883 INFO L256 TraceCheckSpWp]: Trace formula consists of 771 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-02-08 05:54:07,893 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 05:54:08,003 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-08 05:54:08,003 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 05:54:08,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [279724981] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:54:08,004 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 05:54:08,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [4] total 9 [2025-02-08 05:54:08,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [164566238] [2025-02-08 05:54:08,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:54:08,005 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 05:54:08,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:54:08,007 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 05:54:08,007 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-02-08 05:54:08,008 INFO L87 Difference]: Start difference. First operand 649 states and 893 transitions. Second operand has 7 states, 7 states have (on average 23.571428571428573) internal successors, (165), 7 states have internal predecessors, (165), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 05:54:08,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 05:54:08,482 INFO L93 Difference]: Finished difference Result 673 states and 929 transitions. [2025-02-08 05:54:08,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 05:54:08,483 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 23.571428571428573) internal successors, (165), 7 states have internal predecessors, (165), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 172 [2025-02-08 05:54:08,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 05:54:08,484 INFO L225 Difference]: With dead ends: 673 [2025-02-08 05:54:08,484 INFO L226 Difference]: Without dead ends: 673 [2025-02-08 05:54:08,485 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 168 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-02-08 05:54:08,485 INFO L435 NwaCegarLoop]: 448 mSDtfsCounter, 17 mSDsluCounter, 1740 mSDsCounter, 0 mSdLazyCounter, 870 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 2188 SdHoareTripleChecker+Invalid, 870 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 870 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-08 05:54:08,485 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 2188 Invalid, 870 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 870 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-08 05:54:08,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 673 states. [2025-02-08 05:54:08,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 673 to 663. [2025-02-08 05:54:08,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 663 states, 657 states have (on average 1.3805175038051751) internal successors, (907), 658 states have internal predecessors, (907), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 05:54:08,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 663 states to 663 states and 913 transitions. [2025-02-08 05:54:08,498 INFO L78 Accepts]: Start accepts. Automaton has 663 states and 913 transitions. Word has length 172 [2025-02-08 05:54:08,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 05:54:08,498 INFO L471 AbstractCegarLoop]: Abstraction has 663 states and 913 transitions. [2025-02-08 05:54:08,498 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 23.571428571428573) internal successors, (165), 7 states have internal predecessors, (165), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 05:54:08,498 INFO L276 IsEmpty]: Start isEmpty. Operand 663 states and 913 transitions. [2025-02-08 05:54:08,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2025-02-08 05:54:08,500 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 05:54:08,500 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:54:08,512 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-02-08 05:54:08,705 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 05:54:08,705 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-02-08 05:54:08,705 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:54:08,706 INFO L85 PathProgramCache]: Analyzing trace with hash 939967164, now seen corresponding path program 1 times [2025-02-08 05:54:08,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:54:08,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1316488425] [2025-02-08 05:54:08,706 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:54:08,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:54:08,748 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 173 statements into 1 equivalence classes. [2025-02-08 05:54:08,778 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 173 of 173 statements. [2025-02-08 05:54:08,778 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:54:08,778 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:54:09,185 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-08 05:54:09,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:54:09,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1316488425] [2025-02-08 05:54:09,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1316488425] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:54:09,186 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:54:09,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-08 05:54:09,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [349986665] [2025-02-08 05:54:09,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:54:09,188 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-08 05:54:09,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:54:09,188 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-08 05:54:09,189 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-02-08 05:54:09,189 INFO L87 Difference]: Start difference. First operand 663 states and 913 transitions. Second operand has 10 states, 10 states have (on average 16.6) internal successors, (166), 10 states have internal predecessors, (166), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 05:54:10,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 05:54:10,027 INFO L93 Difference]: Finished difference Result 681 states and 937 transitions. [2025-02-08 05:54:10,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-08 05:54:10,028 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 16.6) internal successors, (166), 10 states have internal predecessors, (166), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 173 [2025-02-08 05:54:10,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 05:54:10,030 INFO L225 Difference]: With dead ends: 681 [2025-02-08 05:54:10,030 INFO L226 Difference]: Without dead ends: 681 [2025-02-08 05:54:10,030 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2025-02-08 05:54:10,031 INFO L435 NwaCegarLoop]: 457 mSDtfsCounter, 26 mSDsluCounter, 2447 mSDsCounter, 0 mSdLazyCounter, 1297 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 2904 SdHoareTripleChecker+Invalid, 1298 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1297 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-08 05:54:10,031 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 2904 Invalid, 1298 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1297 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-08 05:54:10,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 681 states. [2025-02-08 05:54:10,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 681 to 669. [2025-02-08 05:54:10,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 669 states, 663 states have (on average 1.3770739064856712) internal successors, (913), 664 states have internal predecessors, (913), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 05:54:10,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 669 states to 669 states and 919 transitions. [2025-02-08 05:54:10,041 INFO L78 Accepts]: Start accepts. Automaton has 669 states and 919 transitions. Word has length 173 [2025-02-08 05:54:10,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 05:54:10,041 INFO L471 AbstractCegarLoop]: Abstraction has 669 states and 919 transitions. [2025-02-08 05:54:10,041 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 16.6) internal successors, (166), 10 states have internal predecessors, (166), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 05:54:10,042 INFO L276 IsEmpty]: Start isEmpty. Operand 669 states and 919 transitions. [2025-02-08 05:54:10,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2025-02-08 05:54:10,043 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 05:54:10,043 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:54:10,043 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-08 05:54:10,044 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-02-08 05:54:10,044 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:54:10,044 INFO L85 PathProgramCache]: Analyzing trace with hash 1288400919, now seen corresponding path program 1 times [2025-02-08 05:54:10,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:54:10,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1358408045] [2025-02-08 05:54:10,045 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:54:10,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:54:10,088 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 173 statements into 1 equivalence classes. [2025-02-08 05:54:10,227 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 173 of 173 statements. [2025-02-08 05:54:10,227 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:54:10,227 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:54:10,389 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 05:54:10,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:54:10,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1358408045] [2025-02-08 05:54:10,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1358408045] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 05:54:10,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1083309002] [2025-02-08 05:54:10,389 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:54:10,389 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 05:54:10,390 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 05:54:10,392 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 05:54:10,394 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-02-08 05:54:10,711 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 173 statements into 1 equivalence classes. [2025-02-08 05:54:10,851 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 173 of 173 statements. [2025-02-08 05:54:10,852 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:54:10,852 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:54:10,857 INFO L256 TraceCheckSpWp]: Trace formula consists of 772 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-02-08 05:54:10,862 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 05:54:11,046 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-08 05:54:11,046 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 05:54:11,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1083309002] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:54:11,046 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 05:54:11,047 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [4] total 9 [2025-02-08 05:54:11,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1434972993] [2025-02-08 05:54:11,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:54:11,047 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 05:54:11,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:54:11,048 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 05:54:11,048 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-02-08 05:54:11,048 INFO L87 Difference]: Start difference. First operand 669 states and 919 transitions. Second operand has 7 states, 7 states have (on average 23.714285714285715) internal successors, (166), 7 states have internal predecessors, (166), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 05:54:11,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 05:54:11,722 INFO L93 Difference]: Finished difference Result 679 states and 931 transitions. [2025-02-08 05:54:11,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 05:54:11,723 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 23.714285714285715) internal successors, (166), 7 states have internal predecessors, (166), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 173 [2025-02-08 05:54:11,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 05:54:11,725 INFO L225 Difference]: With dead ends: 679 [2025-02-08 05:54:11,725 INFO L226 Difference]: Without dead ends: 679 [2025-02-08 05:54:11,725 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 169 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-02-08 05:54:11,726 INFO L435 NwaCegarLoop]: 456 mSDtfsCounter, 10 mSDsluCounter, 1709 mSDsCounter, 0 mSdLazyCounter, 925 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 2165 SdHoareTripleChecker+Invalid, 926 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 925 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-08 05:54:11,726 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 2165 Invalid, 926 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 925 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-08 05:54:11,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 679 states. [2025-02-08 05:54:11,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 679 to 669. [2025-02-08 05:54:11,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 669 states, 663 states have (on average 1.3770739064856712) internal successors, (913), 664 states have internal predecessors, (913), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 05:54:11,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 669 states to 669 states and 919 transitions. [2025-02-08 05:54:11,738 INFO L78 Accepts]: Start accepts. Automaton has 669 states and 919 transitions. Word has length 173 [2025-02-08 05:54:11,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 05:54:11,738 INFO L471 AbstractCegarLoop]: Abstraction has 669 states and 919 transitions. [2025-02-08 05:54:11,739 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 23.714285714285715) internal successors, (166), 7 states have internal predecessors, (166), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 05:54:11,739 INFO L276 IsEmpty]: Start isEmpty. Operand 669 states and 919 transitions. [2025-02-08 05:54:11,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2025-02-08 05:54:11,740 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 05:54:11,740 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:54:11,752 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-02-08 05:54:11,941 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 05:54:11,941 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-02-08 05:54:11,942 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:54:11,942 INFO L85 PathProgramCache]: Analyzing trace with hash 1923617915, now seen corresponding path program 1 times [2025-02-08 05:54:11,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:54:11,942 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [698724513] [2025-02-08 05:54:11,942 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:54:11,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:54:11,985 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 173 statements into 1 equivalence classes. [2025-02-08 05:54:12,086 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 173 of 173 statements. [2025-02-08 05:54:12,086 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:54:12,086 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:54:12,268 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 05:54:12,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:54:12,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [698724513] [2025-02-08 05:54:12,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [698724513] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 05:54:12,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1634482367] [2025-02-08 05:54:12,269 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:54:12,269 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 05:54:12,269 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 05:54:12,271 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 05:54:12,273 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-02-08 05:54:12,614 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 173 statements into 1 equivalence classes. [2025-02-08 05:54:12,807 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 173 of 173 statements. [2025-02-08 05:54:12,807 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:54:12,807 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:54:12,818 INFO L256 TraceCheckSpWp]: Trace formula consists of 772 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-02-08 05:54:12,824 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 05:54:13,801 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-08 05:54:13,802 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 05:54:13,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1634482367] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:54:13,802 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 05:54:13,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [4] total 13 [2025-02-08 05:54:13,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1582234292] [2025-02-08 05:54:13,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:54:13,803 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-08 05:54:13,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:54:13,804 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-08 05:54:13,804 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2025-02-08 05:54:13,804 INFO L87 Difference]: Start difference. First operand 669 states and 919 transitions. Second operand has 11 states, 11 states have (on average 15.090909090909092) internal successors, (166), 11 states have internal predecessors, (166), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 05:54:14,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 05:54:14,968 INFO L93 Difference]: Finished difference Result 679 states and 929 transitions. [2025-02-08 05:54:14,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 05:54:14,968 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 15.090909090909092) internal successors, (166), 11 states have internal predecessors, (166), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 173 [2025-02-08 05:54:14,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 05:54:14,970 INFO L225 Difference]: With dead ends: 679 [2025-02-08 05:54:14,970 INFO L226 Difference]: Without dead ends: 679 [2025-02-08 05:54:14,970 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 165 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2025-02-08 05:54:14,971 INFO L435 NwaCegarLoop]: 455 mSDtfsCounter, 11 mSDsluCounter, 3049 mSDsCounter, 0 mSdLazyCounter, 1640 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 3504 SdHoareTripleChecker+Invalid, 1641 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1640 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-02-08 05:54:14,971 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 3504 Invalid, 1641 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1640 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-02-08 05:54:14,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 679 states. [2025-02-08 05:54:14,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 679 to 675. [2025-02-08 05:54:14,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 675 states, 669 states have (on average 1.3736920777279522) internal successors, (919), 670 states have internal predecessors, (919), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 05:54:14,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 675 states to 675 states and 925 transitions. [2025-02-08 05:54:14,980 INFO L78 Accepts]: Start accepts. Automaton has 675 states and 925 transitions. Word has length 173 [2025-02-08 05:54:14,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 05:54:14,980 INFO L471 AbstractCegarLoop]: Abstraction has 675 states and 925 transitions. [2025-02-08 05:54:14,980 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 15.090909090909092) internal successors, (166), 11 states have internal predecessors, (166), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 05:54:14,980 INFO L276 IsEmpty]: Start isEmpty. Operand 675 states and 925 transitions. [2025-02-08 05:54:14,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2025-02-08 05:54:14,982 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 05:54:14,982 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:54:14,995 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-02-08 05:54:15,182 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 05:54:15,182 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-02-08 05:54:15,183 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:54:15,183 INFO L85 PathProgramCache]: Analyzing trace with hash 1424577951, now seen corresponding path program 1 times [2025-02-08 05:54:15,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:54:15,183 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169566410] [2025-02-08 05:54:15,183 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:54:15,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:54:15,225 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 174 statements into 1 equivalence classes. [2025-02-08 05:54:15,335 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 174 of 174 statements. [2025-02-08 05:54:15,336 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:54:15,336 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:54:15,508 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 05:54:15,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:54:15,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [169566410] [2025-02-08 05:54:15,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [169566410] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 05:54:15,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1029393167] [2025-02-08 05:54:15,509 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:54:15,509 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 05:54:15,509 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 05:54:15,511 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 05:54:15,513 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-02-08 05:54:15,845 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 174 statements into 1 equivalence classes. [2025-02-08 05:54:16,016 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 174 of 174 statements. [2025-02-08 05:54:16,017 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:54:16,017 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:54:16,020 INFO L256 TraceCheckSpWp]: Trace formula consists of 773 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-02-08 05:54:16,023 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 05:54:16,256 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-08 05:54:16,256 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 05:54:16,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1029393167] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:54:16,257 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 05:54:16,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [4] total 12 [2025-02-08 05:54:16,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1107391278] [2025-02-08 05:54:16,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:54:16,257 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-08 05:54:16,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:54:16,258 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-08 05:54:16,258 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2025-02-08 05:54:16,258 INFO L87 Difference]: Start difference. First operand 675 states and 925 transitions. Second operand has 10 states, 10 states have (on average 16.7) internal successors, (167), 10 states have internal predecessors, (167), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 05:54:16,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 05:54:16,835 INFO L93 Difference]: Finished difference Result 689 states and 943 transitions. [2025-02-08 05:54:16,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-08 05:54:16,836 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 16.7) internal successors, (167), 10 states have internal predecessors, (167), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 174 [2025-02-08 05:54:16,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 05:54:16,838 INFO L225 Difference]: With dead ends: 689 [2025-02-08 05:54:16,838 INFO L226 Difference]: Without dead ends: 689 [2025-02-08 05:54:16,838 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 167 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2025-02-08 05:54:16,840 INFO L435 NwaCegarLoop]: 451 mSDtfsCounter, 13 mSDsluCounter, 2472 mSDsCounter, 0 mSdLazyCounter, 1240 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 2923 SdHoareTripleChecker+Invalid, 1241 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1240 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-08 05:54:16,840 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 2923 Invalid, 1241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1240 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-08 05:54:16,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 689 states. [2025-02-08 05:54:16,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 689 to 683. [2025-02-08 05:54:16,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 683 states, 677 states have (on average 1.3722304283604136) internal successors, (929), 678 states have internal predecessors, (929), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 05:54:16,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 683 states to 683 states and 935 transitions. [2025-02-08 05:54:16,849 INFO L78 Accepts]: Start accepts. Automaton has 683 states and 935 transitions. Word has length 174 [2025-02-08 05:54:16,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 05:54:16,850 INFO L471 AbstractCegarLoop]: Abstraction has 683 states and 935 transitions. [2025-02-08 05:54:16,850 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 16.7) internal successors, (167), 10 states have internal predecessors, (167), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 05:54:16,850 INFO L276 IsEmpty]: Start isEmpty. Operand 683 states and 935 transitions. [2025-02-08 05:54:16,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2025-02-08 05:54:16,852 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 05:54:16,852 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:54:16,867 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-02-08 05:54:17,052 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,11 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 05:54:17,053 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-02-08 05:54:17,053 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:54:17,053 INFO L85 PathProgramCache]: Analyzing trace with hash 996021138, now seen corresponding path program 1 times [2025-02-08 05:54:17,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:54:17,053 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [36467921] [2025-02-08 05:54:17,053 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:54:17,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:54:17,094 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 174 statements into 1 equivalence classes. [2025-02-08 05:54:17,199 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 174 of 174 statements. [2025-02-08 05:54:17,200 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:54:17,203 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:54:17,449 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 05:54:17,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:54:17,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [36467921] [2025-02-08 05:54:17,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [36467921] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 05:54:17,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [379197772] [2025-02-08 05:54:17,450 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:54:17,450 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 05:54:17,450 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 05:54:17,466 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 05:54:17,469 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-02-08 05:54:17,879 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 174 statements into 1 equivalence classes. [2025-02-08 05:54:19,485 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 174 of 174 statements. [2025-02-08 05:54:19,485 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:54:19,485 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:54:19,490 INFO L256 TraceCheckSpWp]: Trace formula consists of 770 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-02-08 05:54:19,492 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 05:54:19,509 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 05:54:19,509 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 05:54:19,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [379197772] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:54:19,509 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 05:54:19,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2025-02-08 05:54:19,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653430009] [2025-02-08 05:54:19,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:54:19,510 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 05:54:19,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:54:19,510 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 05:54:19,510 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-08 05:54:19,511 INFO L87 Difference]: Start difference. First operand 683 states and 935 transitions. Second operand has 4 states, 4 states have (on average 42.5) internal successors, (170), 4 states have internal predecessors, (170), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 05:54:19,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 05:54:19,587 INFO L93 Difference]: Finished difference Result 686 states and 939 transitions. [2025-02-08 05:54:19,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 05:54:19,588 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 42.5) internal successors, (170), 4 states have internal predecessors, (170), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 174 [2025-02-08 05:54:19,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 05:54:19,592 INFO L225 Difference]: With dead ends: 686 [2025-02-08 05:54:19,592 INFO L226 Difference]: Without dead ends: 686 [2025-02-08 05:54:19,592 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 174 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-08 05:54:19,593 INFO L435 NwaCegarLoop]: 465 mSDtfsCounter, 0 mSDsluCounter, 926 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1391 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 05:54:19,593 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1391 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 05:54:19,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 686 states. [2025-02-08 05:54:19,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 686 to 686. [2025-02-08 05:54:19,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 686 states, 679 states have (on average 1.3726067746686303) internal successors, (932), 681 states have internal predecessors, (932), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-02-08 05:54:19,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 686 states to 686 states and 939 transitions. [2025-02-08 05:54:19,604 INFO L78 Accepts]: Start accepts. Automaton has 686 states and 939 transitions. Word has length 174 [2025-02-08 05:54:19,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 05:54:19,605 INFO L471 AbstractCegarLoop]: Abstraction has 686 states and 939 transitions. [2025-02-08 05:54:19,605 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 42.5) internal successors, (170), 4 states have internal predecessors, (170), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 05:54:19,605 INFO L276 IsEmpty]: Start isEmpty. Operand 686 states and 939 transitions. [2025-02-08 05:54:19,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2025-02-08 05:54:19,607 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 05:54:19,607 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:54:19,629 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-02-08 05:54:19,808 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,SelfDestructingSolverStorable22 [2025-02-08 05:54:19,808 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-02-08 05:54:19,809 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:54:19,809 INFO L85 PathProgramCache]: Analyzing trace with hash 786919374, now seen corresponding path program 1 times [2025-02-08 05:54:19,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:54:19,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1482763631] [2025-02-08 05:54:19,809 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:54:19,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:54:19,852 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 176 statements into 1 equivalence classes. [2025-02-08 05:54:19,992 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 176 of 176 statements. [2025-02-08 05:54:19,993 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:54:19,993 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:54:20,234 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-08 05:54:20,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:54:20,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1482763631] [2025-02-08 05:54:20,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1482763631] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 05:54:20,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2000299505] [2025-02-08 05:54:20,235 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:54:20,235 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 05:54:20,235 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 05:54:20,237 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 05:54:20,239 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-02-08 05:54:20,606 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 176 statements into 1 equivalence classes. [2025-02-08 05:54:20,750 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 176 of 176 statements. [2025-02-08 05:54:20,751 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:54:20,751 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:54:20,755 INFO L256 TraceCheckSpWp]: Trace formula consists of 800 conjuncts, 128 conjuncts are in the unsatisfiable core [2025-02-08 05:54:20,763 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 05:54:20,772 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-02-08 05:54:21,035 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-02-08 05:54:21,056 INFO L349 Elim1Store]: treesize reduction 26, result has 35.0 percent of original size [2025-02-08 05:54:21,057 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 29 [2025-02-08 05:54:21,069 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 11 treesize of output 7 [2025-02-08 05:54:21,143 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 26 treesize of output 14 [2025-02-08 05:54:21,147 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2025-02-08 05:54:21,330 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-02-08 05:54:21,331 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 51 [2025-02-08 05:54:21,338 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2025-02-08 05:54:24,909 INFO L349 Elim1Store]: treesize reduction 271829, result has 0.0 percent of original size [2025-02-08 05:54:24,928 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 88 stores, 13 select indices, 13 select index equivalence classes, 1 disjoint index pairs (out of 78 index pairs), introduced 112 new quantified variables, introduced 1282 case distinctions, treesize of input 1466034 treesize of output 878252 [2025-02-08 05:54:45,036 WARN L286 SmtUtils]: Spent 20.02s on a formula simplification. DAG size of input: 21767 DAG size of output: 20118 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-02-08 05:54:58,489 WARN L286 SmtUtils]: Spent 12.16s on a formula simplification that was a NOOP. DAG size: 20020 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)