./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memcleanup.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test9-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_OAT_test9-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 501447f5c37550c3f5e8fdfcef22269dce5065ef789f4faf9fbe7fcfc263a044 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 21:57:48,818 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 21:57:48,891 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:57:48,896 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 21:57:48,898 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 21:57:48,920 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 21:57:48,921 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 21:57:48,921 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 21:57:48,922 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 21:57:48,922 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 21:57:48,923 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 21:57:48,923 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 21:57:48,923 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 21:57:48,923 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 21:57:48,923 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 21:57:48,924 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 21:57:48,924 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 21:57:48,924 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 21:57:48,924 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 21:57:48,924 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 21:57:48,925 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 21:57:48,925 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 21:57:48,925 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-01-09 21:57:48,925 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-01-09 21:57:48,925 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 21:57:48,925 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 21:57:48,925 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-09 21:57:48,925 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-09 21:57:48,925 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 21:57:48,926 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 21:57:48,926 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 21:57:48,926 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 21:57:48,926 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 21:57:48,926 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 21:57:48,926 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 21:57:48,926 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 21:57:48,926 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:57:48,926 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 21:57:48,926 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 21:57:48,926 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 21:57:48,926 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 21:57:48,926 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:57:48,926 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 21:57:48,926 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 21:57:48,926 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 21:57:48,927 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 21:57:48,927 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 21:57:48,927 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 21:57:48,927 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 21:57:48,927 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 21:57:48,927 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 -> 501447f5c37550c3f5e8fdfcef22269dce5065ef789f4faf9fbe7fcfc263a044 [2025-01-09 21:57:49,161 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 21:57:49,169 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 21:57:49,171 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 21:57:49,172 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 21:57:49,172 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 21:57:49,174 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_OAT_test9-1.i [2025-01-09 21:57:50,491 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/30180db6a/8dde01f0aa4b40cea0acea90e2935706/FLAG514afce2f [2025-01-09 21:57:51,000 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 21:57:51,004 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test9-1.i [2025-01-09 21:57:51,037 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/30180db6a/8dde01f0aa4b40cea0acea90e2935706/FLAG514afce2f [2025-01-09 21:57:51,057 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/30180db6a/8dde01f0aa4b40cea0acea90e2935706 [2025-01-09 21:57:51,059 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 21:57:51,060 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 21:57:51,062 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 21:57:51,062 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 21:57:51,069 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 21:57:51,070 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:57:51" (1/1) ... [2025-01-09 21:57:51,071 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4cdfd7f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:57:51, skipping insertion in model container [2025-01-09 21:57:51,072 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:57:51" (1/1) ... [2025-01-09 21:57:51,130 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 21:57:51,593 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:57:51,620 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:57:51,623 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:57:51,625 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:57:51,630 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:57:51,648 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:57:51,650 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:57:51,652 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:57:51,652 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:57:51,658 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 21:57:51,668 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 21:57:51,817 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 21:57:51,852 INFO L204 MainTranslator]: Completed translation [2025-01-09 21:57:51,854 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:57:51 WrapperNode [2025-01-09 21:57:51,854 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 21:57:51,855 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 21:57:51,855 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 21:57:51,856 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 21:57:51,862 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:57:51" (1/1) ... [2025-01-09 21:57:51,907 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:57:51" (1/1) ... [2025-01-09 21:57:52,023 INFO L138 Inliner]: procedures = 177, calls = 724, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 3244 [2025-01-09 21:57:52,024 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 21:57:52,025 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 21:57:52,025 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 21:57:52,025 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 21:57:52,034 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:57:51" (1/1) ... [2025-01-09 21:57:52,034 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:57:51" (1/1) ... [2025-01-09 21:57:52,070 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:57:51" (1/1) ... [2025-01-09 21:57:52,141 INFO L175 MemorySlicer]: Split 208 memory accesses to 3 slices as follows [2, 34, 172]. 83 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 46 writes are split as follows [0, 4, 42]. [2025-01-09 21:57:52,141 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:57:51" (1/1) ... [2025-01-09 21:57:52,141 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:57:51" (1/1) ... [2025-01-09 21:57:52,203 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:57:51" (1/1) ... [2025-01-09 21:57:52,208 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:57:51" (1/1) ... [2025-01-09 21:57:52,231 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:57:51" (1/1) ... [2025-01-09 21:57:52,244 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:57:51" (1/1) ... [2025-01-09 21:57:52,256 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:57:51" (1/1) ... [2025-01-09 21:57:52,270 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 21:57:52,271 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 21:57:52,271 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 21:57:52,271 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 21:57:52,273 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:57:51" (1/1) ... [2025-01-09 21:57:52,278 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:57:52,289 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 21:57:52,303 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:57:52,311 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:57:52,328 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2025-01-09 21:57:52,328 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2025-01-09 21:57:52,329 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-09 21:57:52,329 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-09 21:57:52,329 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-01-09 21:57:52,330 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-01-09 21:57:52,330 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-01-09 21:57:52,330 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-09 21:57:52,330 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-09 21:57:52,330 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-01-09 21:57:52,330 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2025-01-09 21:57:52,331 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2025-01-09 21:57:52,331 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2025-01-09 21:57:52,331 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2025-01-09 21:57:52,331 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2025-01-09 21:57:52,331 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2025-01-09 21:57:52,331 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-09 21:57:52,331 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 21:57:52,331 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-01-09 21:57:52,332 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-01-09 21:57:52,332 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-01-09 21:57:52,332 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-01-09 21:57:52,332 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-01-09 21:57:52,332 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-01-09 21:57:52,332 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-01-09 21:57:52,332 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-09 21:57:52,332 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 21:57:52,332 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-09 21:57:52,332 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-09 21:57:52,332 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 21:57:52,332 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 21:57:52,524 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 21:57:52,525 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 21:57:55,103 INFO L? ?]: Removed 799 outVars from TransFormulas that were not future-live. [2025-01-09 21:57:55,103 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 21:57:55,154 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 21:57:55,154 INFO L312 CfgBuilder]: Removed 27 assume(true) statements. [2025-01-09 21:57:55,155 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:57:55 BoogieIcfgContainer [2025-01-09 21:57:55,155 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 21:57:55,157 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 21:57:55,157 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 21:57:55,161 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 21:57:55,161 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 09:57:51" (1/3) ... [2025-01-09 21:57:55,163 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@655b6032 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:57:55, skipping insertion in model container [2025-01-09 21:57:55,163 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:57:51" (2/3) ... [2025-01-09 21:57:55,164 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@655b6032 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:57:55, skipping insertion in model container [2025-01-09 21:57:55,164 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:57:55" (3/3) ... [2025-01-09 21:57:55,165 INFO L128 eAbstractionObserver]: Analyzing ICFG uthash_OAT_test9-1.i [2025-01-09 21:57:55,177 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 21:57:55,179 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG uthash_OAT_test9-1.i that has 6 procedures, 1382 locations, 1 initial locations, 33 loop locations, and 2 error locations. [2025-01-09 21:57:55,245 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 21:57:55,256 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;@639d06d3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 21:57:55,256 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-01-09 21:57:55,265 INFO L276 IsEmpty]: Start isEmpty. Operand has 1374 states, 863 states have (on average 1.8354577056778678) internal successors, (1584), 1367 states have internal predecessors, (1584), 505 states have call successors, (505), 3 states have call predecessors, (505), 3 states have return successors, (505), 6 states have call predecessors, (505), 505 states have call successors, (505) [2025-01-09 21:57:55,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-01-09 21:57:55,271 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 21:57:55,272 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:57:55,272 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-01-09 21:57:55,276 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:57:55,277 INFO L85 PathProgramCache]: Analyzing trace with hash -1576407180, now seen corresponding path program 1 times [2025-01-09 21:57:55,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:57:55,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [997779962] [2025-01-09 21:57:55,285 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:57:55,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:57:55,362 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-01-09 21:57:55,377 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-09 21:57:55,378 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:57:55,378 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:57:55,425 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:57:55,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:57:55,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [997779962] [2025-01-09 21:57:55,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [997779962] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:57:55,427 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:57:55,428 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:57:55,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [191140028] [2025-01-09 21:57:55,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:57:55,431 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 21:57:55,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:57:55,453 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 21:57:55,453 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 21:57:55,459 INFO L87 Difference]: Start difference. First operand has 1374 states, 863 states have (on average 1.8354577056778678) internal successors, (1584), 1367 states have internal predecessors, (1584), 505 states have call successors, (505), 3 states have call predecessors, (505), 3 states have return successors, (505), 6 states have call predecessors, (505), 505 states have call successors, (505) Second operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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:57:55,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 21:57:55,589 INFO L93 Difference]: Finished difference Result 1372 states and 2535 transitions. [2025-01-09 21:57:55,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 21:57:55,591 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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 7 [2025-01-09 21:57:55,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 21:57:55,611 INFO L225 Difference]: With dead ends: 1372 [2025-01-09 21:57:55,612 INFO L226 Difference]: Without dead ends: 1370 [2025-01-09 21:57:55,613 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 21:57:55,615 INFO L435 NwaCegarLoop]: 2535 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2535 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 21:57:55,615 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2535 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 21:57:55,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1370 states. [2025-01-09 21:57:55,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1370 to 1370. [2025-01-09 21:57:55,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1370 states, 861 states have (on average 1.7711962833914054) internal successors, (1525), 1363 states have internal predecessors, (1525), 505 states have call successors, (505), 3 states have call predecessors, (505), 2 states have return successors, (503), 4 states have call predecessors, (503), 503 states have call successors, (503) [2025-01-09 21:57:55,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1370 states to 1370 states and 2533 transitions. [2025-01-09 21:57:55,993 INFO L78 Accepts]: Start accepts. Automaton has 1370 states and 2533 transitions. Word has length 7 [2025-01-09 21:57:55,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 21:57:55,994 INFO L471 AbstractCegarLoop]: Abstraction has 1370 states and 2533 transitions. [2025-01-09 21:57:55,994 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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:57:55,994 INFO L276 IsEmpty]: Start isEmpty. Operand 1370 states and 2533 transitions. [2025-01-09 21:57:55,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-01-09 21:57:55,995 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 21:57:55,995 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:57:55,995 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 21:57:55,995 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-01-09 21:57:55,996 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:57:55,997 INFO L85 PathProgramCache]: Analyzing trace with hash -877155312, now seen corresponding path program 1 times [2025-01-09 21:57:55,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:57:55,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [529384631] [2025-01-09 21:57:55,997 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:57:55,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:57:56,014 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-09 21:57:56,030 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-09 21:57:56,033 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:57:56,034 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:57:56,213 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:57:56,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:57:56,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [529384631] [2025-01-09 21:57:56,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [529384631] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:57:56,213 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:57:56,213 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 21:57:56,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [903295883] [2025-01-09 21:57:56,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:57:56,215 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 21:57:56,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:57:56,215 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 21:57:56,216 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 21:57:56,216 INFO L87 Difference]: Start difference. First operand 1370 states and 2533 transitions. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:57:57,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 21:57:57,007 INFO L93 Difference]: Finished difference Result 2723 states and 5050 transitions. [2025-01-09 21:57:57,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 21:57:57,008 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2025-01-09 21:57:57,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 21:57:57,024 INFO L225 Difference]: With dead ends: 2723 [2025-01-09 21:57:57,024 INFO L226 Difference]: Without dead ends: 2723 [2025-01-09 21:57:57,024 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:57:57,025 INFO L435 NwaCegarLoop]: 2579 mSDtfsCounter, 1507 mSDsluCounter, 4585 mSDsCounter, 0 mSdLazyCounter, 565 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2010 SdHoareTripleChecker+Valid, 7164 SdHoareTripleChecker+Invalid, 566 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 565 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 21:57:57,025 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2010 Valid, 7164 Invalid, 566 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 565 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 21:57:57,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2723 states. [2025-01-09 21:57:57,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2723 to 1372. [2025-01-09 21:57:57,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1372 states, 863 states have (on average 1.7694090382387022) internal successors, (1527), 1365 states have internal predecessors, (1527), 505 states have call successors, (505), 3 states have call predecessors, (505), 2 states have return successors, (503), 4 states have call predecessors, (503), 503 states have call successors, (503) [2025-01-09 21:57:57,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1372 states to 1372 states and 2535 transitions. [2025-01-09 21:57:57,470 INFO L78 Accepts]: Start accepts. Automaton has 1372 states and 2535 transitions. Word has length 9 [2025-01-09 21:57:57,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 21:57:57,470 INFO L471 AbstractCegarLoop]: Abstraction has 1372 states and 2535 transitions. [2025-01-09 21:57:57,471 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:57:57,471 INFO L276 IsEmpty]: Start isEmpty. Operand 1372 states and 2535 transitions. [2025-01-09 21:57:57,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2025-01-09 21:57:57,473 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 21:57:57,473 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] [2025-01-09 21:57:57,473 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 21:57:57,473 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-01-09 21:57:57,474 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:57:57,474 INFO L85 PathProgramCache]: Analyzing trace with hash 1910063308, now seen corresponding path program 1 times [2025-01-09 21:57:57,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:57:57,474 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2146609651] [2025-01-09 21:57:57,475 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:57:57,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:57:57,518 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-01-09 21:57:57,528 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-01-09 21:57:57,529 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:57:57,529 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:57:57,853 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:57:57,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:57:57,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2146609651] [2025-01-09 21:57:57,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2146609651] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:57:57,854 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:57:57,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 21:57:57,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [626197137] [2025-01-09 21:57:57,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:57:57,854 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 21:57:57,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:57:57,855 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 21:57:57,856 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 21:57:57,856 INFO L87 Difference]: Start difference. First operand 1372 states and 2535 transitions. Second operand has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 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:57:57,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 21:57:57,954 INFO L93 Difference]: Finished difference Result 1330 states and 2458 transitions. [2025-01-09 21:57:57,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 21:57:57,954 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 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 85 [2025-01-09 21:57:57,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 21:57:57,964 INFO L225 Difference]: With dead ends: 1330 [2025-01-09 21:57:57,964 INFO L226 Difference]: Without dead ends: 1330 [2025-01-09 21:57:57,965 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:57:57,967 INFO L435 NwaCegarLoop]: 2432 mSDtfsCounter, 30 mSDsluCounter, 4845 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 7277 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.1s IncrementalHoareTripleChecker+Time [2025-01-09 21:57:57,968 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 7277 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 21:57:57,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1330 states. [2025-01-09 21:57:58,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1330 to 1330. [2025-01-09 21:57:58,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1330 states, 821 states have (on average 1.7661388550548112) internal successors, (1450), 1323 states have internal predecessors, (1450), 505 states have call successors, (505), 3 states have call predecessors, (505), 2 states have return successors, (503), 4 states have call predecessors, (503), 503 states have call successors, (503) [2025-01-09 21:57:58,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1330 states to 1330 states and 2458 transitions. [2025-01-09 21:57:58,067 INFO L78 Accepts]: Start accepts. Automaton has 1330 states and 2458 transitions. Word has length 85 [2025-01-09 21:57:58,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 21:57:58,067 INFO L471 AbstractCegarLoop]: Abstraction has 1330 states and 2458 transitions. [2025-01-09 21:57:58,067 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 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:57:58,068 INFO L276 IsEmpty]: Start isEmpty. Operand 1330 states and 2458 transitions. [2025-01-09 21:57:58,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2025-01-09 21:57:58,074 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 21:57:58,074 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] [2025-01-09 21:57:58,074 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 21:57:58,074 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-01-09 21:57:58,075 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:57:58,075 INFO L85 PathProgramCache]: Analyzing trace with hash 380589376, now seen corresponding path program 1 times [2025-01-09 21:57:58,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:57:58,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [285109175] [2025-01-09 21:57:58,075 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:57:58,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:57:58,120 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-01-09 21:57:58,146 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-01-09 21:57:58,146 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:57:58,146 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:57:58,308 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:57:58,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:57:58,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [285109175] [2025-01-09 21:57:58,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [285109175] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:57:58,309 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:57:58,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 21:57:58,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [856806954] [2025-01-09 21:57:58,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:57:58,309 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:57:58,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:57:58,310 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:57:58,310 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:57:58,310 INFO L87 Difference]: Start difference. First operand 1330 states and 2458 transitions. Second operand has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 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:57:58,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 21:57:58,416 INFO L93 Difference]: Finished difference Result 2556 states and 4782 transitions. [2025-01-09 21:57:58,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:57:58,417 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 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 85 [2025-01-09 21:57:58,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 21:57:58,433 INFO L225 Difference]: With dead ends: 2556 [2025-01-09 21:57:58,433 INFO L226 Difference]: Without dead ends: 2556 [2025-01-09 21:57:58,433 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:57:58,434 INFO L435 NwaCegarLoop]: 2655 mSDtfsCounter, 1262 mSDsluCounter, 2436 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1762 SdHoareTripleChecker+Valid, 5091 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:57:58,435 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1762 Valid, 5091 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 21:57:58,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2556 states. [2025-01-09 21:57:58,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2556 to 2552. [2025-01-09 21:57:58,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2552 states, 1543 states have (on average 1.795852235904083) internal successors, (2771), 2545 states have internal predecessors, (2771), 1005 states have call successors, (1005), 3 states have call predecessors, (1005), 2 states have return successors, (1003), 5 states have call predecessors, (1003), 1003 states have call successors, (1003) [2025-01-09 21:57:58,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2552 states to 2552 states and 4779 transitions. [2025-01-09 21:57:58,729 INFO L78 Accepts]: Start accepts. Automaton has 2552 states and 4779 transitions. Word has length 85 [2025-01-09 21:57:58,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 21:57:58,731 INFO L471 AbstractCegarLoop]: Abstraction has 2552 states and 4779 transitions. [2025-01-09 21:57:58,731 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 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:57:58,732 INFO L276 IsEmpty]: Start isEmpty. Operand 2552 states and 4779 transitions. [2025-01-09 21:57:58,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-01-09 21:57:58,734 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 21:57:58,734 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:57:58,734 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 21:57:58,735 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-01-09 21:57:58,735 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:57:58,736 INFO L85 PathProgramCache]: Analyzing trace with hash -1525723164, now seen corresponding path program 1 times [2025-01-09 21:57:58,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:57:58,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [430695893] [2025-01-09 21:57:58,736 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:57:58,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:57:58,786 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-01-09 21:57:58,805 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-01-09 21:57:58,805 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:57:58,805 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:57:58,961 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:57:58,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:57:58,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [430695893] [2025-01-09 21:57:58,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [430695893] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:57:58,962 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:57:58,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 21:57:58,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [428712998] [2025-01-09 21:57:58,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:57:58,962 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:57:58,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:57:58,963 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:57:58,963 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:57:58,963 INFO L87 Difference]: Start difference. First operand 2552 states and 4779 transitions. Second operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 21:57:59,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 21:57:59,057 INFO L93 Difference]: Finished difference Result 2552 states and 4773 transitions. [2025-01-09 21:57:59,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:57:59,057 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 100 [2025-01-09 21:57:59,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 21:57:59,070 INFO L225 Difference]: With dead ends: 2552 [2025-01-09 21:57:59,070 INFO L226 Difference]: Without dead ends: 2552 [2025-01-09 21:57:59,070 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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:57:59,072 INFO L435 NwaCegarLoop]: 2444 mSDtfsCounter, 1 mSDsluCounter, 2422 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 4866 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 21:57:59,072 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 4866 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 21:57:59,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2552 states. [2025-01-09 21:57:59,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2552 to 2552. [2025-01-09 21:57:59,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2552 states, 1543 states have (on average 1.7919637070641607) internal successors, (2765), 2545 states have internal predecessors, (2765), 1005 states have call successors, (1005), 3 states have call predecessors, (1005), 2 states have return successors, (1003), 5 states have call predecessors, (1003), 1003 states have call successors, (1003) [2025-01-09 21:57:59,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2552 states to 2552 states and 4773 transitions. [2025-01-09 21:57:59,285 INFO L78 Accepts]: Start accepts. Automaton has 2552 states and 4773 transitions. Word has length 100 [2025-01-09 21:57:59,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 21:57:59,285 INFO L471 AbstractCegarLoop]: Abstraction has 2552 states and 4773 transitions. [2025-01-09 21:57:59,286 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 21:57:59,286 INFO L276 IsEmpty]: Start isEmpty. Operand 2552 states and 4773 transitions. [2025-01-09 21:57:59,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-01-09 21:57:59,287 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 21:57:59,287 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:57:59,289 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 21:57:59,289 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-01-09 21:57:59,290 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:57:59,290 INFO L85 PathProgramCache]: Analyzing trace with hash -1033096990, now seen corresponding path program 1 times [2025-01-09 21:57:59,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:57:59,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1544589574] [2025-01-09 21:57:59,290 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:57:59,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:57:59,335 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-01-09 21:57:59,392 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-01-09 21:57:59,392 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:57:59,392 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:57:59,698 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:57:59,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:57:59,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1544589574] [2025-01-09 21:57:59,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1544589574] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:57:59,699 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:57:59,699 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 21:57:59,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1273621033] [2025-01-09 21:57:59,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:57:59,700 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 21:57:59,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:57:59,701 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 21:57:59,701 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 21:57:59,701 INFO L87 Difference]: Start difference. First operand 2552 states and 4773 transitions. Second operand has 4 states, 4 states have (on average 23.0) internal successors, (92), 4 states have internal predecessors, (92), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 21:58:00,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 21:58:00,407 INFO L93 Difference]: Finished difference Result 4778 states and 9096 transitions. [2025-01-09 21:58:00,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 21:58:00,407 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.0) internal successors, (92), 4 states have internal predecessors, (92), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 100 [2025-01-09 21:58:00,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 21:58:00,435 INFO L225 Difference]: With dead ends: 4778 [2025-01-09 21:58:00,436 INFO L226 Difference]: Without dead ends: 4778 [2025-01-09 21:58:00,436 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:00,437 INFO L435 NwaCegarLoop]: 2973 mSDtfsCounter, 1420 mSDsluCounter, 4896 mSDsCounter, 0 mSdLazyCounter, 563 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1923 SdHoareTripleChecker+Valid, 7869 SdHoareTripleChecker+Invalid, 564 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 563 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 21:58:00,437 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1923 Valid, 7869 Invalid, 564 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 563 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 21:58:00,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4778 states. [2025-01-09 21:58:00,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4778 to 2554. [2025-01-09 21:58:00,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2554 states, 1545 states have (on average 1.7909385113268608) internal successors, (2767), 2547 states have internal predecessors, (2767), 1005 states have call successors, (1005), 3 states have call predecessors, (1005), 2 states have return successors, (1003), 5 states have call predecessors, (1003), 1003 states have call successors, (1003) [2025-01-09 21:58:00,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2554 states to 2554 states and 4775 transitions. [2025-01-09 21:58:00,882 INFO L78 Accepts]: Start accepts. Automaton has 2554 states and 4775 transitions. Word has length 100 [2025-01-09 21:58:00,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 21:58:00,882 INFO L471 AbstractCegarLoop]: Abstraction has 2554 states and 4775 transitions. [2025-01-09 21:58:00,883 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.0) internal successors, (92), 4 states have internal predecessors, (92), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 21:58:00,883 INFO L276 IsEmpty]: Start isEmpty. Operand 2554 states and 4775 transitions. [2025-01-09 21:58:00,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-01-09 21:58:00,884 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 21:58:00,884 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:58:00,885 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 21:58:00,885 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-01-09 21:58:00,885 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:58:00,887 INFO L85 PathProgramCache]: Analyzing trace with hash 1407149883, now seen corresponding path program 1 times [2025-01-09 21:58:00,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:58:00,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464966942] [2025-01-09 21:58:00,888 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:58:00,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:58:00,945 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-01-09 21:58:00,985 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-01-09 21:58:00,986 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:58:00,986 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:58:01,307 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:58:01,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:58:01,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1464966942] [2025-01-09 21:58:01,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1464966942] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:58:01,307 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:58:01,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:58:01,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2073924069] [2025-01-09 21:58:01,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:58:01,308 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 21:58:01,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:58:01,309 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 21:58:01,309 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 21:58:01,309 INFO L87 Difference]: Start difference. First operand 2554 states and 4775 transitions. Second operand has 5 states, 5 states have (on average 29.4) internal successors, (147), 5 states have internal predecessors, (147), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 21:58:01,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 21:58:01,407 INFO L93 Difference]: Finished difference Result 2470 states and 4621 transitions. [2025-01-09 21:58:01,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 21:58:01,408 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 29.4) internal successors, (147), 5 states have internal predecessors, (147), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 156 [2025-01-09 21:58:01,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 21:58:01,419 INFO L225 Difference]: With dead ends: 2470 [2025-01-09 21:58:01,419 INFO L226 Difference]: Without dead ends: 2470 [2025-01-09 21:58:01,420 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 21:58:01,420 INFO L435 NwaCegarLoop]: 2346 mSDtfsCounter, 41 mSDsluCounter, 4678 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 7024 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 21:58:01,421 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 7024 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 21:58:01,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2470 states. [2025-01-09 21:58:01,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2470 to 2470. [2025-01-09 21:58:01,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2470 states, 1461 states have (on average 1.788501026694045) internal successors, (2613), 2463 states have internal predecessors, (2613), 1005 states have call successors, (1005), 3 states have call predecessors, (1005), 2 states have return successors, (1003), 5 states have call predecessors, (1003), 1003 states have call successors, (1003) [2025-01-09 21:58:01,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2470 states to 2470 states and 4621 transitions. [2025-01-09 21:58:01,674 INFO L78 Accepts]: Start accepts. Automaton has 2470 states and 4621 transitions. Word has length 156 [2025-01-09 21:58:01,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 21:58:01,674 INFO L471 AbstractCegarLoop]: Abstraction has 2470 states and 4621 transitions. [2025-01-09 21:58:01,675 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 29.4) internal successors, (147), 5 states have internal predecessors, (147), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 21:58:01,675 INFO L276 IsEmpty]: Start isEmpty. Operand 2470 states and 4621 transitions. [2025-01-09 21:58:01,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-01-09 21:58:01,676 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 21:58:01,676 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:58:01,676 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 21:58:01,677 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-01-09 21:58:01,677 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:58:01,677 INFO L85 PathProgramCache]: Analyzing trace with hash 862893673, now seen corresponding path program 1 times [2025-01-09 21:58:01,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:58:01,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1954046069] [2025-01-09 21:58:01,678 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:58:01,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:58:01,722 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-01-09 21:58:01,744 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-01-09 21:58:01,744 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:58:01,745 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:58:01,895 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:58:01,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:58:01,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1954046069] [2025-01-09 21:58:01,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1954046069] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:58:01,896 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:58:01,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 21:58:01,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [93077082] [2025-01-09 21:58:01,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:58:01,897 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 21:58:01,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:58:01,897 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 21:58:01,898 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 21:58:01,899 INFO L87 Difference]: Start difference. First operand 2470 states and 4621 transitions. Second operand has 4 states, 4 states have (on average 36.75) internal successors, (147), 4 states have internal predecessors, (147), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 21:58:01,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 21:58:01,978 INFO L93 Difference]: Finished difference Result 2458 states and 4601 transitions. [2025-01-09 21:58:01,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 21:58:01,979 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 36.75) internal successors, (147), 4 states have internal predecessors, (147), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 156 [2025-01-09 21:58:01,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 21:58:01,999 INFO L225 Difference]: With dead ends: 2458 [2025-01-09 21:58:02,000 INFO L226 Difference]: Without dead ends: 2458 [2025-01-09 21:58:02,000 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:02,001 INFO L435 NwaCegarLoop]: 2348 mSDtfsCounter, 9 mSDsluCounter, 4677 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 7025 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 21:58:02,001 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 7025 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 21:58:02,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2458 states. [2025-01-09 21:58:02,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2458 to 2458. [2025-01-09 21:58:02,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2458 states, 1449 states have (on average 1.7895100069013112) internal successors, (2593), 2451 states have internal predecessors, (2593), 1005 states have call successors, (1005), 3 states have call predecessors, (1005), 2 states have return successors, (1003), 5 states have call predecessors, (1003), 1003 states have call successors, (1003) [2025-01-09 21:58:02,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2458 states to 2458 states and 4601 transitions. [2025-01-09 21:58:02,251 INFO L78 Accepts]: Start accepts. Automaton has 2458 states and 4601 transitions. Word has length 156 [2025-01-09 21:58:02,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 21:58:02,251 INFO L471 AbstractCegarLoop]: Abstraction has 2458 states and 4601 transitions. [2025-01-09 21:58:02,252 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 36.75) internal successors, (147), 4 states have internal predecessors, (147), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 21:58:02,252 INFO L276 IsEmpty]: Start isEmpty. Operand 2458 states and 4601 transitions. [2025-01-09 21:58:02,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-01-09 21:58:02,254 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 21:58:02,254 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:58:02,254 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 21:58:02,254 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-01-09 21:58:02,255 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:58:02,256 INFO L85 PathProgramCache]: Analyzing trace with hash 1607443057, now seen corresponding path program 1 times [2025-01-09 21:58:02,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:58:02,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [66709135] [2025-01-09 21:58:02,256 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:58:02,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:58:02,311 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-01-09 21:58:02,337 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-01-09 21:58:02,338 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:58:02,338 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:58:02,523 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:02,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:58:02,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [66709135] [2025-01-09 21:58:02,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [66709135] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:58:02,524 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:58:02,524 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:58:02,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1001399034] [2025-01-09 21:58:02,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:58:02,525 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 21:58:02,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:58:02,525 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 21:58:02,525 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 21:58:02,525 INFO L87 Difference]: Start difference. First operand 2458 states and 4601 transitions. Second operand has 5 states, 5 states have (on average 29.6) internal successors, (148), 5 states have internal predecessors, (148), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 21:58:05,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 21:58:05,048 INFO L93 Difference]: Finished difference Result 2542 states and 4709 transitions. [2025-01-09 21:58:05,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 21:58:05,049 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 29.6) internal successors, (148), 5 states have internal predecessors, (148), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 156 [2025-01-09 21:58:05,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 21:58:05,059 INFO L225 Difference]: With dead ends: 2542 [2025-01-09 21:58:05,059 INFO L226 Difference]: Without dead ends: 2542 [2025-01-09 21:58:05,059 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:58:05,060 INFO L435 NwaCegarLoop]: 2532 mSDtfsCounter, 4934 mSDsluCounter, 2557 mSDsCounter, 0 mSdLazyCounter, 609 mSolverCounterSat, 1436 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5435 SdHoareTripleChecker+Valid, 5089 SdHoareTripleChecker+Invalid, 2045 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1436 IncrementalHoareTripleChecker+Valid, 609 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2025-01-09 21:58:05,060 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5435 Valid, 5089 Invalid, 2045 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1436 Valid, 609 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2025-01-09 21:58:05,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2542 states. [2025-01-09 21:58:05,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2542 to 1371. [2025-01-09 21:58:05,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1371 states, 862 states have (on average 1.711136890951276) internal successors, (1475), 1364 states have internal predecessors, (1475), 505 states have call successors, (505), 3 states have call predecessors, (505), 2 states have return successors, (503), 4 states have call predecessors, (503), 503 states have call successors, (503) [2025-01-09 21:58:05,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1371 states to 1371 states and 2483 transitions. [2025-01-09 21:58:05,279 INFO L78 Accepts]: Start accepts. Automaton has 1371 states and 2483 transitions. Word has length 156 [2025-01-09 21:58:05,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 21:58:05,279 INFO L471 AbstractCegarLoop]: Abstraction has 1371 states and 2483 transitions. [2025-01-09 21:58:05,279 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 29.6) internal successors, (148), 5 states have internal predecessors, (148), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 21:58:05,279 INFO L276 IsEmpty]: Start isEmpty. Operand 1371 states and 2483 transitions. [2025-01-09 21:58:05,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2025-01-09 21:58:05,281 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 21:58:05,281 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:58:05,281 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 21:58:05,281 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-01-09 21:58:05,283 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:58:05,283 INFO L85 PathProgramCache]: Analyzing trace with hash 435590944, now seen corresponding path program 1 times [2025-01-09 21:58:05,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:58:05,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [99562481] [2025-01-09 21:58:05,283 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:58:05,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:58:05,327 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-01-09 21:58:05,375 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-01-09 21:58:05,376 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:58:05,376 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:58:06,028 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:06,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:58:06,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [99562481] [2025-01-09 21:58:06,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [99562481] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 21:58:06,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1331761280] [2025-01-09 21:58:06,029 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:58:06,029 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 21:58:06,029 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 21:58:06,032 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:06,034 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:06,264 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-01-09 21:58:06,372 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-01-09 21:58:06,372 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:58:06,372 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:58:06,377 INFO L256 TraceCheckSpWp]: Trace formula consists of 772 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-09 21:58:06,388 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 21:58:06,416 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-01-09 21:58:06,657 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-01-09 21:58:06,666 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 15 treesize of output 7 [2025-01-09 21:58:06,671 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:06,671 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 21:58:06,863 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:06,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1331761280] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 21:58:06,863 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 21:58:06,863 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 5] total 11 [2025-01-09 21:58:06,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1780704624] [2025-01-09 21:58:06,863 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 21:58:06,864 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 21:58:06,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:58:06,864 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 21:58:06,864 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-01-09 21:58:06,864 INFO L87 Difference]: Start difference. First operand 1371 states and 2483 transitions. Second operand has 11 states, 11 states have (on average 22.545454545454547) internal successors, (248), 11 states have internal predecessors, (248), 3 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-01-09 21:58:11,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 21:58:11,906 INFO L93 Difference]: Finished difference Result 4085 states and 7425 transitions. [2025-01-09 21:58:11,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 21:58:11,906 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 22.545454545454547) internal successors, (248), 11 states have internal predecessors, (248), 3 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 166 [2025-01-09 21:58:11,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 21:58:11,918 INFO L225 Difference]: With dead ends: 4085 [2025-01-09 21:58:11,918 INFO L226 Difference]: Without dead ends: 4085 [2025-01-09 21:58:11,918 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 340 GetRequests, 325 SyntacticMatches, 3 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=120, Unknown=0, NotChecked=0, Total=182 [2025-01-09 21:58:11,919 INFO L435 NwaCegarLoop]: 1890 mSDtfsCounter, 4716 mSDsluCounter, 11801 mSDsCounter, 0 mSdLazyCounter, 6650 mSolverCounterSat, 506 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5722 SdHoareTripleChecker+Valid, 13691 SdHoareTripleChecker+Invalid, 7156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 506 IncrementalHoareTripleChecker+Valid, 6650 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.8s IncrementalHoareTripleChecker+Time [2025-01-09 21:58:11,919 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5722 Valid, 13691 Invalid, 7156 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [506 Valid, 6650 Invalid, 0 Unknown, 0 Unchecked, 4.8s Time] [2025-01-09 21:58:11,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4085 states. [2025-01-09 21:58:12,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4085 to 1718. [2025-01-09 21:58:12,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1718 states, 1205 states have (on average 1.5983402489626557) internal successors, (1926), 1707 states have internal predecessors, (1926), 508 states have call successors, (508), 4 states have call predecessors, (508), 3 states have return successors, (506), 7 states have call predecessors, (506), 506 states have call successors, (506) [2025-01-09 21:58:12,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1718 states to 1718 states and 2940 transitions. [2025-01-09 21:58:12,177 INFO L78 Accepts]: Start accepts. Automaton has 1718 states and 2940 transitions. Word has length 166 [2025-01-09 21:58:12,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 21:58:12,178 INFO L471 AbstractCegarLoop]: Abstraction has 1718 states and 2940 transitions. [2025-01-09 21:58:12,178 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 22.545454545454547) internal successors, (248), 11 states have internal predecessors, (248), 3 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-01-09 21:58:12,178 INFO L276 IsEmpty]: Start isEmpty. Operand 1718 states and 2940 transitions. [2025-01-09 21:58:12,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 395 [2025-01-09 21:58:12,183 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 21:58:12,183 INFO L218 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 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] [2025-01-09 21:58:12,194 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:12,384 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-01-09 21:58:12,384 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-01-09 21:58:12,386 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:58:12,386 INFO L85 PathProgramCache]: Analyzing trace with hash 2133482358, now seen corresponding path program 1 times [2025-01-09 21:58:12,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:58:12,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1832137457] [2025-01-09 21:58:12,387 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:58:12,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:58:12,515 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 394 statements into 1 equivalence classes. [2025-01-09 21:58:12,663 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 394 of 394 statements. [2025-01-09 21:58:12,663 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:58:12,663 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:58:15,687 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 0 proven. 458 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-09 21:58:15,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:58:15,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1832137457] [2025-01-09 21:58:15,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1832137457] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 21:58:15,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [976887053] [2025-01-09 21:58:15,689 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:58:15,689 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 21:58:15,690 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 21:58:15,692 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:15,694 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:16,120 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 394 statements into 1 equivalence classes. [2025-01-09 21:58:16,360 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 394 of 394 statements. [2025-01-09 21:58:16,360 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:58:16,361 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:58:16,368 INFO L256 TraceCheckSpWp]: Trace formula consists of 1903 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-01-09 21:58:16,381 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 21:58:16,396 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-01-09 21:58:16,656 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-01-09 21:58:16,779 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-01-09 21:58:16,899 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-01-09 21:58:17,024 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-01-09 21:58:17,031 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 15 treesize of output 7 [2025-01-09 21:58:17,039 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 0 proven. 458 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-09 21:58:17,039 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 21:58:17,607 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 0 proven. 458 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-09 21:58:17,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [976887053] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 21:58:17,607 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 21:58:17,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9, 8] total 20 [2025-01-09 21:58:17,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [16080613] [2025-01-09 21:58:17,608 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 21:58:17,609 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-01-09 21:58:17,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:58:17,610 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-01-09 21:58:17,610 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=235, Unknown=0, NotChecked=0, Total=380 [2025-01-09 21:58:17,610 INFO L87 Difference]: Start difference. First operand 1718 states and 2940 transitions. Second operand has 20 states, 20 states have (on average 35.5) internal successors, (710), 20 states have internal predecessors, (710), 3 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-01-09 21:58:28,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 21:58:28,693 INFO L93 Difference]: Finished difference Result 9389 states and 17153 transitions. [2025-01-09 21:58:28,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-01-09 21:58:28,694 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 35.5) internal successors, (710), 20 states have internal predecessors, (710), 3 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 394 [2025-01-09 21:58:28,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 21:58:28,718 INFO L225 Difference]: With dead ends: 9389 [2025-01-09 21:58:28,718 INFO L226 Difference]: Without dead ends: 9389 [2025-01-09 21:58:28,718 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 807 GetRequests, 780 SyntacticMatches, 3 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 182 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=224, Invalid=426, Unknown=0, NotChecked=0, Total=650 [2025-01-09 21:58:28,719 INFO L435 NwaCegarLoop]: 1890 mSDtfsCounter, 19990 mSDsluCounter, 19142 mSDsCounter, 0 mSdLazyCounter, 9184 mSolverCounterSat, 3071 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23002 SdHoareTripleChecker+Valid, 21032 SdHoareTripleChecker+Invalid, 12255 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 3071 IncrementalHoareTripleChecker+Valid, 9184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.3s IncrementalHoareTripleChecker+Time [2025-01-09 21:58:28,719 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23002 Valid, 21032 Invalid, 12255 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [3071 Valid, 9184 Invalid, 0 Unknown, 0 Unchecked, 10.3s Time] [2025-01-09 21:58:28,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9389 states. [2025-01-09 21:58:29,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9389 to 2582. [2025-01-09 21:58:29,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2582 states, 2063 states have (on average 1.480368395540475) internal successors, (3054), 2565 states have internal predecessors, (3054), 514 states have call successors, (514), 4 states have call predecessors, (514), 3 states have return successors, (512), 13 states have call predecessors, (512), 512 states have call successors, (512) [2025-01-09 21:58:29,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2582 states to 2582 states and 4080 transitions. [2025-01-09 21:58:29,375 INFO L78 Accepts]: Start accepts. Automaton has 2582 states and 4080 transitions. Word has length 394 [2025-01-09 21:58:29,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 21:58:29,376 INFO L471 AbstractCegarLoop]: Abstraction has 2582 states and 4080 transitions. [2025-01-09 21:58:29,376 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 35.5) internal successors, (710), 20 states have internal predecessors, (710), 3 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-01-09 21:58:29,376 INFO L276 IsEmpty]: Start isEmpty. Operand 2582 states and 4080 transitions. [2025-01-09 21:58:29,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 851 [2025-01-09 21:58:29,393 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 21:58:29,393 INFO L218 NwaCegarLoop]: trace histogram [11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 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] [2025-01-09 21:58:29,407 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-01-09 21:58:29,594 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 21:58:29,595 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-01-09 21:58:29,596 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:58:29,597 INFO L85 PathProgramCache]: Analyzing trace with hash -9872606, now seen corresponding path program 2 times [2025-01-09 21:58:29,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:58:29,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [798084634] [2025-01-09 21:58:29,597 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 21:58:29,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:58:29,949 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 850 statements into 2 equivalence classes. [2025-01-09 21:58:29,973 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 75 of 850 statements. [2025-01-09 21:58:29,973 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-09 21:58:29,973 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:58:30,249 INFO L134 CoverageAnalysis]: Checked inductivity of 3426 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3426 trivial. 0 not checked. [2025-01-09 21:58:30,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:58:30,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [798084634] [2025-01-09 21:58:30,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [798084634] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:58:30,249 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:58:30,249 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 21:58:30,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1475679360] [2025-01-09 21:58:30,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:58:30,251 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 21:58:30,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:58:30,251 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 21:58:30,252 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-01-09 21:58:30,252 INFO L87 Difference]: Start difference. First operand 2582 states and 4080 transitions. Second operand has 8 states, 8 states have (on average 20.0) internal successors, (160), 8 states have internal predecessors, (160), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 21:58:30,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 21:58:30,640 INFO L93 Difference]: Finished difference Result 2587 states and 4085 transitions. [2025-01-09 21:58:30,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 21:58:30,641 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 20.0) internal successors, (160), 8 states have internal predecessors, (160), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 850 [2025-01-09 21:58:30,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 21:58:30,650 INFO L225 Difference]: With dead ends: 2587 [2025-01-09 21:58:30,650 INFO L226 Difference]: Without dead ends: 2587 [2025-01-09 21:58:30,650 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2025-01-09 21:58:30,651 INFO L435 NwaCegarLoop]: 2340 mSDtfsCounter, 34 mSDsluCounter, 9107 mSDsCounter, 0 mSdLazyCounter, 354 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 11447 SdHoareTripleChecker+Invalid, 356 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 354 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 21:58:30,652 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 11447 Invalid, 356 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 354 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 21:58:30,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2587 states. [2025-01-09 21:58:30,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2587 to 2586. [2025-01-09 21:58:30,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2586 states, 2067 states have (on average 1.4794388001935173) internal successors, (3058), 2569 states have internal predecessors, (3058), 514 states have call successors, (514), 4 states have call predecessors, (514), 3 states have return successors, (512), 13 states have call predecessors, (512), 512 states have call successors, (512) [2025-01-09 21:58:30,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2586 states to 2586 states and 4084 transitions. [2025-01-09 21:58:30,779 INFO L78 Accepts]: Start accepts. Automaton has 2586 states and 4084 transitions. Word has length 850 [2025-01-09 21:58:30,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 21:58:30,780 INFO L471 AbstractCegarLoop]: Abstraction has 2586 states and 4084 transitions. [2025-01-09 21:58:30,781 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 20.0) internal successors, (160), 8 states have internal predecessors, (160), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 21:58:30,781 INFO L276 IsEmpty]: Start isEmpty. Operand 2586 states and 4084 transitions. [2025-01-09 21:58:30,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 852 [2025-01-09 21:58:30,800 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 21:58:30,800 INFO L218 NwaCegarLoop]: trace histogram [11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 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] [2025-01-09 21:58:30,800 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 21:58:30,801 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-01-09 21:58:30,801 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:58:30,802 INFO L85 PathProgramCache]: Analyzing trace with hash -1586343018, now seen corresponding path program 1 times [2025-01-09 21:58:30,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:58:30,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [777713404] [2025-01-09 21:58:30,802 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:58:30,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:58:31,097 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 851 statements into 1 equivalence classes. [2025-01-09 21:58:31,560 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 851 of 851 statements. [2025-01-09 21:58:31,561 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:58:31,561 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:58:34,221 INFO L134 CoverageAnalysis]: Checked inductivity of 3426 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3426 trivial. 0 not checked. [2025-01-09 21:58:34,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:58:34,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [777713404] [2025-01-09 21:58:34,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [777713404] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:58:34,223 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:58:34,223 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 21:58:34,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1162889047] [2025-01-09 21:58:34,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:58:34,224 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 21:58:34,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:58:34,224 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 21:58:34,224 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-01-09 21:58:34,225 INFO L87 Difference]: Start difference. First operand 2586 states and 4084 transitions. Second operand has 7 states, 7 states have (on average 23.0) internal successors, (161), 7 states have internal predecessors, (161), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 21:58:34,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 21:58:34,538 INFO L93 Difference]: Finished difference Result 2591 states and 4090 transitions. [2025-01-09 21:58:34,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 21:58:34,539 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 23.0) internal successors, (161), 7 states have internal predecessors, (161), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 851 [2025-01-09 21:58:34,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 21:58:34,547 INFO L225 Difference]: With dead ends: 2591 [2025-01-09 21:58:34,548 INFO L226 Difference]: Without dead ends: 2591 [2025-01-09 21:58:34,548 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-01-09 21:58:34,548 INFO L435 NwaCegarLoop]: 2347 mSDtfsCounter, 9 mSDsluCounter, 11345 mSDsCounter, 0 mSdLazyCounter, 427 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 13692 SdHoareTripleChecker+Invalid, 428 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 427 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 21:58:34,549 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 13692 Invalid, 428 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 427 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 21:58:34,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2591 states. [2025-01-09 21:58:34,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2591 to 2590. [2025-01-09 21:58:34,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2590 states, 2071 states have (on average 1.4789956542732978) internal successors, (3063), 2573 states have internal predecessors, (3063), 514 states have call successors, (514), 4 states have call predecessors, (514), 3 states have return successors, (512), 13 states have call predecessors, (512), 512 states have call successors, (512) [2025-01-09 21:58:34,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2590 states to 2590 states and 4089 transitions. [2025-01-09 21:58:34,771 INFO L78 Accepts]: Start accepts. Automaton has 2590 states and 4089 transitions. Word has length 851 [2025-01-09 21:58:34,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 21:58:34,772 INFO L471 AbstractCegarLoop]: Abstraction has 2590 states and 4089 transitions. [2025-01-09 21:58:34,773 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 23.0) internal successors, (161), 7 states have internal predecessors, (161), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 21:58:34,773 INFO L276 IsEmpty]: Start isEmpty. Operand 2590 states and 4089 transitions. [2025-01-09 21:58:34,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 852 [2025-01-09 21:58:34,806 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 21:58:34,806 INFO L218 NwaCegarLoop]: trace histogram [11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 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] [2025-01-09 21:58:34,806 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 21:58:34,806 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-01-09 21:58:34,813 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:58:34,813 INFO L85 PathProgramCache]: Analyzing trace with hash 750804010, now seen corresponding path program 1 times [2025-01-09 21:58:34,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:58:34,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [94704334] [2025-01-09 21:58:34,814 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:58:34,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:58:35,114 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 851 statements into 1 equivalence classes. [2025-01-09 21:58:35,414 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 851 of 851 statements. [2025-01-09 21:58:35,414 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:58:35,414 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:58:37,257 INFO L134 CoverageAnalysis]: Checked inductivity of 3426 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3426 trivial. 0 not checked. [2025-01-09 21:58:37,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:58:37,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [94704334] [2025-01-09 21:58:37,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [94704334] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:58:37,258 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:58:37,258 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 21:58:37,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1012938907] [2025-01-09 21:58:37,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:58:37,260 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 21:58:37,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:58:37,261 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 21:58:37,261 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-01-09 21:58:37,261 INFO L87 Difference]: Start difference. First operand 2590 states and 4089 transitions. Second operand has 8 states, 8 states have (on average 20.125) internal successors, (161), 8 states have internal predecessors, (161), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 21:58:37,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 21:58:37,574 INFO L93 Difference]: Finished difference Result 2595 states and 4095 transitions. [2025-01-09 21:58:37,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 21:58:37,574 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 20.125) internal successors, (161), 8 states have internal predecessors, (161), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 851 [2025-01-09 21:58:37,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 21:58:37,583 INFO L225 Difference]: With dead ends: 2595 [2025-01-09 21:58:37,583 INFO L226 Difference]: Without dead ends: 2595 [2025-01-09 21:58:37,583 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-01-09 21:58:37,584 INFO L435 NwaCegarLoop]: 2340 mSDtfsCounter, 10 mSDsluCounter, 11384 mSDsCounter, 0 mSdLazyCounter, 421 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 13724 SdHoareTripleChecker+Invalid, 422 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 421 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 21:58:37,584 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 13724 Invalid, 422 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 421 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 21:58:37,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2595 states. [2025-01-09 21:58:37,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2595 to 2590. [2025-01-09 21:58:37,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2590 states, 2071 states have (on average 1.4789956542732978) internal successors, (3063), 2573 states have internal predecessors, (3063), 514 states have call successors, (514), 4 states have call predecessors, (514), 3 states have return successors, (512), 13 states have call predecessors, (512), 512 states have call successors, (512) [2025-01-09 21:58:37,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2590 states to 2590 states and 4089 transitions. [2025-01-09 21:58:37,708 INFO L78 Accepts]: Start accepts. Automaton has 2590 states and 4089 transitions. Word has length 851 [2025-01-09 21:58:37,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 21:58:37,709 INFO L471 AbstractCegarLoop]: Abstraction has 2590 states and 4089 transitions. [2025-01-09 21:58:37,710 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 20.125) internal successors, (161), 8 states have internal predecessors, (161), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 21:58:37,710 INFO L276 IsEmpty]: Start isEmpty. Operand 2590 states and 4089 transitions. [2025-01-09 21:58:37,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 853 [2025-01-09 21:58:37,717 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 21:58:37,718 INFO L218 NwaCegarLoop]: trace histogram [11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 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] [2025-01-09 21:58:37,718 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 21:58:37,719 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-01-09 21:58:37,719 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:58:37,720 INFO L85 PathProgramCache]: Analyzing trace with hash 519795598, now seen corresponding path program 1 times [2025-01-09 21:58:37,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:58:37,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1322879234] [2025-01-09 21:58:37,720 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:58:37,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:58:37,994 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 852 statements into 1 equivalence classes. [2025-01-09 21:58:38,251 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 852 of 852 statements. [2025-01-09 21:58:38,252 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:58:38,252 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:58:39,919 INFO L134 CoverageAnalysis]: Checked inductivity of 3426 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3426 trivial. 0 not checked. [2025-01-09 21:58:39,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:58:39,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1322879234] [2025-01-09 21:58:39,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1322879234] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:58:39,920 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:58:39,920 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 21:58:39,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1317386715] [2025-01-09 21:58:39,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:58:39,921 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 21:58:39,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:58:39,922 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 21:58:39,922 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-01-09 21:58:39,922 INFO L87 Difference]: Start difference. First operand 2590 states and 4089 transitions. Second operand has 9 states, 9 states have (on average 18.0) internal successors, (162), 9 states have internal predecessors, (162), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 21:58:40,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 21:58:40,446 INFO L93 Difference]: Finished difference Result 2601 states and 4103 transitions. [2025-01-09 21:58:40,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 21:58:40,447 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 18.0) internal successors, (162), 9 states have internal predecessors, (162), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 852 [2025-01-09 21:58:40,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 21:58:40,455 INFO L225 Difference]: With dead ends: 2601 [2025-01-09 21:58:40,456 INFO L226 Difference]: Without dead ends: 2601 [2025-01-09 21:58:40,457 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2025-01-09 21:58:40,458 INFO L435 NwaCegarLoop]: 2348 mSDtfsCounter, 27 mSDsluCounter, 16025 mSDsCounter, 0 mSdLazyCounter, 561 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 18373 SdHoareTripleChecker+Invalid, 564 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 561 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 21:58:40,459 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 18373 Invalid, 564 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 561 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 21:58:40,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2601 states. [2025-01-09 21:58:40,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2601 to 2598. [2025-01-09 21:58:40,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2598 states, 2079 states have (on average 1.4781144781144782) internal successors, (3073), 2581 states have internal predecessors, (3073), 514 states have call successors, (514), 4 states have call predecessors, (514), 3 states have return successors, (512), 13 states have call predecessors, (512), 512 states have call successors, (512) [2025-01-09 21:58:40,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2598 states to 2598 states and 4099 transitions. [2025-01-09 21:58:40,632 INFO L78 Accepts]: Start accepts. Automaton has 2598 states and 4099 transitions. Word has length 852 [2025-01-09 21:58:40,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 21:58:40,633 INFO L471 AbstractCegarLoop]: Abstraction has 2598 states and 4099 transitions. [2025-01-09 21:58:40,633 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 18.0) internal successors, (162), 9 states have internal predecessors, (162), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 21:58:40,633 INFO L276 IsEmpty]: Start isEmpty. Operand 2598 states and 4099 transitions. [2025-01-09 21:58:40,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 854 [2025-01-09 21:58:40,645 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 21:58:40,645 INFO L218 NwaCegarLoop]: trace histogram [11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 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] [2025-01-09 21:58:40,646 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 21:58:40,646 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-01-09 21:58:40,650 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:58:40,650 INFO L85 PathProgramCache]: Analyzing trace with hash 848837041, now seen corresponding path program 1 times [2025-01-09 21:58:40,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:58:40,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1378154559] [2025-01-09 21:58:40,650 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:58:40,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:58:40,975 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 853 statements into 1 equivalence classes. [2025-01-09 21:58:41,301 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 853 of 853 statements. [2025-01-09 21:58:41,302 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:58:41,302 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:58:42,584 INFO L134 CoverageAnalysis]: Checked inductivity of 3426 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3426 trivial. 0 not checked. [2025-01-09 21:58:42,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:58:42,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1378154559] [2025-01-09 21:58:42,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1378154559] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:58:42,585 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:58:42,585 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 21:58:42,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1740051952] [2025-01-09 21:58:42,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:58:42,586 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 21:58:42,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:58:42,587 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 21:58:42,587 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-01-09 21:58:42,587 INFO L87 Difference]: Start difference. First operand 2598 states and 4099 transitions. Second operand has 7 states, 7 states have (on average 23.285714285714285) internal successors, (163), 7 states have internal predecessors, (163), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 21:58:42,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 21:58:42,774 INFO L93 Difference]: Finished difference Result 2601 states and 4102 transitions. [2025-01-09 21:58:42,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 21:58:42,774 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), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 853 [2025-01-09 21:58:42,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 21:58:42,781 INFO L225 Difference]: With dead ends: 2601 [2025-01-09 21:58:42,781 INFO L226 Difference]: Without dead ends: 2601 [2025-01-09 21:58:42,782 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-01-09 21:58:42,783 INFO L435 NwaCegarLoop]: 2351 mSDtfsCounter, 4 mSDsluCounter, 6846 mSDsCounter, 0 mSdLazyCounter, 266 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 9197 SdHoareTripleChecker+Invalid, 267 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 266 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 21:58:42,783 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 9197 Invalid, 267 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 266 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 21:58:42,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2601 states. [2025-01-09 21:58:42,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2601 to 2601. [2025-01-09 21:58:42,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2601 states, 2082 states have (on average 1.4774255523535063) internal successors, (3076), 2584 states have internal predecessors, (3076), 514 states have call successors, (514), 4 states have call predecessors, (514), 3 states have return successors, (512), 13 states have call predecessors, (512), 512 states have call successors, (512) [2025-01-09 21:58:42,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2601 states to 2601 states and 4102 transitions. [2025-01-09 21:58:42,926 INFO L78 Accepts]: Start accepts. Automaton has 2601 states and 4102 transitions. Word has length 853 [2025-01-09 21:58:42,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 21:58:42,927 INFO L471 AbstractCegarLoop]: Abstraction has 2601 states and 4102 transitions. [2025-01-09 21:58:42,927 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), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 21:58:42,928 INFO L276 IsEmpty]: Start isEmpty. Operand 2601 states and 4102 transitions. [2025-01-09 21:58:42,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 854 [2025-01-09 21:58:42,934 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 21:58:42,935 INFO L218 NwaCegarLoop]: trace histogram [11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 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] [2025-01-09 21:58:42,935 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 21:58:42,935 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-01-09 21:58:42,936 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:58:42,936 INFO L85 PathProgramCache]: Analyzing trace with hash -645805683, now seen corresponding path program 1 times [2025-01-09 21:58:42,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:58:42,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [537420739] [2025-01-09 21:58:42,937 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:58:42,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:58:43,164 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 853 statements into 1 equivalence classes. [2025-01-09 21:58:43,383 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 853 of 853 statements. [2025-01-09 21:58:43,384 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:58:43,384 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:58:51,975 INFO L134 CoverageAnalysis]: Checked inductivity of 3426 backedges. 0 proven. 3422 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-09 21:58:51,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:58:51,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [537420739] [2025-01-09 21:58:51,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [537420739] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 21:58:51,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1340926351] [2025-01-09 21:58:51,976 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:58:51,977 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 21:58:51,977 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 21:58:51,979 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:58:51,982 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:58:52,846 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 853 statements into 1 equivalence classes. [2025-01-09 21:58:53,407 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 853 of 853 statements. [2025-01-09 21:58:53,407 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:58:53,407 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:58:53,426 INFO L256 TraceCheckSpWp]: Trace formula consists of 4165 conjuncts, 35 conjuncts are in the unsatisfiable core [2025-01-09 21:58:53,442 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 21:58:53,453 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-01-09 21:58:53,614 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-01-09 21:58:53,700 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-01-09 21:58:53,794 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-01-09 21:58:53,904 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-01-09 21:58:53,985 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-01-09 21:58:54,061 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-01-09 21:58:54,163 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-01-09 21:58:54,255 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-01-09 21:58:54,332 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-01-09 21:58:54,412 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-01-09 21:58:54,416 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 15 treesize of output 7 [2025-01-09 21:58:54,422 INFO L134 CoverageAnalysis]: Checked inductivity of 3426 backedges. 0 proven. 3422 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-09 21:58:54,422 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 21:58:55,509 INFO L134 CoverageAnalysis]: Checked inductivity of 3426 backedges. 0 proven. 3422 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-09 21:58:55,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1340926351] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 21:58:55,509 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 21:58:55,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 15, 14] total 38 [2025-01-09 21:58:55,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1363944197] [2025-01-09 21:58:55,510 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 21:58:55,512 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2025-01-09 21:58:55,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:58:55,513 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2025-01-09 21:58:55,514 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=571, Invalid=835, Unknown=0, NotChecked=0, Total=1406 [2025-01-09 21:58:55,514 INFO L87 Difference]: Start difference. First operand 2601 states and 4102 transitions. Second operand has 38 states, 38 states have (on average 43.078947368421055) internal successors, (1637), 38 states have internal predecessors, (1637), 3 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6)