./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memcleanup.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_SAX_nondet_test2-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (memcleanup) Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/uthash-2.0.2/uthash_SAX_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-?-551b009-m [2025-01-09 21:58:48,142 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 21:58:48,212 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Default.epf [2025-01-09 21:58:48,220 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 21:58:48,221 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 21:58:48,243 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 21:58:48,244 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 21:58:48,244 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 21:58:48,244 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 21:58:48,244 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 21:58:48,244 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 21:58:48,244 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 21:58:48,245 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 21:58:48,245 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 21:58:48,245 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 21:58:48,245 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 21:58:48,245 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 21:58:48,245 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 21:58:48,245 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 21:58:48,245 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 21:58:48,245 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 21:58:48,246 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 21:58:48,246 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-01-09 21:58:48,246 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-01-09 21:58:48,246 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 21:58:48,246 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 21:58:48,246 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-09 21:58:48,246 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-09 21:58:48,246 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 21:58:48,246 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 21:58:48,246 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 21:58:48,246 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 21:58:48,247 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 21:58:48,247 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 21:58:48,247 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 21:58:48,247 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 21:58:48,247 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:58:48,247 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 21:58:48,247 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 21:58:48,247 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 21:58:48,247 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 21:58:48,247 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:58:48,247 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 21:58:48,248 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 21:58:48,248 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 21:58:48,248 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 21:58:48,248 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 21:58:48,248 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 21:58:48,248 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 21:58:48,248 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 21:58:48,248 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-01-09 21:58:48,586 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 21:58:48,594 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 21:58:48,596 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 21:58:48,598 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 21:58:48,599 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 21:58:48,600 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_SAX_nondet_test2-1.i [2025-01-09 21:58:50,466 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e00b66931/fccc1488b5f44ba6af54f1bb53efee5c/FLAGf7ff03cc9 [2025-01-09 21:58:50,832 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 21:58:50,833 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_nondet_test2-1.i [2025-01-09 21:58:50,851 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e00b66931/fccc1488b5f44ba6af54f1bb53efee5c/FLAGf7ff03cc9 [2025-01-09 21:58:51,021 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e00b66931/fccc1488b5f44ba6af54f1bb53efee5c [2025-01-09 21:58:51,023 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 21:58:51,024 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 21:58:51,025 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 21:58:51,025 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 21:58:51,029 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 21:58:51,029 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:58:51" (1/1) ... [2025-01-09 21:58:51,030 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@35d7aaa7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:58:51, skipping insertion in model container [2025-01-09 21:58:51,030 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:58:51" (1/1) ... [2025-01-09 21:58:51,068 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 21:58:51,283 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-09 21:58:51,316 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-09 21:58:51,318 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-09 21:58:51,321 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-09 21:58:51,324 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-09 21:58:51,347 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-09 21:58:51,347 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-09 21:58:51,348 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-09 21:58:51,349 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-09 21:58:51,353 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 21:58:51,369 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 21:58:51,450 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 21:58:51,484 INFO L204 MainTranslator]: Completed translation [2025-01-09 21:58:51,486 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:58:51 WrapperNode [2025-01-09 21:58:51,486 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 21:58:51,487 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 21:58:51,488 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 21:58:51,488 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 21:58:51,492 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:58:51" (1/1) ... [2025-01-09 21:58:51,517 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:58:51" (1/1) ... [2025-01-09 21:58:51,581 INFO L138 Inliner]: procedures = 207, calls = 222, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 1241 [2025-01-09 21:58:51,581 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 21:58:51,582 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 21:58:51,582 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 21:58:51,582 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 21:58:51,588 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:58:51" (1/1) ... [2025-01-09 21:58:51,589 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:58:51" (1/1) ... [2025-01-09 21:58:51,594 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:58:51" (1/1) ... [2025-01-09 21:58:51,646 INFO L175 MemorySlicer]: Split 206 memory accesses to 3 slices as follows [34, 2, 170]. 83 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [0, 2, 0]. The 46 writes are split as follows [4, 0, 42]. [2025-01-09 21:58:51,648 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:58:51" (1/1) ... [2025-01-09 21:58:51,648 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:58:51" (1/1) ... [2025-01-09 21:58:51,681 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:58:51" (1/1) ... [2025-01-09 21:58:51,688 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:58:51" (1/1) ... [2025-01-09 21:58:51,701 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:58:51" (1/1) ... [2025-01-09 21:58:51,708 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:58:51" (1/1) ... [2025-01-09 21:58:51,713 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:58:51" (1/1) ... [2025-01-09 21:58:51,722 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 21:58:51,723 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 21:58:51,723 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 21:58:51,723 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 21:58:51,724 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:58:51" (1/1) ... [2025-01-09 21:58:51,728 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:58:51,738 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 21:58:51,750 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 21:58:51,752 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 21:58:51,768 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2025-01-09 21:58:51,769 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2025-01-09 21:58:51,769 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2025-01-09 21:58:51,769 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2025-01-09 21:58:51,769 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2025-01-09 21:58:51,770 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2025-01-09 21:58:51,770 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-01-09 21:58:51,770 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-01-09 21:58:51,770 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-01-09 21:58:51,771 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-01-09 21:58:51,771 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-09 21:58:51,771 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-09 21:58:51,771 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-09 21:58:51,771 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-01-09 21:58:51,771 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-09 21:58:51,771 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-09 21:58:51,772 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-01-09 21:58:51,772 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-09 21:58:51,772 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 21:58:51,772 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-01-09 21:58:51,772 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-01-09 21:58:51,772 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-01-09 21:58:51,772 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 21:58:51,772 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-09 21:58:51,772 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-09 21:58:51,772 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 21:58:51,772 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 21:58:51,940 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 21:58:51,942 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 21:58:53,042 INFO L? ?]: Removed 296 outVars from TransFormulas that were not future-live. [2025-01-09 21:58:53,043 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 21:58:53,059 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 21:58:53,062 INFO L312 CfgBuilder]: Removed 27 assume(true) statements. [2025-01-09 21:58:53,063 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:58:53 BoogieIcfgContainer [2025-01-09 21:58:53,063 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 21:58:53,065 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 21:58:53,065 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 21:58:53,069 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 21:58:53,069 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 09:58:51" (1/3) ... [2025-01-09 21:58:53,070 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53c8ae12 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:58:53, skipping insertion in model container [2025-01-09 21:58:53,070 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:58:51" (2/3) ... [2025-01-09 21:58:53,070 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53c8ae12 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:58:53, skipping insertion in model container [2025-01-09 21:58:53,070 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:58:53" (3/3) ... [2025-01-09 21:58:53,071 INFO L128 eAbstractionObserver]: Analyzing ICFG uthash_SAX_nondet_test2-1.i [2025-01-09 21:58:53,083 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 21:58:53,084 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG uthash_SAX_nondet_test2-1.i that has 4 procedures, 375 locations, 1 initial locations, 33 loop locations, and 2 error locations. [2025-01-09 21:58:53,119 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 21:58:53,128 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;@5a8e6f75, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 21:58:53,129 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-01-09 21:58:53,133 INFO L276 IsEmpty]: Start isEmpty. Operand has 367 states, 360 states have (on average 1.613888888888889) internal successors, (581), 362 states have internal predecessors, (581), 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-01-09 21:58:53,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-01-09 21:58:53,137 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 21:58:53,137 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-01-09 21:58:53,138 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-01-09 21:58:53,141 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:58:53,141 INFO L85 PathProgramCache]: Analyzing trace with hash 1665802, now seen corresponding path program 1 times [2025-01-09 21:58:53,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:58:53,147 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [769711581] [2025-01-09 21:58:53,147 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:58:53,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:58:53,255 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-01-09 21:58:53,266 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-01-09 21:58:53,266 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:58:53,266 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:58:53,510 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:58:53,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:58:53,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [769711581] [2025-01-09 21:58:53,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [769711581] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:58:53,512 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:58:53,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 21:58:53,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1296279154] [2025-01-09 21:58:53,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:58:53,516 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 21:58:53,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:58:53,533 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 21:58:53,533 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 21:58:53,535 INFO L87 Difference]: Start difference. First operand has 367 states, 360 states have (on average 1.613888888888889) internal successors, (581), 362 states have internal predecessors, (581), 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.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:58:53,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 21:58:53,752 INFO L93 Difference]: Finished difference Result 530 states and 771 transitions. [2025-01-09 21:58:53,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 21:58:53,758 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 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 4 [2025-01-09 21:58:53,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 21:58:53,765 INFO L225 Difference]: With dead ends: 530 [2025-01-09 21:58:53,767 INFO L226 Difference]: Without dead ends: 526 [2025-01-09 21:58:53,768 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 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-01-09 21:58:53,771 INFO L435 NwaCegarLoop]: 520 mSDtfsCounter, 239 mSDsluCounter, 1024 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 239 SdHoareTripleChecker+Valid, 1544 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 21:58:53,772 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [239 Valid, 1544 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 21:58:53,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 526 states. [2025-01-09 21:58:53,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 526 to 522. [2025-01-09 21:58:53,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 522 states, 516 states have (on average 1.4651162790697674) internal successors, (756), 517 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-01-09 21:58:53,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 522 states to 522 states and 762 transitions. [2025-01-09 21:58:53,856 INFO L78 Accepts]: Start accepts. Automaton has 522 states and 762 transitions. Word has length 4 [2025-01-09 21:58:53,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 21:58:53,856 INFO L471 AbstractCegarLoop]: Abstraction has 522 states and 762 transitions. [2025-01-09 21:58:53,857 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:58:53,857 INFO L276 IsEmpty]: Start isEmpty. Operand 522 states and 762 transitions. [2025-01-09 21:58:53,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-01-09 21:58:53,859 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 21:58:53,859 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, 1] [2025-01-09 21:58:53,859 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 21:58:53,859 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-01-09 21:58:53,861 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:58:53,861 INFO L85 PathProgramCache]: Analyzing trace with hash 1674606190, now seen corresponding path program 1 times [2025-01-09 21:58:53,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:58:53,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2070687956] [2025-01-09 21:58:53,861 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:58:53,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:58:53,888 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-01-09 21:58:53,905 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-01-09 21:58:53,908 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:58:53,908 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:58:54,141 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:58:54,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:58:54,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2070687956] [2025-01-09 21:58:54,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2070687956] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:58:54,141 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:58:54,141 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 21:58:54,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [757281212] [2025-01-09 21:58:54,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:58:54,143 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 21:58:54,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:58:54,144 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 21:58:54,144 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 21:58:54,145 INFO L87 Difference]: Start difference. First operand 522 states and 762 transitions. Second operand has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:58:54,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 21:58:54,225 INFO L93 Difference]: Finished difference Result 528 states and 754 transitions. [2025-01-09 21:58:54,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 21:58:54,226 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 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 66 [2025-01-09 21:58:54,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 21:58:54,228 INFO L225 Difference]: With dead ends: 528 [2025-01-09 21:58:54,228 INFO L226 Difference]: Without dead ends: 528 [2025-01-09 21:58:54,228 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-01-09 21:58:54,229 INFO L435 NwaCegarLoop]: 500 mSDtfsCounter, 105 mSDsluCounter, 907 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 1407 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 21:58:54,229 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 1407 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 21:58:54,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 528 states. [2025-01-09 21:58:54,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 528 to 522. [2025-01-09 21:58:54,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 522 states, 516 states have (on average 1.437984496124031) internal successors, (742), 517 states have internal predecessors, (742), 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-01-09 21:58:54,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 522 states to 522 states and 748 transitions. [2025-01-09 21:58:54,247 INFO L78 Accepts]: Start accepts. Automaton has 522 states and 748 transitions. Word has length 66 [2025-01-09 21:58:54,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 21:58:54,247 INFO L471 AbstractCegarLoop]: Abstraction has 522 states and 748 transitions. [2025-01-09 21:58:54,247 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:58:54,247 INFO L276 IsEmpty]: Start isEmpty. Operand 522 states and 748 transitions. [2025-01-09 21:58:54,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-01-09 21:58:54,250 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 21:58:54,250 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, 1] [2025-01-09 21:58:54,251 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 21:58:54,251 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-01-09 21:58:54,251 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:58:54,251 INFO L85 PathProgramCache]: Analyzing trace with hash -560050974, now seen corresponding path program 1 times [2025-01-09 21:58:54,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:58:54,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [257451201] [2025-01-09 21:58:54,251 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:58:54,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:58:54,267 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-01-09 21:58:54,321 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-01-09 21:58:54,321 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:58:54,321 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:58:54,777 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:58:54,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:58:54,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [257451201] [2025-01-09 21:58:54,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [257451201] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:58:54,778 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:58:54,778 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 21:58:54,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1623797160] [2025-01-09 21:58:54,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:58:54,778 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 21:58:54,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:58:54,779 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 21:58:54,779 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-01-09 21:58:54,779 INFO L87 Difference]: Start difference. First operand 522 states and 748 transitions. Second operand has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:58:54,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 21:58:54,897 INFO L93 Difference]: Finished difference Result 721 states and 1033 transitions. [2025-01-09 21:58:54,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:58:54,897 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 states have internal predecessors, (66), 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 66 [2025-01-09 21:58:54,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 21:58:54,900 INFO L225 Difference]: With dead ends: 721 [2025-01-09 21:58:54,900 INFO L226 Difference]: Without dead ends: 718 [2025-01-09 21:58:54,900 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-01-09 21:58:54,901 INFO L435 NwaCegarLoop]: 505 mSDtfsCounter, 502 mSDsluCounter, 2009 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 505 SdHoareTripleChecker+Valid, 2514 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 21:58:54,901 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [505 Valid, 2514 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 21:58:54,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 718 states. [2025-01-09 21:58:54,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 718 to 366. [2025-01-09 21:58:54,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 366 states, 360 states have (on average 1.4333333333333333) internal successors, (516), 361 states have internal predecessors, (516), 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-01-09 21:58:54,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 522 transitions. [2025-01-09 21:58:54,916 INFO L78 Accepts]: Start accepts. Automaton has 366 states and 522 transitions. Word has length 66 [2025-01-09 21:58:54,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 21:58:54,916 INFO L471 AbstractCegarLoop]: Abstraction has 366 states and 522 transitions. [2025-01-09 21:58:54,917 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:58:54,917 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 522 transitions. [2025-01-09 21:58:54,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-01-09 21:58:54,918 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 21:58:54,918 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, 1, 1] [2025-01-09 21:58:54,919 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 21:58:54,919 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-01-09 21:58:54,919 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:58:54,919 INFO L85 PathProgramCache]: Analyzing trace with hash 885018033, now seen corresponding path program 1 times [2025-01-09 21:58:54,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:58:54,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [241624631] [2025-01-09 21:58:54,919 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:58:54,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:58:54,954 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-01-09 21:58:54,959 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-01-09 21:58:54,959 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:58:54,959 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:58:55,100 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:58:55,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:58:55,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [241624631] [2025-01-09 21:58:55,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [241624631] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:58:55,101 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:58:55,101 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 21:58:55,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [884365120] [2025-01-09 21:58:55,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:58:55,101 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 21:58:55,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:58:55,102 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 21:58:55,102 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 21:58:55,102 INFO L87 Difference]: Start difference. First operand 366 states and 522 transitions. Second operand has 4 states, 4 states have (on average 21.5) internal successors, (86), 4 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:58:55,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 21:58:55,156 INFO L93 Difference]: Finished difference Result 324 states and 445 transitions. [2025-01-09 21:58:55,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 21:58:55,156 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.5) internal successors, (86), 4 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 86 [2025-01-09 21:58:55,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 21:58:55,157 INFO L225 Difference]: With dead ends: 324 [2025-01-09 21:58:55,157 INFO L226 Difference]: Without dead ends: 324 [2025-01-09 21:58:55,158 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-01-09 21:58:55,158 INFO L435 NwaCegarLoop]: 419 mSDtfsCounter, 30 mSDsluCounter, 819 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 1238 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 21:58:55,158 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 1238 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 21:58:55,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2025-01-09 21:58:55,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 324. [2025-01-09 21:58:55,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 324 states, 318 states have (on average 1.380503144654088) internal successors, (439), 319 states have internal predecessors, (439), 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-01-09 21:58:55,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 324 states and 445 transitions. [2025-01-09 21:58:55,164 INFO L78 Accepts]: Start accepts. Automaton has 324 states and 445 transitions. Word has length 86 [2025-01-09 21:58:55,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 21:58:55,164 INFO L471 AbstractCegarLoop]: Abstraction has 324 states and 445 transitions. [2025-01-09 21:58:55,164 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.5) internal successors, (86), 4 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:58:55,164 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 445 transitions. [2025-01-09 21:58:55,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-01-09 21:58:55,165 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 21:58:55,165 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, 1, 1] [2025-01-09 21:58:55,165 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 21:58:55,165 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-01-09 21:58:55,165 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:58:55,166 INFO L85 PathProgramCache]: Analyzing trace with hash -369787995, now seen corresponding path program 1 times [2025-01-09 21:58:55,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:58:55,166 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [174254602] [2025-01-09 21:58:55,166 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:58:55,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:58:55,204 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-01-09 21:58:55,218 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-01-09 21:58:55,218 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:58:55,218 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:58:55,309 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:58:55,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:58:55,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [174254602] [2025-01-09 21:58:55,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [174254602] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:58:55,309 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:58:55,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 21:58:55,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1571911575] [2025-01-09 21:58:55,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:58:55,310 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:58:55,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:58:55,311 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:58:55,311 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:58:55,311 INFO L87 Difference]: Start difference. First operand 324 states and 445 transitions. Second operand has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:58:55,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 21:58:55,354 INFO L93 Difference]: Finished difference Result 551 states and 762 transitions. [2025-01-09 21:58:55,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:58:55,355 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 86 [2025-01-09 21:58:55,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 21:58:55,360 INFO L225 Difference]: With dead ends: 551 [2025-01-09 21:58:55,360 INFO L226 Difference]: Without dead ends: 551 [2025-01-09 21:58:55,360 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:58:55,361 INFO L435 NwaCegarLoop]: 625 mSDtfsCounter, 256 mSDsluCounter, 422 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 256 SdHoareTripleChecker+Valid, 1047 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 21:58:55,361 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [256 Valid, 1047 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 21:58:55,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 551 states. [2025-01-09 21:58:55,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 551 to 545. [2025-01-09 21:58:55,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 545 states, 539 states have (on average 1.3951762523191094) internal successors, (752), 540 states have internal predecessors, (752), 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-01-09 21:58:55,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 545 states to 545 states and 758 transitions. [2025-01-09 21:58:55,375 INFO L78 Accepts]: Start accepts. Automaton has 545 states and 758 transitions. Word has length 86 [2025-01-09 21:58:55,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 21:58:55,375 INFO L471 AbstractCegarLoop]: Abstraction has 545 states and 758 transitions. [2025-01-09 21:58:55,375 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:58:55,375 INFO L276 IsEmpty]: Start isEmpty. Operand 545 states and 758 transitions. [2025-01-09 21:58:55,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-01-09 21:58:55,376 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 21:58:55,377 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] [2025-01-09 21:58:55,377 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 21:58:55,377 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-01-09 21:58:55,378 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:58:55,378 INFO L85 PathProgramCache]: Analyzing trace with hash -1564967685, now seen corresponding path program 1 times [2025-01-09 21:58:55,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:58:55,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1703054449] [2025-01-09 21:58:55,378 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:58:55,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:58:55,419 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-01-09 21:58:55,537 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-01-09 21:58:55,537 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:58:55,537 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:58:55,706 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 21:58:55,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:58:55,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1703054449] [2025-01-09 21:58:55,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1703054449] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 21:58:55,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1908907746] [2025-01-09 21:58:55,706 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:58:55,706 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 21:58:55,707 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 21:58:55,709 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 21:58:55,711 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 21:58:55,857 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-01-09 21:58:55,940 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-01-09 21:58:55,940 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:58:55,940 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:58:55,944 INFO L256 TraceCheckSpWp]: Trace formula consists of 589 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-01-09 21:58:55,952 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 21:58:55,971 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-01-09 21:58:55,999 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-01-09 21:58:57,033 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-09 21:58:57,033 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 21:58:57,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1908907746] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:58:57,033 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 21:58:57,033 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [4] total 13 [2025-01-09 21:58:57,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [764606124] [2025-01-09 21:58:57,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:58:57,034 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 21:58:57,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:58:57,036 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 21:58:57,036 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2025-01-09 21:58:57,037 INFO L87 Difference]: Start difference. First operand 545 states and 758 transitions. Second operand has 11 states, 11 states have (on average 8.545454545454545) internal successors, (94), 11 states have internal predecessors, (94), 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-01-09 21:58:58,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 21:58:58,776 INFO L93 Difference]: Finished difference Result 786 states and 1088 transitions. [2025-01-09 21:58:58,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 21:58:58,776 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 8.545454545454545) internal successors, (94), 11 states have internal predecessors, (94), 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 101 [2025-01-09 21:58:58,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 21:58:58,779 INFO L225 Difference]: With dead ends: 786 [2025-01-09 21:58:58,779 INFO L226 Difference]: Without dead ends: 786 [2025-01-09 21:58:58,779 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 93 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-01-09 21:58:58,781 INFO L435 NwaCegarLoop]: 425 mSDtfsCounter, 541 mSDsluCounter, 2154 mSDsCounter, 0 mSdLazyCounter, 574 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 543 SdHoareTripleChecker+Valid, 2579 SdHoareTripleChecker+Invalid, 579 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 574 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-01-09 21:58:58,782 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [543 Valid, 2579 Invalid, 579 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 574 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-01-09 21:58:58,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 786 states. [2025-01-09 21:58:58,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 786 to 545. [2025-01-09 21:58:58,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 545 states, 539 states have (on average 1.3933209647495362) internal successors, (751), 540 states have internal predecessors, (751), 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-01-09 21:58:58,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 545 states to 545 states and 757 transitions. [2025-01-09 21:58:58,793 INFO L78 Accepts]: Start accepts. Automaton has 545 states and 757 transitions. Word has length 101 [2025-01-09 21:58:58,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 21:58:58,794 INFO L471 AbstractCegarLoop]: Abstraction has 545 states and 757 transitions. [2025-01-09 21:58:58,794 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.545454545454545) internal successors, (94), 11 states have internal predecessors, (94), 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-01-09 21:58:58,794 INFO L276 IsEmpty]: Start isEmpty. Operand 545 states and 757 transitions. [2025-01-09 21:58:58,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-01-09 21:58:58,794 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 21:58:58,795 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] [2025-01-09 21:58:58,803 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-09 21:58:58,995 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 21:58:58,995 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-01-09 21:58:58,996 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:58:58,996 INFO L85 PathProgramCache]: Analyzing trace with hash 1094970594, now seen corresponding path program 1 times [2025-01-09 21:58:58,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:58:58,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [93348805] [2025-01-09 21:58:58,996 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:58:58,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:58:59,048 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-01-09 21:58:59,163 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-01-09 21:58:59,163 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:58:59,164 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:58:59,332 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 21:58:59,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:58:59,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [93348805] [2025-01-09 21:58:59,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [93348805] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 21:58:59,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [301736299] [2025-01-09 21:58:59,332 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:58:59,332 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 21:58:59,333 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 21:58:59,336 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 21:58:59,337 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-09 21:58:59,486 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-01-09 21:58:59,573 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-01-09 21:58:59,573 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:58:59,573 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:58:59,578 INFO L256 TraceCheckSpWp]: Trace formula consists of 590 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-01-09 21:58:59,582 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 21:58:59,588 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-01-09 21:58:59,597 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-01-09 21:58:59,750 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-01-09 21:58:59,775 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-09 21:58:59,775 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 21:59:00,179 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-09 21:59:00,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [301736299] provided 1 perfect and 1 imperfect interpolant sequences [2025-01-09 21:59:00,180 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-01-09 21:59:00,180 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [4, 7] total 11 [2025-01-09 21:59:00,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1958851563] [2025-01-09 21:59:00,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:59:00,181 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 21:59:00,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:59:00,181 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 21:59:00,181 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2025-01-09 21:59:00,181 INFO L87 Difference]: Start difference. First operand 545 states and 757 transitions. Second operand has 5 states, 5 states have (on average 19.0) internal successors, (95), 5 states have internal predecessors, (95), 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-01-09 21:59:00,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 21:59:00,259 INFO L93 Difference]: Finished difference Result 709 states and 990 transitions. [2025-01-09 21:59:00,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 21:59:00,260 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.0) internal successors, (95), 5 states have internal predecessors, (95), 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 102 [2025-01-09 21:59:00,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 21:59:00,262 INFO L225 Difference]: With dead ends: 709 [2025-01-09 21:59:00,262 INFO L226 Difference]: Without dead ends: 709 [2025-01-09 21:59:00,262 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 196 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-01-09 21:59:00,263 INFO L435 NwaCegarLoop]: 427 mSDtfsCounter, 563 mSDsluCounter, 836 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 564 SdHoareTripleChecker+Valid, 1263 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 21:59:00,263 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [564 Valid, 1263 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 21:59:00,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 709 states. [2025-01-09 21:59:00,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 709 to 547. [2025-01-09 21:59:00,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 547 states, 541 states have (on average 1.3918669131238448) internal successors, (753), 542 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-01-09 21:59:00,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 547 states to 547 states and 759 transitions. [2025-01-09 21:59:00,274 INFO L78 Accepts]: Start accepts. Automaton has 547 states and 759 transitions. Word has length 102 [2025-01-09 21:59:00,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 21:59:00,274 INFO L471 AbstractCegarLoop]: Abstraction has 547 states and 759 transitions. [2025-01-09 21:59:00,274 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.0) internal successors, (95), 5 states have internal predecessors, (95), 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-01-09 21:59:00,274 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 759 transitions. [2025-01-09 21:59:00,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2025-01-09 21:59:00,275 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 21:59:00,276 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] [2025-01-09 21:59:00,284 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-09 21:59:00,476 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 21:59:00,476 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-01-09 21:59:00,477 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:59:00,477 INFO L85 PathProgramCache]: Analyzing trace with hash 1412929937, now seen corresponding path program 1 times [2025-01-09 21:59:00,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:59:00,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1101073759] [2025-01-09 21:59:00,477 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:59:00,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:59:00,508 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 158 statements into 1 equivalence classes. [2025-01-09 21:59:00,525 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 158 of 158 statements. [2025-01-09 21:59:00,525 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:59:00,525 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:59:00,652 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-09 21:59:00,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:59:00,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1101073759] [2025-01-09 21:59:00,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1101073759] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:59:00,653 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:59:00,653 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:59:00,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [404617323] [2025-01-09 21:59:00,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:59:00,654 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 21:59:00,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:59:00,654 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 21:59:00,654 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 21:59:00,654 INFO L87 Difference]: Start difference. First operand 547 states and 759 transitions. Second operand has 5 states, 5 states have (on average 30.2) internal successors, (151), 5 states have internal predecessors, (151), 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-01-09 21:59:00,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 21:59:00,856 INFO L93 Difference]: Finished difference Result 633 states and 868 transitions. [2025-01-09 21:59:00,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 21:59:00,856 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 30.2) internal successors, (151), 5 states have internal predecessors, (151), 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 158 [2025-01-09 21:59:00,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 21:59:00,858 INFO L225 Difference]: With dead ends: 633 [2025-01-09 21:59:00,858 INFO L226 Difference]: Without dead ends: 633 [2025-01-09 21:59:00,859 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-01-09 21:59:00,859 INFO L435 NwaCegarLoop]: 538 mSDtfsCounter, 1006 mSDsluCounter, 633 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1007 SdHoareTripleChecker+Valid, 1171 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 21:59:00,859 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1007 Valid, 1171 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 21:59:00,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 633 states. [2025-01-09 21:59:00,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 633 to 413. [2025-01-09 21:59:00,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 413 states, 407 states have (on average 1.366093366093366) internal successors, (556), 408 states have internal predecessors, (556), 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-01-09 21:59:00,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 413 states and 562 transitions. [2025-01-09 21:59:00,867 INFO L78 Accepts]: Start accepts. Automaton has 413 states and 562 transitions. Word has length 158 [2025-01-09 21:59:00,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 21:59:00,868 INFO L471 AbstractCegarLoop]: Abstraction has 413 states and 562 transitions. [2025-01-09 21:59:00,868 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 30.2) internal successors, (151), 5 states have internal predecessors, (151), 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-01-09 21:59:00,868 INFO L276 IsEmpty]: Start isEmpty. Operand 413 states and 562 transitions. [2025-01-09 21:59:00,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2025-01-09 21:59:00,869 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 21:59:00,869 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-01-09 21:59:00,869 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 21:59:00,869 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-01-09 21:59:00,870 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:59:00,870 INFO L85 PathProgramCache]: Analyzing trace with hash -44444736, now seen corresponding path program 1 times [2025-01-09 21:59:00,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:59:00,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [564535118] [2025-01-09 21:59:00,870 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:59:00,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:59:00,898 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-01-09 21:59:00,989 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-01-09 21:59:00,989 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:59:00,989 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:59:01,182 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 21:59:01,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:59:01,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [564535118] [2025-01-09 21:59:01,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [564535118] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 21:59:01,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1920631552] [2025-01-09 21:59:01,182 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:59:01,183 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 21:59:01,183 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 21:59:01,184 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 21:59:01,186 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-09 21:59:01,350 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-01-09 21:59:01,457 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-01-09 21:59:01,457 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:59:01,457 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:59:01,466 INFO L256 TraceCheckSpWp]: Trace formula consists of 771 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-01-09 21:59:01,470 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 21:59:01,476 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-01-09 21:59:01,953 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-09 21:59:01,953 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 21:59:01,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1920631552] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:59:01,953 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 21:59:01,953 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [4] total 12 [2025-01-09 21:59:01,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1408889075] [2025-01-09 21:59:01,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:59:01,954 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 21:59:01,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:59:01,954 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 21:59:01,955 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2025-01-09 21:59:01,955 INFO L87 Difference]: Start difference. First operand 413 states and 562 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-01-09 21:59:02,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 21:59:02,860 INFO L93 Difference]: Finished difference Result 670 states and 917 transitions. [2025-01-09 21:59:02,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 21:59:02,860 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-01-09 21:59:02,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 21:59:02,863 INFO L225 Difference]: With dead ends: 670 [2025-01-09 21:59:02,863 INFO L226 Difference]: Without dead ends: 670 [2025-01-09 21:59:02,863 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-01-09 21:59:02,863 INFO L435 NwaCegarLoop]: 477 mSDtfsCounter, 469 mSDsluCounter, 1749 mSDsCounter, 0 mSdLazyCounter, 708 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 472 SdHoareTripleChecker+Valid, 2226 SdHoareTripleChecker+Invalid, 709 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 708 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 21:59:02,863 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [472 Valid, 2226 Invalid, 709 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 708 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 21:59:02,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 670 states. [2025-01-09 21:59:02,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 670 to 441. [2025-01-09 21:59:02,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 441 states, 435 states have (on average 1.354022988505747) internal successors, (589), 436 states have internal predecessors, (589), 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-01-09 21:59:02,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 441 states to 441 states and 595 transitions. [2025-01-09 21:59:02,872 INFO L78 Accepts]: Start accepts. Automaton has 441 states and 595 transitions. Word has length 168 [2025-01-09 21:59:02,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 21:59:02,872 INFO L471 AbstractCegarLoop]: Abstraction has 441 states and 595 transitions. [2025-01-09 21:59:02,873 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-01-09 21:59:02,873 INFO L276 IsEmpty]: Start isEmpty. Operand 441 states and 595 transitions. [2025-01-09 21:59:02,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2025-01-09 21:59:02,874 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 21:59:02,874 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-01-09 21:59:02,883 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-01-09 21:59:03,078 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-01-09 21:59:03,078 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-01-09 21:59:03,079 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:59:03,079 INFO L85 PathProgramCache]: Analyzing trace with hash -2082260900, now seen corresponding path program 1 times [2025-01-09 21:59:03,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:59:03,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [638638399] [2025-01-09 21:59:03,079 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:59:03,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:59:03,261 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 169 statements into 1 equivalence classes. [2025-01-09 21:59:03,516 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 169 of 169 statements. [2025-01-09 21:59:03,516 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:59:03,516 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:59:03,665 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 21:59:03,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:59:03,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [638638399] [2025-01-09 21:59:03,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [638638399] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 21:59:03,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [406333183] [2025-01-09 21:59:03,666 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:59:03,666 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 21:59:03,666 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 21:59:03,668 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 21:59:03,670 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-01-09 21:59:03,871 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 169 statements into 1 equivalence classes. [2025-01-09 21:59:04,125 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 169 of 169 statements. [2025-01-09 21:59:04,125 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:59:04,125 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:59:04,129 INFO L256 TraceCheckSpWp]: Trace formula consists of 772 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-01-09 21:59:04,133 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 21:59:04,147 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-01-09 21:59:04,709 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-09 21:59:04,709 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 21:59:04,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [406333183] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:59:04,709 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 21:59:04,709 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [4] total 13 [2025-01-09 21:59:04,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1111576097] [2025-01-09 21:59:04,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:59:04,710 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 21:59:04,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:59:04,710 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 21:59:04,710 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2025-01-09 21:59:04,711 INFO L87 Difference]: Start difference. First operand 441 states and 595 transitions. Second operand has 11 states, 11 states have (on average 14.636363636363637) internal successors, (161), 11 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-01-09 21:59:07,865 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.21s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-01-09 21:59:07,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 21:59:07,921 INFO L93 Difference]: Finished difference Result 722 states and 985 transitions. [2025-01-09 21:59:07,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-01-09 21:59:07,922 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 14.636363636363637) internal successors, (161), 11 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-01-09 21:59:07,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 21:59:07,924 INFO L225 Difference]: With dead ends: 722 [2025-01-09 21:59:07,924 INFO L226 Difference]: Without dead ends: 722 [2025-01-09 21:59:07,925 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 161 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=106, Invalid=314, Unknown=0, NotChecked=0, Total=420 [2025-01-09 21:59:07,925 INFO L435 NwaCegarLoop]: 473 mSDtfsCounter, 542 mSDsluCounter, 1541 mSDsCounter, 0 mSdLazyCounter, 584 mSolverCounterSat, 5 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 545 SdHoareTripleChecker+Valid, 2014 SdHoareTripleChecker+Invalid, 590 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 584 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2025-01-09 21:59:07,925 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [545 Valid, 2014 Invalid, 590 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 584 Invalid, 1 Unknown, 0 Unchecked, 3.0s Time] [2025-01-09 21:59:07,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 722 states. [2025-01-09 21:59:07,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 722 to 471. [2025-01-09 21:59:07,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 471 states, 465 states have (on average 1.3483870967741935) internal successors, (627), 466 states have internal predecessors, (627), 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-01-09 21:59:07,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 471 states to 471 states and 633 transitions. [2025-01-09 21:59:07,934 INFO L78 Accepts]: Start accepts. Automaton has 471 states and 633 transitions. Word has length 169 [2025-01-09 21:59:07,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 21:59:07,934 INFO L471 AbstractCegarLoop]: Abstraction has 471 states and 633 transitions. [2025-01-09 21:59:07,934 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 14.636363636363637) internal successors, (161), 11 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-01-09 21:59:07,934 INFO L276 IsEmpty]: Start isEmpty. Operand 471 states and 633 transitions. [2025-01-09 21:59:07,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2025-01-09 21:59:07,935 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 21:59:07,936 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-01-09 21:59:07,946 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-01-09 21:59:08,136 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,SelfDestructingSolverStorable9 [2025-01-09 21:59:08,136 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-01-09 21:59:08,137 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:59:08,137 INFO L85 PathProgramCache]: Analyzing trace with hash -560450644, now seen corresponding path program 1 times [2025-01-09 21:59:08,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:59:08,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1957059277] [2025-01-09 21:59:08,137 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:59:08,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:59:08,174 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes. [2025-01-09 21:59:08,199 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements. [2025-01-09 21:59:08,199 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:59:08,199 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:59:08,465 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-09 21:59:08,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:59:08,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1957059277] [2025-01-09 21:59:08,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1957059277] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:59:08,466 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:59:08,466 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 21:59:08,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [737004582] [2025-01-09 21:59:08,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:59:08,466 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 21:59:08,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:59:08,467 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 21:59:08,467 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 21:59:08,467 INFO L87 Difference]: Start difference. First operand 471 states and 633 transitions. Second operand has 7 states, 7 states have (on average 23.142857142857142) internal successors, (162), 7 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-01-09 21:59:08,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 21:59:08,904 INFO L93 Difference]: Finished difference Result 493 states and 665 transitions. [2025-01-09 21:59:08,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 21:59:08,904 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 23.142857142857142) internal successors, (162), 7 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-01-09 21:59:08,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 21:59:08,906 INFO L225 Difference]: With dead ends: 493 [2025-01-09 21:59:08,906 INFO L226 Difference]: Without dead ends: 493 [2025-01-09 21:59:08,907 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-01-09 21:59:08,907 INFO L435 NwaCegarLoop]: 415 mSDtfsCounter, 14 mSDsluCounter, 1458 mSDsCounter, 0 mSdLazyCounter, 747 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 1873 SdHoareTripleChecker+Invalid, 748 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 747 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 21:59:08,908 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 1873 Invalid, 748 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 747 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 21:59:08,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 493 states. [2025-01-09 21:59:08,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 493 to 490. [2025-01-09 21:59:08,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 490 states, 484 states have (on average 1.353305785123967) internal successors, (655), 485 states have internal predecessors, (655), 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-01-09 21:59:08,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 490 states to 490 states and 661 transitions. [2025-01-09 21:59:08,916 INFO L78 Accepts]: Start accepts. Automaton has 490 states and 661 transitions. Word has length 170 [2025-01-09 21:59:08,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 21:59:08,916 INFO L471 AbstractCegarLoop]: Abstraction has 490 states and 661 transitions. [2025-01-09 21:59:08,916 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 23.142857142857142) internal successors, (162), 7 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-01-09 21:59:08,916 INFO L276 IsEmpty]: Start isEmpty. Operand 490 states and 661 transitions. [2025-01-09 21:59:08,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2025-01-09 21:59:08,918 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 21:59:08,918 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-01-09 21:59:08,918 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 21:59:08,918 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-01-09 21:59:08,919 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:59:08,919 INFO L85 PathProgramCache]: Analyzing trace with hash -1918419387, now seen corresponding path program 1 times [2025-01-09 21:59:08,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:59:08,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1219076879] [2025-01-09 21:59:08,919 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:59:08,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:59:08,955 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes. [2025-01-09 21:59:08,975 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements. [2025-01-09 21:59:08,977 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:59:08,977 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:59:09,207 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-09 21:59:09,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:59:09,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1219076879] [2025-01-09 21:59:09,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1219076879] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:59:09,208 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:59:09,208 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 21:59:09,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1313484249] [2025-01-09 21:59:09,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:59:09,209 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:59:09,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:59:09,210 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:59:09,210 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:59:09,210 INFO L87 Difference]: Start difference. First operand 490 states and 661 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-01-09 21:59:09,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 21:59:09,633 INFO L93 Difference]: Finished difference Result 493 states and 664 transitions. [2025-01-09 21:59:09,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:59:09,634 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-01-09 21:59:09,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 21:59:09,637 INFO L225 Difference]: With dead ends: 493 [2025-01-09 21:59:09,637 INFO L226 Difference]: Without dead ends: 493 [2025-01-09 21:59:09,637 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-01-09 21:59:09,638 INFO L435 NwaCegarLoop]: 427 mSDtfsCounter, 9 mSDsluCounter, 899 mSDsCounter, 0 mSdLazyCounter, 464 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 1326 SdHoareTripleChecker+Invalid, 465 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 464 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 21:59:09,638 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 1326 Invalid, 465 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 464 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 21:59:09,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 493 states. [2025-01-09 21:59:09,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 493 to 493. [2025-01-09 21:59:09,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 493 states, 487 states have (on average 1.351129363449692) internal successors, (658), 488 states have internal predecessors, (658), 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-01-09 21:59:09,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 493 states to 493 states and 664 transitions. [2025-01-09 21:59:09,645 INFO L78 Accepts]: Start accepts. Automaton has 493 states and 664 transitions. Word has length 170 [2025-01-09 21:59:09,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 21:59:09,645 INFO L471 AbstractCegarLoop]: Abstraction has 493 states and 664 transitions. [2025-01-09 21:59:09,646 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-01-09 21:59:09,646 INFO L276 IsEmpty]: Start isEmpty. Operand 493 states and 664 transitions. [2025-01-09 21:59:09,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2025-01-09 21:59:09,647 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 21:59:09,647 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-01-09 21:59:09,648 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 21:59:09,648 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-01-09 21:59:09,648 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:59:09,648 INFO L85 PathProgramCache]: Analyzing trace with hash 1328847304, now seen corresponding path program 1 times [2025-01-09 21:59:09,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:59:09,649 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [117195374] [2025-01-09 21:59:09,649 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:59:09,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:59:09,685 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 171 statements into 1 equivalence classes. [2025-01-09 21:59:09,760 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 171 of 171 statements. [2025-01-09 21:59:09,761 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:59:09,761 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:59:09,886 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 21:59:09,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:59:09,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [117195374] [2025-01-09 21:59:09,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [117195374] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 21:59:09,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [227384580] [2025-01-09 21:59:09,888 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:59:09,888 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 21:59:09,888 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 21:59:09,890 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 21:59:09,891 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-01-09 21:59:10,108 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 171 statements into 1 equivalence classes. [2025-01-09 21:59:10,224 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 171 of 171 statements. [2025-01-09 21:59:10,225 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:59:10,225 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:59:10,231 INFO L256 TraceCheckSpWp]: Trace formula consists of 774 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-01-09 21:59:10,234 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 21:59:10,429 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-09 21:59:10,429 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 21:59:10,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [227384580] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:59:10,429 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 21:59:10,429 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [4] total 9 [2025-01-09 21:59:10,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268129878] [2025-01-09 21:59:10,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:59:10,430 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 21:59:10,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:59:10,430 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 21:59:10,430 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-01-09 21:59:10,430 INFO L87 Difference]: Start difference. First operand 493 states and 664 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-01-09 21:59:10,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 21:59:10,844 INFO L93 Difference]: Finished difference Result 505 states and 679 transitions. [2025-01-09 21:59:10,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 21:59:10,844 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-01-09 21:59:10,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 21:59:10,846 INFO L225 Difference]: With dead ends: 505 [2025-01-09 21:59:10,846 INFO L226 Difference]: Without dead ends: 505 [2025-01-09 21:59:10,846 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 167 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-01-09 21:59:10,846 INFO L435 NwaCegarLoop]: 418 mSDtfsCounter, 42 mSDsluCounter, 1558 mSDsCounter, 0 mSdLazyCounter, 690 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 1976 SdHoareTripleChecker+Invalid, 695 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 690 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 21:59:10,846 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 1976 Invalid, 695 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 690 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 21:59:10,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 505 states. [2025-01-09 21:59:10,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 505 to 486. [2025-01-09 21:59:10,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 486 states, 480 states have (on average 1.3479166666666667) internal successors, (647), 481 states have internal predecessors, (647), 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-01-09 21:59:10,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 486 states to 486 states and 653 transitions. [2025-01-09 21:59:10,853 INFO L78 Accepts]: Start accepts. Automaton has 486 states and 653 transitions. Word has length 171 [2025-01-09 21:59:10,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 21:59:10,854 INFO L471 AbstractCegarLoop]: Abstraction has 486 states and 653 transitions. [2025-01-09 21:59:10,854 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-01-09 21:59:10,854 INFO L276 IsEmpty]: Start isEmpty. Operand 486 states and 653 transitions. [2025-01-09 21:59:10,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2025-01-09 21:59:10,855 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 21:59:10,855 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-01-09 21:59:10,865 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-01-09 21:59:11,055 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-01-09 21:59:11,056 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-01-09 21:59:11,056 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:59:11,056 INFO L85 PathProgramCache]: Analyzing trace with hash 1648653951, now seen corresponding path program 1 times [2025-01-09 21:59:11,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:59:11,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [835862039] [2025-01-09 21:59:11,057 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:59:11,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:59:11,091 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 171 statements into 1 equivalence classes. [2025-01-09 21:59:11,139 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 171 of 171 statements. [2025-01-09 21:59:11,140 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:59:11,140 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:59:11,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-01-09 21:59:11,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:59:11,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [835862039] [2025-01-09 21:59:11,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [835862039] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 21:59:11,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1884555044] [2025-01-09 21:59:11,269 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:59:11,269 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 21:59:11,269 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 21:59:11,271 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 21:59:11,272 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-01-09 21:59:11,483 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 171 statements into 1 equivalence classes. [2025-01-09 21:59:11,559 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 171 of 171 statements. [2025-01-09 21:59:11,559 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:59:11,559 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:59:11,564 INFO L256 TraceCheckSpWp]: Trace formula consists of 771 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-01-09 21:59:11,567 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 21:59:11,620 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-09 21:59:11,620 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 21:59:11,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1884555044] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:59:11,621 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 21:59:11,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2025-01-09 21:59:11,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382718700] [2025-01-09 21:59:11,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:59:11,621 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 21:59:11,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:59:11,622 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 21:59:11,622 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:59:11,622 INFO L87 Difference]: Start difference. First operand 486 states and 653 transitions. Second operand has 4 states, 4 states have (on average 41.0) internal successors, (164), 4 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-01-09 21:59:11,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 21:59:11,701 INFO L93 Difference]: Finished difference Result 486 states and 651 transitions. [2025-01-09 21:59:11,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 21:59:11,701 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 41.0) internal successors, (164), 4 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-01-09 21:59:11,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 21:59:11,703 INFO L225 Difference]: With dead ends: 486 [2025-01-09 21:59:11,703 INFO L226 Difference]: Without dead ends: 486 [2025-01-09 21:59:11,703 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 170 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-01-09 21:59:11,703 INFO L435 NwaCegarLoop]: 426 mSDtfsCounter, 17 mSDsluCounter, 724 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 1150 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 21:59:11,703 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 1150 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 21:59:11,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 486 states. [2025-01-09 21:59:11,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 486 to 486. [2025-01-09 21:59:11,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 486 states, 480 states have (on average 1.34375) internal successors, (645), 481 states have internal predecessors, (645), 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-01-09 21:59:11,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 486 states to 486 states and 651 transitions. [2025-01-09 21:59:11,710 INFO L78 Accepts]: Start accepts. Automaton has 486 states and 651 transitions. Word has length 171 [2025-01-09 21:59:11,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 21:59:11,710 INFO L471 AbstractCegarLoop]: Abstraction has 486 states and 651 transitions. [2025-01-09 21:59:11,710 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 41.0) internal successors, (164), 4 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-01-09 21:59:11,711 INFO L276 IsEmpty]: Start isEmpty. Operand 486 states and 651 transitions. [2025-01-09 21:59:11,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2025-01-09 21:59:11,712 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 21:59:11,712 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-01-09 21:59:11,720 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-01-09 21:59:11,912 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,SelfDestructingSolverStorable13 [2025-01-09 21:59:11,913 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-01-09 21:59:11,913 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:59:11,913 INFO L85 PathProgramCache]: Analyzing trace with hash 338509163, now seen corresponding path program 1 times [2025-01-09 21:59:11,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:59:11,913 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1263854283] [2025-01-09 21:59:11,913 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:59:11,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:59:11,945 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 172 statements into 1 equivalence classes. [2025-01-09 21:59:11,962 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 172 of 172 statements. [2025-01-09 21:59:11,962 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:59:11,962 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:59:12,125 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-09 21:59:12,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:59:12,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1263854283] [2025-01-09 21:59:12,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1263854283] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:59:12,125 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:59:12,125 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 21:59:12,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1225633844] [2025-01-09 21:59:12,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:59:12,126 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:59:12,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:59:12,126 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:59:12,126 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:59:12,126 INFO L87 Difference]: Start difference. First operand 486 states and 651 transitions. Second operand has 6 states, 6 states have (on average 27.5) internal successors, (165), 6 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-01-09 21:59:12,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 21:59:12,276 INFO L93 Difference]: Finished difference Result 492 states and 657 transitions. [2025-01-09 21:59:12,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:59:12,276 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 27.5) internal successors, (165), 6 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-01-09 21:59:12,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 21:59:12,277 INFO L225 Difference]: With dead ends: 492 [2025-01-09 21:59:12,277 INFO L226 Difference]: Without dead ends: 492 [2025-01-09 21:59:12,278 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-01-09 21:59:12,278 INFO L435 NwaCegarLoop]: 425 mSDtfsCounter, 8 mSDsluCounter, 1075 mSDsCounter, 0 mSdLazyCounter, 238 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 1500 SdHoareTripleChecker+Invalid, 239 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 238 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 21:59:12,278 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 1500 Invalid, 239 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 238 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 21:59:12,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 492 states. [2025-01-09 21:59:12,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 492 to 492. [2025-01-09 21:59:12,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 492 states, 486 states have (on average 1.3395061728395061) internal successors, (651), 487 states have internal predecessors, (651), 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-01-09 21:59:12,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 492 states to 492 states and 657 transitions. [2025-01-09 21:59:12,284 INFO L78 Accepts]: Start accepts. Automaton has 492 states and 657 transitions. Word has length 172 [2025-01-09 21:59:12,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 21:59:12,284 INFO L471 AbstractCegarLoop]: Abstraction has 492 states and 657 transitions. [2025-01-09 21:59:12,285 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 27.5) internal successors, (165), 6 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-01-09 21:59:12,285 INFO L276 IsEmpty]: Start isEmpty. Operand 492 states and 657 transitions. [2025-01-09 21:59:12,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2025-01-09 21:59:12,286 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 21:59:12,286 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-01-09 21:59:12,286 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 21:59:12,286 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-01-09 21:59:12,286 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:59:12,287 INFO L85 PathProgramCache]: Analyzing trace with hash -1676713178, now seen corresponding path program 1 times [2025-01-09 21:59:12,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:59:12,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1295952045] [2025-01-09 21:59:12,287 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:59:12,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:59:12,318 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 173 statements into 1 equivalence classes. [2025-01-09 21:59:12,336 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 173 of 173 statements. [2025-01-09 21:59:12,336 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:59:12,336 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:59:12,505 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-09 21:59:12,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:59:12,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1295952045] [2025-01-09 21:59:12,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1295952045] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:59:12,505 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:59:12,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 21:59:12,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [564061694] [2025-01-09 21:59:12,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:59:12,506 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 21:59:12,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:59:12,506 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 21:59:12,506 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 21:59:12,506 INFO L87 Difference]: Start difference. First operand 492 states and 657 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-01-09 21:59:12,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 21:59:12,726 INFO L93 Difference]: Finished difference Result 502 states and 669 transitions. [2025-01-09 21:59:12,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 21:59:12,727 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-01-09 21:59:12,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 21:59:12,728 INFO L225 Difference]: With dead ends: 502 [2025-01-09 21:59:12,728 INFO L226 Difference]: Without dead ends: 502 [2025-01-09 21:59:12,729 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-01-09 21:59:12,729 INFO L435 NwaCegarLoop]: 415 mSDtfsCounter, 12 mSDsluCounter, 1756 mSDsCounter, 0 mSdLazyCounter, 399 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 2171 SdHoareTripleChecker+Invalid, 400 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 399 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 21:59:12,730 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 2171 Invalid, 400 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 399 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 21:59:12,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 502 states. [2025-01-09 21:59:12,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 502 to 500. [2025-01-09 21:59:12,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 500 states, 494 states have (on average 1.3380566801619433) internal successors, (661), 495 states have internal predecessors, (661), 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-01-09 21:59:12,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 500 states to 500 states and 667 transitions. [2025-01-09 21:59:12,737 INFO L78 Accepts]: Start accepts. Automaton has 500 states and 667 transitions. Word has length 173 [2025-01-09 21:59:12,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 21:59:12,737 INFO L471 AbstractCegarLoop]: Abstraction has 500 states and 667 transitions. [2025-01-09 21:59:12,737 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-01-09 21:59:12,737 INFO L276 IsEmpty]: Start isEmpty. Operand 500 states and 667 transitions. [2025-01-09 21:59:12,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2025-01-09 21:59:12,739 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 21:59:12,739 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-01-09 21:59:12,739 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 21:59:12,739 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-01-09 21:59:12,740 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:59:12,740 INFO L85 PathProgramCache]: Analyzing trace with hash -1670326846, now seen corresponding path program 1 times [2025-01-09 21:59:12,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:59:12,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419843164] [2025-01-09 21:59:12,740 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:59:12,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:59:12,773 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 173 statements into 1 equivalence classes. [2025-01-09 21:59:12,848 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 173 of 173 statements. [2025-01-09 21:59:12,848 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:59:12,848 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:59:12,988 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 21:59:12,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:59:12,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [419843164] [2025-01-09 21:59:12,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [419843164] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 21:59:12,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1051325911] [2025-01-09 21:59:12,989 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:59:12,989 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 21:59:12,989 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 21:59:12,991 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 21:59:12,992 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-01-09 21:59:13,224 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 173 statements into 1 equivalence classes. [2025-01-09 21:59:13,328 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 173 of 173 statements. [2025-01-09 21:59:13,328 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:59:13,328 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:59:13,331 INFO L256 TraceCheckSpWp]: Trace formula consists of 770 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-01-09 21:59:13,334 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 21:59:31,652 WARN L286 SmtUtils]: Spent 8.04s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-01-09 21:59:45,730 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-09 21:59:45,730 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 21:59:45,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1051325911] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:59:45,730 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 21:59:45,730 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [4] total 9 [2025-01-09 21:59:45,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1375270097] [2025-01-09 21:59:45,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:59:45,731 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 21:59:45,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:59:45,731 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 21:59:45,731 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-01-09 21:59:45,731 INFO L87 Difference]: Start difference. First operand 500 states and 667 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-01-09 21:59:48,150 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-01-09 21:59:51,533 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.99s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-01-09 21:59:55,733 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-01-09 21:59:59,740 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-01-09 22:00:03,756 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-01-09 22:00:06,093 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.34s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-01-09 22:00:07,171 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-01-09 22:00:09,374 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.20s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-01-09 22:00:13,583 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-01-09 22:00:15,898 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.31s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-01-09 22:00:16,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:00:16,110 INFO L93 Difference]: Finished difference Result 505 states and 673 transitions. [2025-01-09 22:00:16,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 22:00:16,110 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 173 [2025-01-09 22:00:16,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:00:16,112 INFO L225 Difference]: With dead ends: 505 [2025-01-09 22:00:16,112 INFO L226 Difference]: Without dead ends: 505 [2025-01-09 22:00:16,112 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 169 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-01-09 22:00:16,112 INFO L435 NwaCegarLoop]: 421 mSDtfsCounter, 12 mSDsluCounter, 1454 mSDsCounter, 0 mSdLazyCounter, 770 mSolverCounterSat, 3 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 30.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 1875 SdHoareTripleChecker+Invalid, 777 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 770 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 30.4s IncrementalHoareTripleChecker+Time [2025-01-09 22:00:16,112 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 1875 Invalid, 777 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 770 Invalid, 4 Unknown, 0 Unchecked, 30.4s Time] [2025-01-09 22:00:16,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 505 states. [2025-01-09 22:00:16,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 505 to 500. [2025-01-09 22:00:16,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 500 states, 494 states have (on average 1.3380566801619433) internal successors, (661), 495 states have internal predecessors, (661), 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-01-09 22:00:16,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 500 states to 500 states and 667 transitions. [2025-01-09 22:00:16,119 INFO L78 Accepts]: Start accepts. Automaton has 500 states and 667 transitions. Word has length 173 [2025-01-09 22:00:16,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:00:16,119 INFO L471 AbstractCegarLoop]: Abstraction has 500 states and 667 transitions. [2025-01-09 22:00:16,119 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-01-09 22:00:16,119 INFO L276 IsEmpty]: Start isEmpty. Operand 500 states and 667 transitions. [2025-01-09 22:00:16,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2025-01-09 22:00:16,121 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:00:16,121 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, 1] [2025-01-09 22:00:16,130 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-01-09 22:00:16,321 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:00:16,321 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-01-09 22:00:16,322 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:00:16,322 INFO L85 PathProgramCache]: Analyzing trace with hash 243480978, now seen corresponding path program 1 times [2025-01-09 22:00:16,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:00:16,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [254854028] [2025-01-09 22:00:16,322 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:00:16,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:00:16,351 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-01-09 22:00:16,373 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-01-09 22:00:16,373 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:00:16,373 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:00:16,672 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-09 22:00:16,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:00:16,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [254854028] [2025-01-09 22:00:16,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [254854028] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:00:16,673 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:00:16,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 22:00:16,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [139784030] [2025-01-09 22:00:16,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:00:16,673 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 22:00:16,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:00:16,674 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 22:00:16,674 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-01-09 22:00:16,674 INFO L87 Difference]: Start difference. First operand 500 states and 667 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-01-09 22:00:17,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:00:17,311 INFO L93 Difference]: Finished difference Result 516 states and 688 transitions. [2025-01-09 22:00:17,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 22:00:17,312 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 175 [2025-01-09 22:00:17,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:00:17,313 INFO L225 Difference]: With dead ends: 516 [2025-01-09 22:00:17,314 INFO L226 Difference]: Without dead ends: 516 [2025-01-09 22:00:17,314 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-01-09 22:00:17,314 INFO L435 NwaCegarLoop]: 422 mSDtfsCounter, 26 mSDsluCounter, 2095 mSDsCounter, 0 mSdLazyCounter, 1092 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 2517 SdHoareTripleChecker+Invalid, 1093 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1092 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 22:00:17,314 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 2517 Invalid, 1093 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1092 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 22:00:17,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 516 states. [2025-01-09 22:00:17,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 516 to 510. [2025-01-09 22:00:17,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 510 states, 504 states have (on average 1.3353174603174602) internal successors, (673), 505 states have internal predecessors, (673), 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-01-09 22:00:17,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 510 states to 510 states and 679 transitions. [2025-01-09 22:00:17,320 INFO L78 Accepts]: Start accepts. Automaton has 510 states and 679 transitions. Word has length 175 [2025-01-09 22:00:17,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:00:17,321 INFO L471 AbstractCegarLoop]: Abstraction has 510 states and 679 transitions. [2025-01-09 22:00:17,321 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-01-09 22:00:17,321 INFO L276 IsEmpty]: Start isEmpty. Operand 510 states and 679 transitions. [2025-01-09 22:00:17,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2025-01-09 22:00:17,322 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:00:17,322 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, 1] [2025-01-09 22:00:17,322 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-09 22:00:17,322 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-01-09 22:00:17,323 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:00:17,323 INFO L85 PathProgramCache]: Analyzing trace with hash -440512978, now seen corresponding path program 1 times [2025-01-09 22:00:17,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:00:17,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419768005] [2025-01-09 22:00:17,323 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:00:17,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:00:17,354 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-01-09 22:00:17,420 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-01-09 22:00:17,421 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:00:17,421 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:00:17,537 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 22:00:17,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:00:17,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [419768005] [2025-01-09 22:00:17,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [419768005] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:00:17,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1967329290] [2025-01-09 22:00:17,538 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:00:17,538 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:00:17,538 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:00:17,540 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 22:00:17,541 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-01-09 22:00:17,810 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-01-09 22:00:17,914 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-01-09 22:00:17,915 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:00:17,915 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:00:17,918 INFO L256 TraceCheckSpWp]: Trace formula consists of 772 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-01-09 22:00:17,921 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:00:18,331 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-09 22:00:18,331 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 22:00:18,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1967329290] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:00:18,331 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 22:00:18,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [4] total 13 [2025-01-09 22:00:18,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [222160925] [2025-01-09 22:00:18,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:00:18,332 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 22:00:18,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:00:18,332 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 22:00:18,332 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2025-01-09 22:00:18,332 INFO L87 Difference]: Start difference. First operand 510 states and 679 transitions. Second operand has 11 states, 11 states have (on average 15.181818181818182) internal successors, (167), 11 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-01-09 22:00:19,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:00:19,590 INFO L93 Difference]: Finished difference Result 515 states and 684 transitions. [2025-01-09 22:00:19,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 22:00:19,591 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 15.181818181818182) internal successors, (167), 11 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 175 [2025-01-09 22:00:19,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:00:19,592 INFO L225 Difference]: With dead ends: 515 [2025-01-09 22:00:19,592 INFO L226 Difference]: Without dead ends: 515 [2025-01-09 22:00:19,593 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 167 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2025-01-09 22:00:19,593 INFO L435 NwaCegarLoop]: 420 mSDtfsCounter, 11 mSDsluCounter, 2588 mSDsCounter, 0 mSdLazyCounter, 1396 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 3008 SdHoareTripleChecker+Invalid, 1397 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1396 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-01-09 22:00:19,593 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 3008 Invalid, 1397 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1396 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-01-09 22:00:19,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 515 states. [2025-01-09 22:00:19,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 515 to 513. [2025-01-09 22:00:19,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 513 states, 507 states have (on average 1.3333333333333333) internal successors, (676), 508 states have internal predecessors, (676), 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-01-09 22:00:19,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 513 states to 513 states and 682 transitions. [2025-01-09 22:00:19,598 INFO L78 Accepts]: Start accepts. Automaton has 513 states and 682 transitions. Word has length 175 [2025-01-09 22:00:19,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:00:19,599 INFO L471 AbstractCegarLoop]: Abstraction has 513 states and 682 transitions. [2025-01-09 22:00:19,599 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 15.181818181818182) internal successors, (167), 11 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-01-09 22:00:19,599 INFO L276 IsEmpty]: Start isEmpty. Operand 513 states and 682 transitions. [2025-01-09 22:00:19,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2025-01-09 22:00:19,600 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:00:19,600 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, 1] [2025-01-09 22:00:19,609 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-01-09 22:00:19,805 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:00:19,805 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-01-09 22:00:19,805 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:00:19,805 INFO L85 PathProgramCache]: Analyzing trace with hash -215788921, now seen corresponding path program 1 times [2025-01-09 22:00:19,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:00:19,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1486437754] [2025-01-09 22:00:19,806 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:00:19,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:00:19,836 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-01-09 22:00:19,889 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-01-09 22:00:19,890 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:00:19,890 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:00:20,029 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 22:00:20,029 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:00:20,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1486437754] [2025-01-09 22:00:20,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1486437754] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:00:20,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1378176448] [2025-01-09 22:00:20,029 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:00:20,029 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:00:20,030 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:00:20,032 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 22:00:20,033 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-01-09 22:00:20,286 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-01-09 22:00:20,454 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-01-09 22:00:20,454 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:00:20,454 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:00:20,457 INFO L256 TraceCheckSpWp]: Trace formula consists of 772 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-01-09 22:00:20,460 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:00:20,617 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-09 22:00:20,617 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 22:00:20,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1378176448] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:00:20,617 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 22:00:20,617 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [4] total 9 [2025-01-09 22:00:20,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1843885141] [2025-01-09 22:00:20,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:00:20,617 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 22:00:20,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:00:20,618 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 22:00:20,618 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-01-09 22:00:20,618 INFO L87 Difference]: Start difference. First operand 513 states and 682 transitions. Second operand has 7 states, 7 states have (on average 24.0) internal successors, (168), 7 states have internal predecessors, (168), 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-01-09 22:00:21,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:00:21,061 INFO L93 Difference]: Finished difference Result 523 states and 692 transitions. [2025-01-09 22:00:21,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 22:00:21,061 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 24.0) internal successors, (168), 7 states have internal predecessors, (168), 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 175 [2025-01-09 22:00:21,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:00:21,062 INFO L225 Difference]: With dead ends: 523 [2025-01-09 22:00:21,063 INFO L226 Difference]: Without dead ends: 523 [2025-01-09 22:00:21,063 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 171 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-01-09 22:00:21,063 INFO L435 NwaCegarLoop]: 420 mSDtfsCounter, 12 mSDsluCounter, 1740 mSDsCounter, 0 mSdLazyCounter, 436 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 2160 SdHoareTripleChecker+Invalid, 438 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 436 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 22:00:21,063 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 2160 Invalid, 438 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 436 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 22:00:21,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 523 states. [2025-01-09 22:00:21,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 523 to 519. [2025-01-09 22:00:21,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 519 states, 513 states have (on average 1.3294346978557505) internal successors, (682), 514 states have internal predecessors, (682), 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-01-09 22:00:21,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 519 states to 519 states and 688 transitions. [2025-01-09 22:00:21,069 INFO L78 Accepts]: Start accepts. Automaton has 519 states and 688 transitions. Word has length 175 [2025-01-09 22:00:21,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:00:21,069 INFO L471 AbstractCegarLoop]: Abstraction has 519 states and 688 transitions. [2025-01-09 22:00:21,069 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 24.0) internal successors, (168), 7 states have internal predecessors, (168), 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-01-09 22:00:21,069 INFO L276 IsEmpty]: Start isEmpty. Operand 519 states and 688 transitions. [2025-01-09 22:00:21,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2025-01-09 22:00:21,070 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:00:21,070 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, 1, 1] [2025-01-09 22:00:21,081 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-01-09 22:00:21,270 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:00:21,271 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-01-09 22:00:21,271 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:00:21,271 INFO L85 PathProgramCache]: Analyzing trace with hash -1199523140, now seen corresponding path program 1 times [2025-01-09 22:00:21,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:00:21,271 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190084259] [2025-01-09 22:00:21,271 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:00:21,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:00:21,300 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 176 statements into 1 equivalence classes. [2025-01-09 22:00:21,320 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 176 of 176 statements. [2025-01-09 22:00:21,320 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:00:21,320 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:00:21,512 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-09 22:00:21,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:00:21,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [190084259] [2025-01-09 22:00:21,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [190084259] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:00:21,513 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:00:21,513 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 22:00:21,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1845955971] [2025-01-09 22:00:21,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:00:21,514 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 22:00:21,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:00:21,514 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 22:00:21,514 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-01-09 22:00:21,515 INFO L87 Difference]: Start difference. First operand 519 states and 688 transitions. Second operand has 9 states, 9 states have (on average 18.77777777777778) internal successors, (169), 9 states have internal predecessors, (169), 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-01-09 22:00:21,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:00:21,861 INFO L93 Difference]: Finished difference Result 539 states and 712 transitions. [2025-01-09 22:00:21,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 22:00:21,861 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 18.77777777777778) internal successors, (169), 9 states have internal predecessors, (169), 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 176 [2025-01-09 22:00:21,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:00:21,863 INFO L225 Difference]: With dead ends: 539 [2025-01-09 22:00:21,863 INFO L226 Difference]: Without dead ends: 539 [2025-01-09 22:00:21,863 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-01-09 22:00:21,863 INFO L435 NwaCegarLoop]: 415 mSDtfsCounter, 20 mSDsluCounter, 2531 mSDsCounter, 0 mSdLazyCounter, 490 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 2946 SdHoareTripleChecker+Invalid, 491 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 490 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 22:00:21,864 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 2946 Invalid, 491 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 490 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 22:00:21,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 539 states. [2025-01-09 22:00:21,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 539 to 533. [2025-01-09 22:00:21,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 533 states, 527 states have (on average 1.3282732447817838) internal successors, (700), 528 states have internal predecessors, (700), 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-01-09 22:00:21,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 533 states to 533 states and 706 transitions. [2025-01-09 22:00:21,869 INFO L78 Accepts]: Start accepts. Automaton has 533 states and 706 transitions. Word has length 176 [2025-01-09 22:00:21,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:00:21,869 INFO L471 AbstractCegarLoop]: Abstraction has 533 states and 706 transitions. [2025-01-09 22:00:21,869 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 18.77777777777778) internal successors, (169), 9 states have internal predecessors, (169), 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-01-09 22:00:21,869 INFO L276 IsEmpty]: Start isEmpty. Operand 533 states and 706 transitions. [2025-01-09 22:00:21,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2025-01-09 22:00:21,870 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:00:21,871 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, 1, 1, 1] [2025-01-09 22:00:21,871 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-01-09 22:00:21,871 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-01-09 22:00:21,871 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:00:21,871 INFO L85 PathProgramCache]: Analyzing trace with hash -1854184585, now seen corresponding path program 1 times [2025-01-09 22:00:21,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:00:21,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1579853064] [2025-01-09 22:00:21,872 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:00:21,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:00:21,903 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 177 statements into 1 equivalence classes. [2025-01-09 22:00:21,921 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 177 of 177 statements. [2025-01-09 22:00:21,921 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:00:21,921 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:00:22,222 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-09 22:00:22,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:00:22,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1579853064] [2025-01-09 22:00:22,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1579853064] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:00:22,223 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:00:22,223 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 22:00:22,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [275898575] [2025-01-09 22:00:22,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:00:22,223 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 22:00:22,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:00:22,224 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 22:00:22,224 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-01-09 22:00:22,224 INFO L87 Difference]: Start difference. First operand 533 states and 706 transitions. Second operand has 10 states, 10 states have (on average 17.0) internal successors, (170), 10 states have internal predecessors, (170), 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-01-09 22:00:22,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:00:22,613 INFO L93 Difference]: Finished difference Result 551 states and 730 transitions. [2025-01-09 22:00:22,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 22:00:22,614 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 17.0) internal successors, (170), 10 states have internal predecessors, (170), 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 177 [2025-01-09 22:00:22,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:00:22,615 INFO L225 Difference]: With dead ends: 551 [2025-01-09 22:00:22,615 INFO L226 Difference]: Without dead ends: 551 [2025-01-09 22:00:22,615 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-01-09 22:00:22,617 INFO L435 NwaCegarLoop]: 422 mSDtfsCounter, 23 mSDsluCounter, 2541 mSDsCounter, 0 mSdLazyCounter, 626 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 2963 SdHoareTripleChecker+Invalid, 627 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 626 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 22:00:22,617 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 2963 Invalid, 627 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 626 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 22:00:22,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 551 states. [2025-01-09 22:00:22,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 551 to 539. [2025-01-09 22:00:22,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 539 states, 533 states have (on average 1.324577861163227) internal successors, (706), 534 states have internal predecessors, (706), 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-01-09 22:00:22,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 539 states to 539 states and 712 transitions. [2025-01-09 22:00:22,623 INFO L78 Accepts]: Start accepts. Automaton has 539 states and 712 transitions. Word has length 177 [2025-01-09 22:00:22,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:00:22,623 INFO L471 AbstractCegarLoop]: Abstraction has 539 states and 712 transitions. [2025-01-09 22:00:22,623 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 17.0) internal successors, (170), 10 states have internal predecessors, (170), 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-01-09 22:00:22,623 INFO L276 IsEmpty]: Start isEmpty. Operand 539 states and 712 transitions. [2025-01-09 22:00:22,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2025-01-09 22:00:22,624 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:00:22,624 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, 1, 1, 1] [2025-01-09 22:00:22,624 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-01-09 22:00:22,624 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-01-09 22:00:22,625 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:00:22,625 INFO L85 PathProgramCache]: Analyzing trace with hash -905818221, now seen corresponding path program 1 times [2025-01-09 22:00:22,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:00:22,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455894876] [2025-01-09 22:00:22,625 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:00:22,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:00:22,655 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 177 statements into 1 equivalence classes. [2025-01-09 22:00:22,725 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 177 of 177 statements. [2025-01-09 22:00:22,725 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:00:22,725 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:00:22,846 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 22:00:22,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:00:22,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1455894876] [2025-01-09 22:00:22,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1455894876] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:00:22,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1334621017] [2025-01-09 22:00:22,846 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:00:22,846 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:00:22,847 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:00:22,848 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 22:00:22,850 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-01-09 22:00:23,152 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 177 statements into 1 equivalence classes. [2025-01-09 22:00:23,233 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 177 of 177 statements. [2025-01-09 22:00:23,233 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:00:23,233 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:00:23,236 INFO L256 TraceCheckSpWp]: Trace formula consists of 774 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-01-09 22:00:23,238 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:00:23,302 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-09 22:00:23,302 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 22:00:23,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1334621017] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:00:23,302 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 22:00:23,303 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [4] total 9 [2025-01-09 22:00:23,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [586834269] [2025-01-09 22:00:23,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:00:23,303 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 22:00:23,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:00:23,303 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 22:00:23,303 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-01-09 22:00:23,303 INFO L87 Difference]: Start difference. First operand 539 states and 712 transitions. Second operand has 7 states, 7 states have (on average 24.285714285714285) internal successors, (170), 7 states have internal predecessors, (170), 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-01-09 22:00:23,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:00:23,527 INFO L93 Difference]: Finished difference Result 553 states and 730 transitions. [2025-01-09 22:00:23,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 22:00:23,530 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 24.285714285714285) internal successors, (170), 7 states have internal predecessors, (170), 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 177 [2025-01-09 22:00:23,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:00:23,532 INFO L225 Difference]: With dead ends: 553 [2025-01-09 22:00:23,532 INFO L226 Difference]: Without dead ends: 553 [2025-01-09 22:00:23,532 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 173 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-01-09 22:00:23,532 INFO L435 NwaCegarLoop]: 410 mSDtfsCounter, 39 mSDsluCounter, 1780 mSDsCounter, 0 mSdLazyCounter, 355 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 2190 SdHoareTripleChecker+Invalid, 359 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 355 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 22:00:23,532 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 2190 Invalid, 359 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 355 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 22:00:23,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 553 states. [2025-01-09 22:00:23,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 553 to 543. [2025-01-09 22:00:23,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 543 states, 537 states have (on average 1.3221601489757915) internal successors, (710), 538 states have internal predecessors, (710), 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-01-09 22:00:23,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 543 states to 543 states and 716 transitions. [2025-01-09 22:00:23,539 INFO L78 Accepts]: Start accepts. Automaton has 543 states and 716 transitions. Word has length 177 [2025-01-09 22:00:23,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:00:23,539 INFO L471 AbstractCegarLoop]: Abstraction has 543 states and 716 transitions. [2025-01-09 22:00:23,539 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 24.285714285714285) internal successors, (170), 7 states have internal predecessors, (170), 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-01-09 22:00:23,539 INFO L276 IsEmpty]: Start isEmpty. Operand 543 states and 716 transitions. [2025-01-09 22:00:23,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2025-01-09 22:00:23,540 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:00:23,540 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, 1, 1, 1] [2025-01-09 22:00:23,550 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-01-09 22:00:23,741 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2025-01-09 22:00:23,741 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-01-09 22:00:23,741 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:00:23,742 INFO L85 PathProgramCache]: Analyzing trace with hash -850378644, now seen corresponding path program 1 times [2025-01-09 22:00:23,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:00:23,742 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [193542238] [2025-01-09 22:00:23,742 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:00:23,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:00:23,770 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 177 statements into 1 equivalence classes. [2025-01-09 22:00:23,887 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 177 of 177 statements. [2025-01-09 22:00:23,887 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:00:23,887 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:00:24,007 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 22:00:24,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:00:24,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [193542238] [2025-01-09 22:00:24,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [193542238] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:00:24,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [3453810] [2025-01-09 22:00:24,007 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:00:24,007 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:00:24,008 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:00:24,009 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 22:00:24,011 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