./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memcleanup.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test9-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (memcleanup) Using default analysis Version c00e63dc 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_SFH_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 f4a8b24485e53fece96b44fdc12e6f161e1bbffda2cd597a930f4925e148dc01 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 10:02:58,109 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 10:02:58,168 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Default.epf [2025-02-06 10:02:58,172 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 10:02:58,174 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 10:02:58,199 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 10:02:58,199 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 10:02:58,199 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 10:02:58,199 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 10:02:58,200 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 10:02:58,200 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 10:02:58,200 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 10:02:58,200 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 10:02:58,200 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 10:02:58,200 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 10:02:58,200 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 10:02:58,200 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 10:02:58,200 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 10:02:58,200 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 10:02:58,200 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 10:02:58,200 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 10:02:58,200 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 10:02:58,202 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-02-06 10:02:58,202 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-02-06 10:02:58,202 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 10:02:58,203 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 10:02:58,203 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-06 10:02:58,203 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-06 10:02:58,203 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 10:02:58,203 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 10:02:58,203 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 10:02:58,203 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 10:02:58,203 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 10:02:58,203 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 10:02:58,203 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 10:02:58,203 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 10:02:58,203 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 10:02:58,203 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 10:02:58,203 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 10:02:58,203 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 10:02:58,203 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 10:02:58,203 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 10:02:58,203 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 10:02:58,203 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 10:02:58,204 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 10:02:58,204 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 -> f4a8b24485e53fece96b44fdc12e6f161e1bbffda2cd597a930f4925e148dc01 [2025-02-06 10:02:58,426 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 10:02:58,436 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 10:02:58,438 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 10:02:58,439 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 10:02:58,439 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 10:02:58,440 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_SFH_test9-1.i [2025-02-06 10:02:59,641 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/084659a9c/ca8d62fd9d534bdabf670c7bd7945f12/FLAGcc2ba6b18 [2025-02-06 10:03:00,043 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 10:03:00,044 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test9-1.i [2025-02-06 10:03:00,069 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/084659a9c/ca8d62fd9d534bdabf670c7bd7945f12/FLAGcc2ba6b18 [2025-02-06 10:03:00,084 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/084659a9c/ca8d62fd9d534bdabf670c7bd7945f12 [2025-02-06 10:03:00,086 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 10:03:00,088 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 10:03:00,089 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 10:03:00,092 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 10:03:00,096 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 10:03:00,096 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 10:03:00" (1/1) ... [2025-02-06 10:03:00,097 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5a1256aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:03:00, skipping insertion in model container [2025-02-06 10:03:00,097 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 10:03:00" (1/1) ... [2025-02-06 10:03:00,141 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 10:03:00,577 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 10:03:00,595 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 10:03:00,603 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 10:03:00,606 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 10:03:00,610 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 10:03:00,626 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 10:03:00,626 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 10:03:00,628 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 10:03:00,628 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 10:03:00,634 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 10:03:00,645 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 10:03:00,758 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 10:03:00,783 INFO L204 MainTranslator]: Completed translation [2025-02-06 10:03:00,784 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:03:00 WrapperNode [2025-02-06 10:03:00,785 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 10:03:00,786 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 10:03:00,786 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 10:03:00,786 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 10:03:00,790 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:03:00" (1/1) ... [2025-02-06 10:03:00,819 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:03:00" (1/1) ... [2025-02-06 10:03:00,908 INFO L138 Inliner]: procedures = 177, calls = 724, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 3244 [2025-02-06 10:03:00,908 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 10:03:00,908 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 10:03:00,908 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 10:03:00,908 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 10:03:00,915 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:03:00" (1/1) ... [2025-02-06 10:03:00,916 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:03:00" (1/1) ... [2025-02-06 10:03:00,931 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:03:00" (1/1) ... [2025-02-06 10:03:00,974 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-02-06 10:03:00,974 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:03:00" (1/1) ... [2025-02-06 10:03:00,975 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:03:00" (1/1) ... [2025-02-06 10:03:01,019 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:03:00" (1/1) ... [2025-02-06 10:03:01,023 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:03:00" (1/1) ... [2025-02-06 10:03:01,029 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:03:00" (1/1) ... [2025-02-06 10:03:01,034 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:03:00" (1/1) ... [2025-02-06 10:03:01,048 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 10:03:01,050 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 10:03:01,050 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 10:03:01,050 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 10:03:01,051 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:03:00" (1/1) ... [2025-02-06 10:03:01,055 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 10:03:01,064 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:03:01,089 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 10:03:01,095 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 10:03:01,107 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2025-02-06 10:03:01,107 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2025-02-06 10:03:01,108 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-06 10:03:01,108 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-06 10:03:01,108 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-06 10:03:01,108 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-02-06 10:03:01,109 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-02-06 10:03:01,109 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-06 10:03:01,109 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-06 10:03:01,109 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-06 10:03:01,109 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2025-02-06 10:03:01,109 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2025-02-06 10:03:01,109 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2025-02-06 10:03:01,109 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2025-02-06 10:03:01,109 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2025-02-06 10:03:01,109 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2025-02-06 10:03:01,109 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-06 10:03:01,109 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 10:03:01,110 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-02-06 10:03:01,110 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-02-06 10:03:01,110 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-02-06 10:03:01,110 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-06 10:03:01,110 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-02-06 10:03:01,110 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-02-06 10:03:01,111 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-02-06 10:03:01,111 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-06 10:03:01,111 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 10:03:01,111 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-06 10:03:01,111 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-06 10:03:01,111 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 10:03:01,111 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 10:03:01,275 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 10:03:01,276 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 10:03:03,157 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2218: call ULTIMATE.dealloc(main_~#i~0#1.base, main_~#i~0#1.offset);havoc main_~#i~0#1.base, main_~#i~0#1.offset; [2025-02-06 10:03:03,308 INFO L? ?]: Removed 799 outVars from TransFormulas that were not future-live. [2025-02-06 10:03:03,309 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 10:03:03,379 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 10:03:03,383 INFO L337 CfgBuilder]: Removed 1 assume(true) statements. [2025-02-06 10:03:03,383 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 10:03:03 BoogieIcfgContainer [2025-02-06 10:03:03,383 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 10:03:03,385 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 10:03:03,385 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 10:03:03,390 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 10:03:03,390 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 10:03:00" (1/3) ... [2025-02-06 10:03:03,391 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26938aa7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 10:03:03, skipping insertion in model container [2025-02-06 10:03:03,391 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:03:00" (2/3) ... [2025-02-06 10:03:03,391 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26938aa7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 10:03:03, skipping insertion in model container [2025-02-06 10:03:03,391 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 10:03:03" (3/3) ... [2025-02-06 10:03:03,392 INFO L128 eAbstractionObserver]: Analyzing ICFG uthash_SFH_test9-1.i [2025-02-06 10:03:03,403 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 10:03:03,404 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG uthash_SFH_test9-1.i that has 6 procedures, 1380 locations, 1 initial locations, 33 loop locations, and 2 error locations. [2025-02-06 10:03:03,462 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 10:03:03,470 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;@3af20cd7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 10:03:03,471 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-02-06 10:03:03,479 INFO L276 IsEmpty]: Start isEmpty. Operand has 1372 states, 861 states have (on average 1.8373983739837398) internal successors, (1582), 1365 states have internal predecessors, (1582), 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-02-06 10:03:03,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-02-06 10:03:03,482 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:03:03,483 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:03:03,484 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-02-06 10:03:03,489 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:03:03,489 INFO L85 PathProgramCache]: Analyzing trace with hash 584770443, now seen corresponding path program 1 times [2025-02-06 10:03:03,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:03:03,494 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1563297886] [2025-02-06 10:03:03,495 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:03:03,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:03:03,558 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-06 10:03:03,570 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-06 10:03:03,572 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:03:03,572 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:03:03,609 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:03:03,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:03:03,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1563297886] [2025-02-06 10:03:03,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1563297886] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:03:03,611 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:03:03,611 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 10:03:03,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1201155657] [2025-02-06 10:03:03,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:03:03,616 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 10:03:03,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:03:03,633 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 10:03:03,634 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 10:03:03,639 INFO L87 Difference]: Start difference. First operand has 1372 states, 861 states have (on average 1.8373983739837398) internal successors, (1582), 1365 states have internal predecessors, (1582), 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-02-06 10:03:03,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:03:03,816 INFO L93 Difference]: Finished difference Result 1370 states and 2533 transitions. [2025-02-06 10:03:03,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 10:03:03,817 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-02-06 10:03:03,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:03:03,832 INFO L225 Difference]: With dead ends: 1370 [2025-02-06 10:03:03,832 INFO L226 Difference]: Without dead ends: 1368 [2025-02-06 10:03:03,833 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-02-06 10:03:03,835 INFO L435 NwaCegarLoop]: 2492 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2492 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:03:03,835 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2492 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 10:03:03,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1368 states. [2025-02-06 10:03:04,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1368 to 1368. [2025-02-06 10:03:04,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1368 states, 859 states have (on average 1.7729918509895226) internal successors, (1523), 1361 states have internal predecessors, (1523), 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-02-06 10:03:04,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1368 states to 1368 states and 2531 transitions. [2025-02-06 10:03:04,081 INFO L78 Accepts]: Start accepts. Automaton has 1368 states and 2531 transitions. Word has length 7 [2025-02-06 10:03:04,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:03:04,081 INFO L471 AbstractCegarLoop]: Abstraction has 1368 states and 2531 transitions. [2025-02-06 10:03:04,082 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-02-06 10:03:04,082 INFO L276 IsEmpty]: Start isEmpty. Operand 1368 states and 2531 transitions. [2025-02-06 10:03:04,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-02-06 10:03:04,082 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:03:04,082 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:03:04,082 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 10:03:04,082 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-02-06 10:03:04,083 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:03:04,083 INFO L85 PathProgramCache]: Analyzing trace with hash -518704387, now seen corresponding path program 1 times [2025-02-06 10:03:04,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:03:04,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1486398430] [2025-02-06 10:03:04,083 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:03:04,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:03:04,091 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-06 10:03:04,098 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-06 10:03:04,098 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:03:04,098 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:03:04,268 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:03:04,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:03:04,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1486398430] [2025-02-06 10:03:04,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1486398430] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:03:04,268 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:03:04,268 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 10:03:04,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1863905168] [2025-02-06 10:03:04,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:03:04,269 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 10:03:04,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:03:04,270 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 10:03:04,270 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 10:03:04,270 INFO L87 Difference]: Start difference. First operand 1368 states and 2531 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-02-06 10:03:04,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:03:04,987 INFO L93 Difference]: Finished difference Result 2719 states and 5046 transitions. [2025-02-06 10:03:04,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 10:03:04,987 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-02-06 10:03:04,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:03:05,006 INFO L225 Difference]: With dead ends: 2719 [2025-02-06 10:03:05,007 INFO L226 Difference]: Without dead ends: 2719 [2025-02-06 10:03:05,007 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 10:03:05,009 INFO L435 NwaCegarLoop]: 2575 mSDtfsCounter, 1505 mSDsluCounter, 4538 mSDsCounter, 0 mSdLazyCounter, 694 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2008 SdHoareTripleChecker+Valid, 7113 SdHoareTripleChecker+Invalid, 695 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 694 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-06 10:03:05,009 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2008 Valid, 7113 Invalid, 695 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 694 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-06 10:03:05,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2719 states. [2025-02-06 10:03:05,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2719 to 1370. [2025-02-06 10:03:05,342 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-02-06 10:03:05,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1370 states to 1370 states and 2533 transitions. [2025-02-06 10:03:05,355 INFO L78 Accepts]: Start accepts. Automaton has 1370 states and 2533 transitions. Word has length 9 [2025-02-06 10:03:05,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:03:05,356 INFO L471 AbstractCegarLoop]: Abstraction has 1370 states and 2533 transitions. [2025-02-06 10:03:05,356 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-02-06 10:03:05,356 INFO L276 IsEmpty]: Start isEmpty. Operand 1370 states and 2533 transitions. [2025-02-06 10:03:05,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-02-06 10:03:05,358 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:03:05,358 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:03:05,358 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 10:03:05,358 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-02-06 10:03:05,359 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:03:05,362 INFO L85 PathProgramCache]: Analyzing trace with hash -613482325, now seen corresponding path program 1 times [2025-02-06 10:03:05,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:03:05,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [109202102] [2025-02-06 10:03:05,363 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:03:05,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:03:05,409 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-02-06 10:03:05,425 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-02-06 10:03:05,426 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:03:05,426 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:03:05,690 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:03:05,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:03:05,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [109202102] [2025-02-06 10:03:05,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [109202102] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:03:05,690 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:03:05,690 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 10:03:05,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [711513974] [2025-02-06 10:03:05,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:03:05,691 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 10:03:05,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:03:05,691 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 10:03:05,691 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 10:03:05,691 INFO L87 Difference]: Start difference. First operand 1370 states and 2533 transitions. Second operand has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:03:05,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:03:05,821 INFO L93 Difference]: Finished difference Result 1328 states and 2456 transitions. [2025-02-06 10:03:05,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 10:03:05,822 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 84 [2025-02-06 10:03:05,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:03:05,828 INFO L225 Difference]: With dead ends: 1328 [2025-02-06 10:03:05,828 INFO L226 Difference]: Without dead ends: 1328 [2025-02-06 10:03:05,828 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 10:03:05,829 INFO L435 NwaCegarLoop]: 2396 mSDtfsCounter, 33 mSDsluCounter, 4776 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 7172 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:03:05,829 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 7172 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 10:03:05,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1328 states. [2025-02-06 10:03:05,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1328 to 1328. [2025-02-06 10:03:05,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1328 states, 819 states have (on average 1.768009768009768) internal successors, (1448), 1321 states have internal predecessors, (1448), 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-02-06 10:03:05,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1328 states to 1328 states and 2456 transitions. [2025-02-06 10:03:05,928 INFO L78 Accepts]: Start accepts. Automaton has 1328 states and 2456 transitions. Word has length 84 [2025-02-06 10:03:05,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:03:05,928 INFO L471 AbstractCegarLoop]: Abstraction has 1328 states and 2456 transitions. [2025-02-06 10:03:05,929 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:03:05,929 INFO L276 IsEmpty]: Start isEmpty. Operand 1328 states and 2456 transitions. [2025-02-06 10:03:05,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-02-06 10:03:05,930 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:03:05,930 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:03:05,930 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 10:03:05,931 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-02-06 10:03:05,931 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:03:05,931 INFO L85 PathProgramCache]: Analyzing trace with hash -442902334, now seen corresponding path program 1 times [2025-02-06 10:03:05,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:03:05,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1281121816] [2025-02-06 10:03:05,931 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:03:05,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:03:05,958 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-02-06 10:03:05,963 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-02-06 10:03:05,963 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:03:05,964 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:03:06,055 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:03:06,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:03:06,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1281121816] [2025-02-06 10:03:06,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1281121816] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:03:06,056 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:03:06,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 10:03:06,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [275773163] [2025-02-06 10:03:06,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:03:06,056 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 10:03:06,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:03:06,056 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 10:03:06,056 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 10:03:06,056 INFO L87 Difference]: Start difference. First operand 1328 states and 2456 transitions. Second operand has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:03:06,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:03:06,144 INFO L93 Difference]: Finished difference Result 1328 states and 2453 transitions. [2025-02-06 10:03:06,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 10:03:06,144 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 84 [2025-02-06 10:03:06,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:03:06,149 INFO L225 Difference]: With dead ends: 1328 [2025-02-06 10:03:06,149 INFO L226 Difference]: Without dead ends: 1328 [2025-02-06 10:03:06,149 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-02-06 10:03:06,150 INFO L435 NwaCegarLoop]: 2410 mSDtfsCounter, 2 mSDsluCounter, 2388 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 4798 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:03:06,150 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 4798 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 10:03:06,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1328 states. [2025-02-06 10:03:06,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1328 to 1328. [2025-02-06 10:03:06,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1328 states, 819 states have (on average 1.7643467643467643) internal successors, (1445), 1321 states have internal predecessors, (1445), 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-02-06 10:03:06,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1328 states to 1328 states and 2453 transitions. [2025-02-06 10:03:06,247 INFO L78 Accepts]: Start accepts. Automaton has 1328 states and 2453 transitions. Word has length 84 [2025-02-06 10:03:06,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:03:06,248 INFO L471 AbstractCegarLoop]: Abstraction has 1328 states and 2453 transitions. [2025-02-06 10:03:06,248 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:03:06,248 INFO L276 IsEmpty]: Start isEmpty. Operand 1328 states and 2453 transitions. [2025-02-06 10:03:06,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-02-06 10:03:06,251 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:03:06,251 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:03:06,251 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 10:03:06,252 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-02-06 10:03:06,252 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:03:06,252 INFO L85 PathProgramCache]: Analyzing trace with hash 1029369893, now seen corresponding path program 1 times [2025-02-06 10:03:06,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:03:06,252 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1480872421] [2025-02-06 10:03:06,252 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:03:06,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:03:06,295 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-02-06 10:03:06,313 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-02-06 10:03:06,313 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:03:06,313 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:03:06,417 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:03:06,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:03:06,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1480872421] [2025-02-06 10:03:06,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1480872421] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:03:06,418 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:03:06,418 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 10:03:06,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1156449248] [2025-02-06 10:03:06,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:03:06,418 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 10:03:06,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:03:06,419 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 10:03:06,419 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 10:03:06,419 INFO L87 Difference]: Start difference. First operand 1328 states and 2453 transitions. Second operand has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:03:06,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:03:06,560 INFO L93 Difference]: Finished difference Result 2553 states and 4773 transitions. [2025-02-06 10:03:06,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 10:03:06,561 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 84 [2025-02-06 10:03:06,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:03:06,571 INFO L225 Difference]: With dead ends: 2553 [2025-02-06 10:03:06,572 INFO L226 Difference]: Without dead ends: 2553 [2025-02-06 10:03:06,572 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 10:03:06,572 INFO L435 NwaCegarLoop]: 2603 mSDtfsCounter, 1262 mSDsluCounter, 2402 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1762 SdHoareTripleChecker+Valid, 5005 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:03:06,572 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1762 Valid, 5005 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 10:03:06,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2553 states. [2025-02-06 10:03:06,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2553 to 2549. [2025-02-06 10:03:06,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2549 states, 1540 states have (on average 1.7935064935064935) internal successors, (2762), 2542 states have internal predecessors, (2762), 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-02-06 10:03:06,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2549 states to 2549 states and 4770 transitions. [2025-02-06 10:03:06,740 INFO L78 Accepts]: Start accepts. Automaton has 2549 states and 4770 transitions. Word has length 84 [2025-02-06 10:03:06,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:03:06,740 INFO L471 AbstractCegarLoop]: Abstraction has 2549 states and 4770 transitions. [2025-02-06 10:03:06,741 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:03:06,741 INFO L276 IsEmpty]: Start isEmpty. Operand 2549 states and 4770 transitions. [2025-02-06 10:03:06,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-02-06 10:03:06,741 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:03:06,742 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:03:06,742 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 10:03:06,742 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-02-06 10:03:06,742 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:03:06,742 INFO L85 PathProgramCache]: Analyzing trace with hash -439342547, now seen corresponding path program 1 times [2025-02-06 10:03:06,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:03:06,742 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1857687991] [2025-02-06 10:03:06,742 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:03:06,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:03:06,772 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-02-06 10:03:06,809 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-02-06 10:03:06,809 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:03:06,809 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:03:07,033 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-06 10:03:07,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:03:07,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1857687991] [2025-02-06 10:03:07,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1857687991] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:03:07,033 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:03:07,033 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 10:03:07,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [669458036] [2025-02-06 10:03:07,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:03:07,034 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 10:03:07,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:03:07,035 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 10:03:07,035 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 10:03:07,035 INFO L87 Difference]: Start difference. First operand 2549 states and 4770 transitions. Second operand has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 10:03:07,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:03:07,679 INFO L93 Difference]: Finished difference Result 4774 states and 9092 transitions. [2025-02-06 10:03:07,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 10:03:07,680 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 99 [2025-02-06 10:03:07,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:03:07,700 INFO L225 Difference]: With dead ends: 4774 [2025-02-06 10:03:07,701 INFO L226 Difference]: Without dead ends: 4774 [2025-02-06 10:03:07,701 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 10:03:07,701 INFO L435 NwaCegarLoop]: 2626 mSDtfsCounter, 1418 mSDsluCounter, 4515 mSDsCounter, 0 mSdLazyCounter, 659 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1921 SdHoareTripleChecker+Valid, 7141 SdHoareTripleChecker+Invalid, 660 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 659 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-06 10:03:07,702 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1921 Valid, 7141 Invalid, 660 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 659 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-06 10:03:07,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4774 states. [2025-02-06 10:03:07,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4774 to 2551. [2025-02-06 10:03:07,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2551 states, 1542 states have (on average 1.7924773022049287) internal successors, (2764), 2544 states have internal predecessors, (2764), 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-02-06 10:03:07,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2551 states to 2551 states and 4772 transitions. [2025-02-06 10:03:07,979 INFO L78 Accepts]: Start accepts. Automaton has 2551 states and 4772 transitions. Word has length 99 [2025-02-06 10:03:07,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:03:07,980 INFO L471 AbstractCegarLoop]: Abstraction has 2551 states and 4772 transitions. [2025-02-06 10:03:07,980 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 10:03:07,980 INFO L276 IsEmpty]: Start isEmpty. Operand 2551 states and 4772 transitions. [2025-02-06 10:03:07,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2025-02-06 10:03:07,984 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:03:07,984 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] [2025-02-06 10:03:07,985 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 10:03:07,985 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-02-06 10:03:07,985 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:03:07,985 INFO L85 PathProgramCache]: Analyzing trace with hash -828525313, now seen corresponding path program 1 times [2025-02-06 10:03:07,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:03:07,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1089016787] [2025-02-06 10:03:07,986 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:03:07,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:03:08,024 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-02-06 10:03:08,049 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-02-06 10:03:08,050 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:03:08,050 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:03:08,195 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-06 10:03:08,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:03:08,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1089016787] [2025-02-06 10:03:08,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1089016787] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:03:08,195 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:03:08,196 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 10:03:08,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [7743693] [2025-02-06 10:03:08,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:03:08,197 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 10:03:08,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:03:08,197 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 10:03:08,197 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 10:03:08,198 INFO L87 Difference]: Start difference. First operand 2551 states and 4772 transitions. Second operand has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 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-02-06 10:03:08,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:03:08,320 INFO L93 Difference]: Finished difference Result 2591 states and 4812 transitions. [2025-02-06 10:03:08,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 10:03:08,321 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 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 155 [2025-02-06 10:03:08,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:03:08,333 INFO L225 Difference]: With dead ends: 2591 [2025-02-06 10:03:08,333 INFO L226 Difference]: Without dead ends: 2591 [2025-02-06 10:03:08,333 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-02-06 10:03:08,334 INFO L435 NwaCegarLoop]: 2396 mSDtfsCounter, 8 mSDsluCounter, 2381 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 4777 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:03:08,335 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 4777 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 10:03:08,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2591 states. [2025-02-06 10:03:08,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2591 to 2591. [2025-02-06 10:03:08,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2591 states, 1582 states have (on average 1.7724399494310998) internal successors, (2804), 2584 states have internal predecessors, (2804), 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-02-06 10:03:08,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2591 states to 2591 states and 4812 transitions. [2025-02-06 10:03:08,686 INFO L78 Accepts]: Start accepts. Automaton has 2591 states and 4812 transitions. Word has length 155 [2025-02-06 10:03:08,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:03:08,687 INFO L471 AbstractCegarLoop]: Abstraction has 2591 states and 4812 transitions. [2025-02-06 10:03:08,687 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 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-02-06 10:03:08,688 INFO L276 IsEmpty]: Start isEmpty. Operand 2591 states and 4812 transitions. [2025-02-06 10:03:08,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2025-02-06 10:03:08,689 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:03:08,689 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] [2025-02-06 10:03:08,689 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 10:03:08,689 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-02-06 10:03:08,689 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:03:08,690 INFO L85 PathProgramCache]: Analyzing trace with hash 354821984, now seen corresponding path program 1 times [2025-02-06 10:03:08,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:03:08,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2063563834] [2025-02-06 10:03:08,690 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:03:08,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:03:08,727 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-02-06 10:03:08,751 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-02-06 10:03:08,751 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:03:08,751 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:03:08,916 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-06 10:03:08,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:03:08,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2063563834] [2025-02-06 10:03:08,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2063563834] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:03:08,916 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:03:08,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 10:03:08,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [341157193] [2025-02-06 10:03:08,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:03:08,917 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 10:03:08,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:03:08,917 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 10:03:08,918 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 10:03:08,919 INFO L87 Difference]: Start difference. First operand 2591 states and 4812 transitions. Second operand has 4 states, 4 states have (on average 36.5) internal successors, (146), 4 states have internal predecessors, (146), 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-02-06 10:03:09,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:03:09,021 INFO L93 Difference]: Finished difference Result 2467 states and 4612 transitions. [2025-02-06 10:03:09,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 10:03:09,022 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 36.5) internal successors, (146), 4 states have internal predecessors, (146), 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 155 [2025-02-06 10:03:09,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:03:09,037 INFO L225 Difference]: With dead ends: 2467 [2025-02-06 10:03:09,038 INFO L226 Difference]: Without dead ends: 2467 [2025-02-06 10:03:09,038 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 10:03:09,038 INFO L435 NwaCegarLoop]: 2321 mSDtfsCounter, 32 mSDsluCounter, 4628 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 6949 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:03:09,038 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 6949 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 10:03:09,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2467 states. [2025-02-06 10:03:09,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2467 to 2467. [2025-02-06 10:03:09,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2467 states, 1458 states have (on average 1.786008230452675) internal successors, (2604), 2460 states have internal predecessors, (2604), 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-02-06 10:03:09,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2467 states to 2467 states and 4612 transitions. [2025-02-06 10:03:09,216 INFO L78 Accepts]: Start accepts. Automaton has 2467 states and 4612 transitions. Word has length 155 [2025-02-06 10:03:09,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:03:09,216 INFO L471 AbstractCegarLoop]: Abstraction has 2467 states and 4612 transitions. [2025-02-06 10:03:09,216 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 36.5) internal successors, (146), 4 states have internal predecessors, (146), 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-02-06 10:03:09,216 INFO L276 IsEmpty]: Start isEmpty. Operand 2467 states and 4612 transitions. [2025-02-06 10:03:09,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2025-02-06 10:03:09,217 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:03:09,217 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] [2025-02-06 10:03:09,217 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-06 10:03:09,217 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-02-06 10:03:09,218 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:03:09,218 INFO L85 PathProgramCache]: Analyzing trace with hash 207074425, now seen corresponding path program 1 times [2025-02-06 10:03:09,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:03:09,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [42518604] [2025-02-06 10:03:09,218 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:03:09,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:03:09,253 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-02-06 10:03:09,278 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-02-06 10:03:09,278 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:03:09,278 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:03:09,476 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-06 10:03:09,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:03:09,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [42518604] [2025-02-06 10:03:09,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [42518604] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:03:09,476 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:03:09,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 10:03:09,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713743917] [2025-02-06 10:03:09,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:03:09,477 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 10:03:09,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:03:09,478 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 10:03:09,478 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 10:03:09,478 INFO L87 Difference]: Start difference. First operand 2467 states and 4612 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-02-06 10:03:10,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:03:10,820 INFO L93 Difference]: Finished difference Result 2549 states and 4718 transitions. [2025-02-06 10:03:10,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 10:03:10,820 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 155 [2025-02-06 10:03:10,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:03:10,828 INFO L225 Difference]: With dead ends: 2549 [2025-02-06 10:03:10,829 INFO L226 Difference]: Without dead ends: 2549 [2025-02-06 10:03:10,829 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-02-06 10:03:10,829 INFO L435 NwaCegarLoop]: 2479 mSDtfsCounter, 3770 mSDsluCounter, 3033 mSDsCounter, 0 mSdLazyCounter, 671 mSolverCounterSat, 1003 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4271 SdHoareTripleChecker+Valid, 5512 SdHoareTripleChecker+Invalid, 1674 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1003 IncrementalHoareTripleChecker+Valid, 671 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-02-06 10:03:10,829 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4271 Valid, 5512 Invalid, 1674 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1003 Valid, 671 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-02-06 10:03:10,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2549 states. [2025-02-06 10:03:11,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2549 to 1374. [2025-02-06 10:03:11,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1374 states, 865 states have (on average 1.7098265895953757) internal successors, (1479), 1367 states have internal predecessors, (1479), 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-02-06 10:03:11,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1374 states to 1374 states and 2487 transitions. [2025-02-06 10:03:11,008 INFO L78 Accepts]: Start accepts. Automaton has 1374 states and 2487 transitions. Word has length 155 [2025-02-06 10:03:11,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:03:11,008 INFO L471 AbstractCegarLoop]: Abstraction has 1374 states and 2487 transitions. [2025-02-06 10:03:11,009 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-02-06 10:03:11,009 INFO L276 IsEmpty]: Start isEmpty. Operand 1374 states and 2487 transitions. [2025-02-06 10:03:11,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-02-06 10:03:11,010 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:03:11,010 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] [2025-02-06 10:03:11,010 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-06 10:03:11,010 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-02-06 10:03:11,011 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:03:11,011 INFO L85 PathProgramCache]: Analyzing trace with hash -1988142997, now seen corresponding path program 1 times [2025-02-06 10:03:11,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:03:11,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1138467050] [2025-02-06 10:03:11,011 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:03:11,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:03:11,044 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-02-06 10:03:11,071 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-02-06 10:03:11,071 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:03:11,072 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:03:11,585 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-06 10:03:11,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:03:11,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1138467050] [2025-02-06 10:03:11,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1138467050] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:03:11,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [257302151] [2025-02-06 10:03:11,585 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:03:11,585 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:03:11,585 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:03:11,591 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 10:03:11,592 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-06 10:03:11,774 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-02-06 10:03:11,861 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-02-06 10:03:11,861 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:03:11,861 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:03:11,865 INFO L256 TraceCheckSpWp]: Trace formula consists of 772 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-02-06 10:03:11,872 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:03:11,888 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-06 10:03:12,062 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 23 treesize of output 3 [2025-02-06 10:03:12,066 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-02-06 10:03:12,080 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-06 10:03:12,080 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:03:12,242 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-06 10:03:12,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [257302151] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 10:03:12,242 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 10:03:12,243 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 5] total 11 [2025-02-06 10:03:12,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [38642469] [2025-02-06 10:03:12,243 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 10:03:12,243 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-06 10:03:12,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:03:12,244 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-06 10:03:12,244 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2025-02-06 10:03:12,244 INFO L87 Difference]: Start difference. First operand 1374 states and 2487 transitions. Second operand has 11 states, 11 states have (on average 29.363636363636363) internal successors, (323), 11 states have internal predecessors, (323), 4 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-02-06 10:03:16,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:03:16,802 INFO L93 Difference]: Finished difference Result 4093 states and 7436 transitions. [2025-02-06 10:03:16,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-06 10:03:16,802 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 29.363636363636363) internal successors, (323), 11 states have internal predecessors, (323), 4 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 165 [2025-02-06 10:03:16,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:03:16,811 INFO L225 Difference]: With dead ends: 4093 [2025-02-06 10:03:16,811 INFO L226 Difference]: Without dead ends: 4093 [2025-02-06 10:03:16,811 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 338 GetRequests, 323 SyntacticMatches, 3 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2025-02-06 10:03:16,811 INFO L435 NwaCegarLoop]: 1865 mSDtfsCounter, 8370 mSDsluCounter, 9948 mSDsCounter, 0 mSdLazyCounter, 4817 mSolverCounterSat, 2011 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9374 SdHoareTripleChecker+Valid, 11813 SdHoareTripleChecker+Invalid, 6828 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2011 IncrementalHoareTripleChecker+Valid, 4817 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2025-02-06 10:03:16,812 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9374 Valid, 11813 Invalid, 6828 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2011 Valid, 4817 Invalid, 0 Unknown, 0 Unchecked, 4.3s Time] [2025-02-06 10:03:16,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4093 states. [2025-02-06 10:03:17,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4093 to 1716. [2025-02-06 10:03:17,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1716 states, 1203 states have (on average 1.600166251039069) internal successors, (1925), 1705 states have internal predecessors, (1925), 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-02-06 10:03:17,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1716 states to 1716 states and 2939 transitions. [2025-02-06 10:03:17,066 INFO L78 Accepts]: Start accepts. Automaton has 1716 states and 2939 transitions. Word has length 165 [2025-02-06 10:03:17,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:03:17,066 INFO L471 AbstractCegarLoop]: Abstraction has 1716 states and 2939 transitions. [2025-02-06 10:03:17,066 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 29.363636363636363) internal successors, (323), 11 states have internal predecessors, (323), 4 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-02-06 10:03:17,067 INFO L276 IsEmpty]: Start isEmpty. Operand 1716 states and 2939 transitions. [2025-02-06 10:03:17,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 391 [2025-02-06 10:03:17,070 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:03:17,070 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, 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-02-06 10:03:17,078 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-06 10:03:17,270 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-02-06 10:03:17,271 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-02-06 10:03:17,273 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:03:17,273 INFO L85 PathProgramCache]: Analyzing trace with hash -1791400909, now seen corresponding path program 1 times [2025-02-06 10:03:17,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:03:17,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [272956060] [2025-02-06 10:03:17,273 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:03:17,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:03:17,357 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 390 statements into 1 equivalence classes. [2025-02-06 10:03:17,472 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 390 of 390 statements. [2025-02-06 10:03:17,472 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:03:17,472 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:03:19,743 INFO L134 CoverageAnalysis]: Checked inductivity of 456 backedges. 0 proven. 452 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-06 10:03:19,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:03:19,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [272956060] [2025-02-06 10:03:19,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [272956060] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:03:19,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1990531628] [2025-02-06 10:03:19,744 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:03:19,744 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:03:19,744 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:03:19,747 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 10:03:19,748 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-06 10:03:20,036 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 390 statements into 1 equivalence classes. [2025-02-06 10:03:20,227 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 390 of 390 statements. [2025-02-06 10:03:20,227 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:03:20,228 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:03:20,235 INFO L256 TraceCheckSpWp]: Trace formula consists of 1903 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-02-06 10:03:20,246 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:03:20,263 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-06 10:03:20,414 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 23 treesize of output 3 [2025-02-06 10:03:20,501 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-02-06 10:03:20,587 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-02-06 10:03:20,679 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-02-06 10:03:20,683 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-02-06 10:03:20,687 INFO L134 CoverageAnalysis]: Checked inductivity of 456 backedges. 0 proven. 452 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-06 10:03:20,689 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:03:21,084 INFO L134 CoverageAnalysis]: Checked inductivity of 456 backedges. 0 proven. 452 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-06 10:03:21,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1990531628] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 10:03:21,085 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 10:03:21,085 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9, 8] total 20 [2025-02-06 10:03:21,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1155297534] [2025-02-06 10:03:21,085 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 10:03:21,087 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-02-06 10:03:21,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:03:21,088 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-02-06 10:03:21,088 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=236, Unknown=0, NotChecked=0, Total=380 [2025-02-06 10:03:21,088 INFO L87 Difference]: Start difference. First operand 1716 states and 2939 transitions. Second operand has 20 states, 20 states have (on average 38.95) internal successors, (779), 20 states have internal predecessors, (779), 4 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-02-06 10:03:30,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:03:30,338 INFO L93 Difference]: Finished difference Result 9409 states and 17180 transitions. [2025-02-06 10:03:30,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-02-06 10:03:30,339 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 38.95) internal successors, (779), 20 states have internal predecessors, (779), 4 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 390 [2025-02-06 10:03:30,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:03:30,360 INFO L225 Difference]: With dead ends: 9409 [2025-02-06 10:03:30,360 INFO L226 Difference]: Without dead ends: 9409 [2025-02-06 10:03:30,360 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 800 GetRequests, 773 SyntacticMatches, 3 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=223, Invalid=427, Unknown=0, NotChecked=0, Total=650 [2025-02-06 10:03:30,361 INFO L435 NwaCegarLoop]: 1865 mSDtfsCounter, 16242 mSDsluCounter, 20117 mSDsCounter, 0 mSdLazyCounter, 10354 mSolverCounterSat, 2725 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19252 SdHoareTripleChecker+Valid, 21982 SdHoareTripleChecker+Invalid, 13079 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 2725 IncrementalHoareTripleChecker+Valid, 10354 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.5s IncrementalHoareTripleChecker+Time [2025-02-06 10:03:30,361 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [19252 Valid, 21982 Invalid, 13079 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [2725 Valid, 10354 Invalid, 0 Unknown, 0 Unchecked, 8.5s Time] [2025-02-06 10:03:30,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9409 states. [2025-02-06 10:03:31,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9409 to 2568. [2025-02-06 10:03:31,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2568 states, 2049 states have (on average 1.4841386041971694) internal successors, (3041), 2551 states have internal predecessors, (3041), 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-02-06 10:03:31,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2568 states to 2568 states and 4067 transitions. [2025-02-06 10:03:31,017 INFO L78 Accepts]: Start accepts. Automaton has 2568 states and 4067 transitions. Word has length 390 [2025-02-06 10:03:31,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:03:31,018 INFO L471 AbstractCegarLoop]: Abstraction has 2568 states and 4067 transitions. [2025-02-06 10:03:31,018 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 38.95) internal successors, (779), 20 states have internal predecessors, (779), 4 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-02-06 10:03:31,018 INFO L276 IsEmpty]: Start isEmpty. Operand 2568 states and 4067 transitions. [2025-02-06 10:03:31,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 841 [2025-02-06 10:03:31,054 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:03:31,054 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, 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-02-06 10:03:31,067 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-06 10:03:31,259 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-02-06 10:03:31,259 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-02-06 10:03:31,261 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:03:31,261 INFO L85 PathProgramCache]: Analyzing trace with hash -1603065037, now seen corresponding path program 2 times [2025-02-06 10:03:31,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:03:31,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1059939836] [2025-02-06 10:03:31,262 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 10:03:31,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:03:31,536 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 840 statements into 2 equivalence classes. [2025-02-06 10:03:31,556 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 75 of 840 statements. [2025-02-06 10:03:31,556 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 10:03:31,556 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:03:31,687 INFO L134 CoverageAnalysis]: Checked inductivity of 3381 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3381 trivial. 0 not checked. [2025-02-06 10:03:31,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:03:31,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1059939836] [2025-02-06 10:03:31,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1059939836] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:03:31,688 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:03:31,688 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 10:03:31,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382131187] [2025-02-06 10:03:31,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:03:31,689 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 10:03:31,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:03:31,689 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 10:03:31,689 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 10:03:31,690 INFO L87 Difference]: Start difference. First operand 2568 states and 4067 transitions. Second operand has 6 states, 6 states have (on average 26.5) internal successors, (159), 6 states have internal predecessors, (159), 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-02-06 10:03:31,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:03:31,988 INFO L93 Difference]: Finished difference Result 2573 states and 4074 transitions. [2025-02-06 10:03:31,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 10:03:31,989 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 26.5) internal successors, (159), 6 states have internal predecessors, (159), 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 840 [2025-02-06 10:03:31,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:03:31,995 INFO L225 Difference]: With dead ends: 2573 [2025-02-06 10:03:31,995 INFO L226 Difference]: Without dead ends: 2573 [2025-02-06 10:03:31,996 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-02-06 10:03:31,996 INFO L435 NwaCegarLoop]: 2328 mSDtfsCounter, 14 mSDsluCounter, 9048 mSDsCounter, 0 mSdLazyCounter, 407 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 11376 SdHoareTripleChecker+Invalid, 407 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 407 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 10:03:31,996 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 11376 Invalid, 407 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 407 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 10:03:31,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2573 states. [2025-02-06 10:03:32,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2573 to 2570. [2025-02-06 10:03:32,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2570 states, 2051 states have (on average 1.4836665041443198) internal successors, (3043), 2553 states have internal predecessors, (3043), 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-02-06 10:03:32,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2570 states to 2570 states and 4069 transitions. [2025-02-06 10:03:32,107 INFO L78 Accepts]: Start accepts. Automaton has 2570 states and 4069 transitions. Word has length 840 [2025-02-06 10:03:32,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:03:32,108 INFO L471 AbstractCegarLoop]: Abstraction has 2570 states and 4069 transitions. [2025-02-06 10:03:32,108 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 26.5) internal successors, (159), 6 states have internal predecessors, (159), 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-02-06 10:03:32,108 INFO L276 IsEmpty]: Start isEmpty. Operand 2570 states and 4069 transitions. [2025-02-06 10:03:32,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 842 [2025-02-06 10:03:32,120 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:03:32,120 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, 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-02-06 10:03:32,120 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-06 10:03:32,121 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-02-06 10:03:32,121 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:03:32,122 INFO L85 PathProgramCache]: Analyzing trace with hash 1139426752, now seen corresponding path program 1 times [2025-02-06 10:03:32,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:03:32,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1876105976] [2025-02-06 10:03:32,122 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:03:32,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:03:32,282 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 841 statements into 1 equivalence classes. [2025-02-06 10:03:32,529 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 841 of 841 statements. [2025-02-06 10:03:32,530 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:03:32,530 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:03:33,502 INFO L134 CoverageAnalysis]: Checked inductivity of 3381 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3381 trivial. 0 not checked. [2025-02-06 10:03:33,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:03:33,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1876105976] [2025-02-06 10:03:33,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1876105976] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:03:33,502 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:03:33,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-06 10:03:33,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [28235381] [2025-02-06 10:03:33,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:03:33,503 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 10:03:33,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:03:33,504 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 10:03:33,504 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-06 10:03:33,504 INFO L87 Difference]: Start difference. First operand 2570 states and 4069 transitions. Second operand has 7 states, 7 states have (on average 22.857142857142858) internal successors, (160), 7 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-02-06 10:03:33,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:03:33,762 INFO L93 Difference]: Finished difference Result 2575 states and 4075 transitions. [2025-02-06 10:03:33,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 10:03:33,763 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 22.857142857142858) internal successors, (160), 7 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 841 [2025-02-06 10:03:33,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:03:33,774 INFO L225 Difference]: With dead ends: 2575 [2025-02-06 10:03:33,774 INFO L226 Difference]: Without dead ends: 2575 [2025-02-06 10:03:33,774 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-06 10:03:33,782 INFO L435 NwaCegarLoop]: 2323 mSDtfsCounter, 15 mSDsluCounter, 11329 mSDsCounter, 0 mSdLazyCounter, 491 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 13652 SdHoareTripleChecker+Invalid, 492 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 491 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 10:03:33,782 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 13652 Invalid, 492 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 491 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 10:03:33,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2575 states. [2025-02-06 10:03:33,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2575 to 2574. [2025-02-06 10:03:33,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2574 states, 2055 states have (on average 1.4832116788321168) internal successors, (3048), 2557 states have internal predecessors, (3048), 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-02-06 10:03:33,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2574 states to 2574 states and 4074 transitions. [2025-02-06 10:03:33,913 INFO L78 Accepts]: Start accepts. Automaton has 2574 states and 4074 transitions. Word has length 841 [2025-02-06 10:03:33,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:03:33,915 INFO L471 AbstractCegarLoop]: Abstraction has 2574 states and 4074 transitions. [2025-02-06 10:03:33,915 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 22.857142857142858) internal successors, (160), 7 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-02-06 10:03:33,915 INFO L276 IsEmpty]: Start isEmpty. Operand 2574 states and 4074 transitions. [2025-02-06 10:03:33,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 842 [2025-02-06 10:03:33,924 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:03:33,925 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, 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-02-06 10:03:33,925 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-06 10:03:33,925 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-02-06 10:03:33,926 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:03:33,926 INFO L85 PathProgramCache]: Analyzing trace with hash 520882489, now seen corresponding path program 1 times [2025-02-06 10:03:33,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:03:33,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1227789281] [2025-02-06 10:03:33,926 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:03:33,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:03:34,161 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 841 statements into 1 equivalence classes. [2025-02-06 10:03:34,417 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 841 of 841 statements. [2025-02-06 10:03:34,418 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:03:34,418 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:03:41,805 INFO L134 CoverageAnalysis]: Checked inductivity of 3381 backedges. 0 proven. 3377 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-06 10:03:41,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:03:41,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1227789281] [2025-02-06 10:03:41,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1227789281] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:03:41,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1789129004] [2025-02-06 10:03:41,805 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:03:41,806 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:03:41,806 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:03:41,807 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 10:03:41,809 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-06 10:03:42,377 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 841 statements into 1 equivalence classes. [2025-02-06 10:03:42,825 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 841 of 841 statements. [2025-02-06 10:03:42,825 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:03:42,825 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:03:42,844 INFO L256 TraceCheckSpWp]: Trace formula consists of 4166 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-02-06 10:03:42,856 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:03:42,863 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-06 10:03:42,989 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 23 treesize of output 3 [2025-02-06 10:03:43,069 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-02-06 10:03:43,152 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-02-06 10:03:43,235 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-02-06 10:03:43,318 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-02-06 10:03:43,393 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-02-06 10:03:43,473 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-02-06 10:03:43,560 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-02-06 10:03:43,639 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-02-06 10:03:43,713 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-02-06 10:03:43,721 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-02-06 10:03:43,727 INFO L134 CoverageAnalysis]: Checked inductivity of 3381 backedges. 0 proven. 3377 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-06 10:03:43,727 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:03:44,697 INFO L134 CoverageAnalysis]: Checked inductivity of 3381 backedges. 0 proven. 3377 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-06 10:03:44,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1789129004] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 10:03:44,698 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 10:03:44,698 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 15, 14] total 38 [2025-02-06 10:03:44,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1323905835] [2025-02-06 10:03:44,698 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 10:03:44,699 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2025-02-06 10:03:44,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:03:44,701 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2025-02-06 10:03:44,701 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=570, Invalid=836, Unknown=0, NotChecked=0, Total=1406 [2025-02-06 10:03:44,701 INFO L87 Difference]: Start difference. First operand 2574 states and 4074 transitions. Second operand has 38 states, 38 states have (on average 44.526315789473685) internal successors, (1692), 38 states have internal predecessors, (1692), 4 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-02-06 10:04:03,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:04:03,351 INFO L93 Difference]: Finished difference Result 17887 states and 32451 transitions. [2025-02-06 10:04:03,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2025-02-06 10:04:03,351 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 44.526315789473685) internal successors, (1692), 38 states have internal predecessors, (1692), 4 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 841 [2025-02-06 10:04:03,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:04:03,383 INFO L225 Difference]: With dead ends: 17887 [2025-02-06 10:04:03,384 INFO L226 Difference]: Without dead ends: 17887 [2025-02-06 10:04:03,384 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1721 GetRequests, 1670 SyntacticMatches, 3 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 802 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=871, Invalid=1579, Unknown=0, NotChecked=0, Total=2450 [2025-02-06 10:04:03,385 INFO L435 NwaCegarLoop]: 1865 mSDtfsCounter, 55526 mSDsluCounter, 30385 mSDsCounter, 0 mSdLazyCounter, 16186 mSolverCounterSat, 8693 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61548 SdHoareTripleChecker+Valid, 32250 SdHoareTripleChecker+Invalid, 24879 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 8693 IncrementalHoareTripleChecker+Valid, 16186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 16.0s IncrementalHoareTripleChecker+Time [2025-02-06 10:04:03,385 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [61548 Valid, 32250 Invalid, 24879 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [8693 Valid, 16186 Invalid, 0 Unknown, 0 Unchecked, 16.0s Time] [2025-02-06 10:04:03,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17887 states. [2025-02-06 10:04:04,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17887 to 4278. [2025-02-06 10:04:04,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4278 states, 3747 states have (on average 1.4091273018414732) internal successors, (5280), 4249 states have internal predecessors, (5280), 526 states have call successors, (526), 4 states have call predecessors, (526), 3 states have return successors, (524), 25 states have call predecessors, (524), 524 states have call successors, (524) [2025-02-06 10:04:04,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4278 states to 4278 states and 6330 transitions. [2025-02-06 10:04:04,394 INFO L78 Accepts]: Start accepts. Automaton has 4278 states and 6330 transitions. Word has length 841 [2025-02-06 10:04:04,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:04:04,395 INFO L471 AbstractCegarLoop]: Abstraction has 4278 states and 6330 transitions. [2025-02-06 10:04:04,395 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 44.526315789473685) internal successors, (1692), 38 states have internal predecessors, (1692), 4 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-02-06 10:04:04,395 INFO L276 IsEmpty]: Start isEmpty. Operand 4278 states and 6330 transitions. [2025-02-06 10:04:04,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1742 [2025-02-06 10:04:04,409 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:04:04,410 INFO L218 NwaCegarLoop]: trace histogram [23, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 21, 21, 21, 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-02-06 10:04:04,426 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-02-06 10:04:04,614 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:04:04,614 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-02-06 10:04:04,617 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:04:04,617 INFO L85 PathProgramCache]: Analyzing trace with hash -1014269127, now seen corresponding path program 2 times [2025-02-06 10:04:04,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:04:04,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [631787648] [2025-02-06 10:04:04,617 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 10:04:04,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:04:04,996 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 1741 statements into 2 equivalence classes. [2025-02-06 10:04:05,005 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 76 of 1741 statements. [2025-02-06 10:04:05,008 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 10:04:05,008 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:04:05,111 INFO L134 CoverageAnalysis]: Checked inductivity of 17331 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17331 trivial. 0 not checked. [2025-02-06 10:04:05,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:04:05,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [631787648] [2025-02-06 10:04:05,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [631787648] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:04:05,111 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:04:05,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 10:04:05,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1938218665] [2025-02-06 10:04:05,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:04:05,112 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 10:04:05,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:04:05,113 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 10:04:05,113 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 10:04:05,113 INFO L87 Difference]: Start difference. First operand 4278 states and 6330 transitions. Second operand has 4 states, 4 states have (on average 40.0) internal successors, (160), 4 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-02-06 10:04:05,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:04:05,214 INFO L93 Difference]: Finished difference Result 4278 states and 6329 transitions. [2025-02-06 10:04:05,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 10:04:05,216 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 40.0) internal successors, (160), 4 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 1741 [2025-02-06 10:04:05,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:04:05,222 INFO L225 Difference]: With dead ends: 4278 [2025-02-06 10:04:05,222 INFO L226 Difference]: Without dead ends: 4278 [2025-02-06 10:04:05,223 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 10:04:05,224 INFO L435 NwaCegarLoop]: 2332 mSDtfsCounter, 17 mSDsluCounter, 4549 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 6881 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:04:05,224 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 6881 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 10:04:05,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4278 states. [2025-02-06 10:04:05,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4278 to 4278. [2025-02-06 10:04:05,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4278 states, 3747 states have (on average 1.40886042167067) internal successors, (5279), 4249 states have internal predecessors, (5279), 526 states have call successors, (526), 4 states have call predecessors, (526), 3 states have return successors, (524), 25 states have call predecessors, (524), 524 states have call successors, (524) [2025-02-06 10:04:05,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4278 states to 4278 states and 6329 transitions. [2025-02-06 10:04:05,311 INFO L78 Accepts]: Start accepts. Automaton has 4278 states and 6329 transitions. Word has length 1741 [2025-02-06 10:04:05,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:04:05,312 INFO L471 AbstractCegarLoop]: Abstraction has 4278 states and 6329 transitions. [2025-02-06 10:04:05,313 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 40.0) internal successors, (160), 4 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-02-06 10:04:05,313 INFO L276 IsEmpty]: Start isEmpty. Operand 4278 states and 6329 transitions. [2025-02-06 10:04:05,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1743 [2025-02-06 10:04:05,327 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:04:05,329 INFO L218 NwaCegarLoop]: trace histogram [23, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 21, 21, 21, 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-02-06 10:04:05,329 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-06 10:04:05,329 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-02-06 10:04:05,329 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:04:05,330 INFO L85 PathProgramCache]: Analyzing trace with hash -1186530022, now seen corresponding path program 1 times [2025-02-06 10:04:05,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:04:05,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [694867249] [2025-02-06 10:04:05,330 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:04:05,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:04:05,670 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1742 statements into 1 equivalence classes. [2025-02-06 10:04:06,202 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1742 of 1742 statements. [2025-02-06 10:04:06,202 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:04:06,202 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:04:09,512 INFO L134 CoverageAnalysis]: Checked inductivity of 17331 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17331 trivial. 0 not checked. [2025-02-06 10:04:09,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:04:09,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [694867249] [2025-02-06 10:04:09,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [694867249] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:04:09,513 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:04:09,513 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-06 10:04:09,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1692658343] [2025-02-06 10:04:09,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:04:09,514 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-06 10:04:09,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:04:09,514 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-06 10:04:09,514 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-02-06 10:04:09,514 INFO L87 Difference]: Start difference. First operand 4278 states and 6329 transitions. Second operand has 9 states, 9 states have (on average 17.88888888888889) internal successors, (161), 9 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-02-06 10:04:09,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:04:09,876 INFO L93 Difference]: Finished difference Result 4291 states and 6347 transitions. [2025-02-06 10:04:09,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 10:04:09,877 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 17.88888888888889) internal successors, (161), 9 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 1742 [2025-02-06 10:04:09,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:04:09,884 INFO L225 Difference]: With dead ends: 4291 [2025-02-06 10:04:09,884 INFO L226 Difference]: Without dead ends: 4291 [2025-02-06 10:04:09,884 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-02-06 10:04:09,885 INFO L435 NwaCegarLoop]: 2324 mSDtfsCounter, 33 mSDsluCounter, 15922 mSDsCounter, 0 mSdLazyCounter, 657 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 18246 SdHoareTripleChecker+Invalid, 660 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 657 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 10:04:09,885 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 18246 Invalid, 660 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 657 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 10:04:09,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4291 states. [2025-02-06 10:04:09,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4291 to 4288. [2025-02-06 10:04:09,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4288 states, 3757 states have (on average 1.4088368379025817) internal successors, (5293), 4259 states have internal predecessors, (5293), 526 states have call successors, (526), 4 states have call predecessors, (526), 3 states have return successors, (524), 25 states have call predecessors, (524), 524 states have call successors, (524) [2025-02-06 10:04:09,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4288 states to 4288 states and 6343 transitions. [2025-02-06 10:04:09,976 INFO L78 Accepts]: Start accepts. Automaton has 4288 states and 6343 transitions. Word has length 1742 [2025-02-06 10:04:09,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:04:09,977 INFO L471 AbstractCegarLoop]: Abstraction has 4288 states and 6343 transitions. [2025-02-06 10:04:09,977 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 17.88888888888889) internal successors, (161), 9 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-02-06 10:04:09,977 INFO L276 IsEmpty]: Start isEmpty. Operand 4288 states and 6343 transitions. [2025-02-06 10:04:09,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1743 [2025-02-06 10:04:09,991 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:04:09,992 INFO L218 NwaCegarLoop]: trace histogram [23, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 21, 21, 21, 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-02-06 10:04:09,992 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-06 10:04:09,992 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-02-06 10:04:09,993 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:04:09,993 INFO L85 PathProgramCache]: Analyzing trace with hash 361390166, now seen corresponding path program 1 times [2025-02-06 10:04:09,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:04:09,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1589397378] [2025-02-06 10:04:09,993 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:04:09,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:04:10,344 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1742 statements into 1 equivalence classes. [2025-02-06 10:04:10,835 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1742 of 1742 statements. [2025-02-06 10:04:10,835 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:04:10,836 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat