./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/list-simple/sll2n_prepend_equal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/list-simple/sll2n_prepend_equal.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e4cb0386e6b22b9d67dd4f4c4c33eb167dcf1836f99794e4424c5e73e6fc14d4 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 12:18:32,705 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 12:18:32,751 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-03-17 12:18:32,759 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 12:18:32,763 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 12:18:32,778 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 12:18:32,778 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 12:18:32,778 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 12:18:32,779 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 12:18:32,779 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 12:18:32,779 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 12:18:32,779 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 12:18:32,779 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 12:18:32,779 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 12:18:32,779 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 12:18:32,780 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 12:18:32,780 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 12:18:32,780 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 12:18:32,780 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 12:18:32,780 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 12:18:32,780 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-17 12:18:32,780 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-17 12:18:32,780 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-17 12:18:32,780 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 12:18:32,780 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-17 12:18:32,781 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-17 12:18:32,781 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 12:18:32,781 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 12:18:32,781 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 12:18:32,781 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 12:18:32,781 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 12:18:32,781 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 12:18:32,781 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 12:18:32,781 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 12:18:32,781 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 12:18:32,781 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 12:18:32,782 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 12:18:32,782 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 12:18:32,782 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 12:18:32,782 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 12:18:32,782 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 12:18:32,782 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 12:18:32,782 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/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> e4cb0386e6b22b9d67dd4f4c4c33eb167dcf1836f99794e4424c5e73e6fc14d4 [2025-03-17 12:18:32,987 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 12:18:32,994 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 12:18:32,995 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 12:18:32,997 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 12:18:32,997 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 12:18:32,998 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-simple/sll2n_prepend_equal.i [2025-03-17 12:18:34,136 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5948beb00/e2d59ba2533c4a6c9bd9fdba8ec142c9/FLAG059b36ba3 [2025-03-17 12:18:34,396 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 12:18:34,397 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2n_prepend_equal.i [2025-03-17 12:18:34,404 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5948beb00/e2d59ba2533c4a6c9bd9fdba8ec142c9/FLAG059b36ba3 [2025-03-17 12:18:34,704 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5948beb00/e2d59ba2533c4a6c9bd9fdba8ec142c9 [2025-03-17 12:18:34,706 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 12:18:34,707 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 12:18:34,707 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 12:18:34,708 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 12:18:34,710 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 12:18:34,711 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 12:18:34" (1/1) ... [2025-03-17 12:18:34,713 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6ededd99 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:18:34, skipping insertion in model container [2025-03-17 12:18:34,713 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 12:18:34" (1/1) ... [2025-03-17 12:18:34,743 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 12:18:34,895 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 12:18:34,903 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 12:18:34,945 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 12:18:34,963 INFO L204 MainTranslator]: Completed translation [2025-03-17 12:18:34,964 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:18:34 WrapperNode [2025-03-17 12:18:34,964 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 12:18:34,965 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 12:18:34,965 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 12:18:34,965 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 12:18:34,970 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:18:34" (1/1) ... [2025-03-17 12:18:34,976 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:18:34" (1/1) ... [2025-03-17 12:18:34,994 INFO L138 Inliner]: procedures = 127, calls = 31, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 101 [2025-03-17 12:18:34,994 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 12:18:34,994 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 12:18:34,995 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 12:18:34,995 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 12:18:35,000 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:18:34" (1/1) ... [2025-03-17 12:18:35,000 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:18:34" (1/1) ... [2025-03-17 12:18:35,002 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:18:34" (1/1) ... [2025-03-17 12:18:35,018 INFO L175 MemorySlicer]: Split 14 memory accesses to 3 slices as follows [2, 7, 5]. 50 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 0, 1]. The 5 writes are split as follows [0, 4, 1]. [2025-03-17 12:18:35,019 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:18:34" (1/1) ... [2025-03-17 12:18:35,019 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:18:34" (1/1) ... [2025-03-17 12:18:35,028 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:18:34" (1/1) ... [2025-03-17 12:18:35,029 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:18:34" (1/1) ... [2025-03-17 12:18:35,033 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:18:34" (1/1) ... [2025-03-17 12:18:35,034 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:18:34" (1/1) ... [2025-03-17 12:18:35,038 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 12:18:35,039 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 12:18:35,039 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 12:18:35,039 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 12:18:35,040 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:18:34" (1/1) ... [2025-03-17 12:18:35,043 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 12:18:35,055 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 12:18:35,065 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 12:18:35,066 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 12:18:35,082 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-17 12:18:35,082 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-17 12:18:35,082 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-17 12:18:35,082 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-17 12:18:35,082 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-17 12:18:35,083 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-17 12:18:35,083 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2025-03-17 12:18:35,083 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2025-03-17 12:18:35,083 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-17 12:18:35,083 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 12:18:35,083 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-17 12:18:35,083 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-17 12:18:35,083 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-17 12:18:35,083 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-17 12:18:35,083 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-17 12:18:35,084 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-17 12:18:35,084 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-17 12:18:35,084 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-17 12:18:35,084 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-03-17 12:18:35,084 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-03-17 12:18:35,084 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-03-17 12:18:35,084 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 12:18:35,084 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-17 12:18:35,084 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-17 12:18:35,085 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 12:18:35,085 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 12:18:35,175 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 12:18:35,177 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 12:18:35,377 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L607: call ULTIMATE.dealloc(main_~#s~0#1.base, main_~#s~0#1.offset);havoc main_~#s~0#1.base, main_~#s~0#1.offset; [2025-03-17 12:18:35,400 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L577: havoc myexit_~s#1;havoc myexit_#in~s#1;assume { :end_inline_myexit } true; [2025-03-17 12:18:35,419 INFO L? ?]: Removed 77 outVars from TransFormulas that were not future-live. [2025-03-17 12:18:35,421 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 12:18:35,429 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 12:18:35,431 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 12:18:35,431 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 12:18:35 BoogieIcfgContainer [2025-03-17 12:18:35,431 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 12:18:35,433 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 12:18:35,433 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 12:18:35,437 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 12:18:35,437 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 12:18:34" (1/3) ... [2025-03-17 12:18:35,437 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5adb65a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 12:18:35, skipping insertion in model container [2025-03-17 12:18:35,437 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:18:34" (2/3) ... [2025-03-17 12:18:35,438 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5adb65a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 12:18:35, skipping insertion in model container [2025-03-17 12:18:35,438 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 12:18:35" (3/3) ... [2025-03-17 12:18:35,439 INFO L128 eAbstractionObserver]: Analyzing ICFG sll2n_prepend_equal.i [2025-03-17 12:18:35,448 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 12:18:35,449 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG sll2n_prepend_equal.i that has 2 procedures, 71 locations, 1 initial locations, 3 loop locations, and 27 error locations. [2025-03-17 12:18:35,475 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 12:18:35,485 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;@175cb347, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 12:18:35,485 INFO L334 AbstractCegarLoop]: Starting to check reachability of 27 error locations. [2025-03-17 12:18:35,488 INFO L276 IsEmpty]: Start isEmpty. Operand has 71 states, 40 states have (on average 1.85) internal successors, (74), 67 states have internal predecessors, (74), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-17 12:18:35,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-03-17 12:18:35,493 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:18:35,493 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-17 12:18:35,494 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting node_createErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 24 more)] === [2025-03-17 12:18:35,497 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:18:35,497 INFO L85 PathProgramCache]: Analyzing trace with hash -1366579562, now seen corresponding path program 1 times [2025-03-17 12:18:35,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:18:35,505 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [778133079] [2025-03-17 12:18:35,505 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:18:35,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:18:35,565 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-17 12:18:35,581 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-17 12:18:35,581 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:18:35,581 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:18:35,703 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:18:35,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:18:35,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [778133079] [2025-03-17 12:18:35,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [778133079] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:18:35,706 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:18:35,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 12:18:35,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [93813517] [2025-03-17 12:18:35,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:18:35,710 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 12:18:35,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:18:35,729 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 12:18:35,730 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 12:18:35,732 INFO L87 Difference]: Start difference. First operand has 71 states, 40 states have (on average 1.85) internal successors, (74), 67 states have internal predecessors, (74), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:18:35,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:18:35,803 INFO L93 Difference]: Finished difference Result 68 states and 73 transitions. [2025-03-17 12:18:35,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 12:18:35,805 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2025-03-17 12:18:35,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:18:35,809 INFO L225 Difference]: With dead ends: 68 [2025-03-17 12:18:35,809 INFO L226 Difference]: Without dead ends: 65 [2025-03-17 12:18:35,811 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 12:18:35,814 INFO L435 NwaCegarLoop]: 66 mSDtfsCounter, 2 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 12:18:35,816 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 107 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 12:18:35,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2025-03-17 12:18:35,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2025-03-17 12:18:35,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 37 states have (on average 1.7567567567567568) internal successors, (65), 61 states have internal predecessors, (65), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-17 12:18:35,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 69 transitions. [2025-03-17 12:18:35,839 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 69 transitions. Word has length 6 [2025-03-17 12:18:35,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:18:35,839 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 69 transitions. [2025-03-17 12:18:35,839 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:18:35,839 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 69 transitions. [2025-03-17 12:18:35,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-03-17 12:18:35,840 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:18:35,840 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-17 12:18:35,840 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-17 12:18:35,840 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting node_createErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 24 more)] === [2025-03-17 12:18:35,841 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:18:35,841 INFO L85 PathProgramCache]: Analyzing trace with hash -1366579561, now seen corresponding path program 1 times [2025-03-17 12:18:35,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:18:35,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1066918981] [2025-03-17 12:18:35,841 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:18:35,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:18:35,850 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-17 12:18:35,860 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-17 12:18:35,860 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:18:35,860 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:18:35,942 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:18:35,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:18:35,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1066918981] [2025-03-17 12:18:35,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1066918981] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:18:35,942 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:18:35,942 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 12:18:35,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [723839749] [2025-03-17 12:18:35,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:18:35,949 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 12:18:35,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:18:35,949 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 12:18:35,949 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 12:18:35,949 INFO L87 Difference]: Start difference. First operand 65 states and 69 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:18:35,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:18:35,980 INFO L93 Difference]: Finished difference Result 63 states and 67 transitions. [2025-03-17 12:18:35,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 12:18:35,981 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2025-03-17 12:18:35,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:18:35,982 INFO L225 Difference]: With dead ends: 63 [2025-03-17 12:18:35,983 INFO L226 Difference]: Without dead ends: 63 [2025-03-17 12:18:35,983 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 12:18:35,984 INFO L435 NwaCegarLoop]: 63 mSDtfsCounter, 2 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 12:18:35,984 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 106 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 12:18:35,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2025-03-17 12:18:35,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2025-03-17 12:18:35,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 37 states have (on average 1.7027027027027026) internal successors, (63), 59 states have internal predecessors, (63), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-17 12:18:35,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 67 transitions. [2025-03-17 12:18:35,989 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 67 transitions. Word has length 6 [2025-03-17 12:18:35,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:18:35,990 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 67 transitions. [2025-03-17 12:18:35,990 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:18:35,990 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 67 transitions. [2025-03-17 12:18:35,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-03-17 12:18:35,990 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:18:35,990 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:18:35,990 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 12:18:35,990 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 24 more)] === [2025-03-17 12:18:35,991 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:18:35,991 INFO L85 PathProgramCache]: Analyzing trace with hash -308010569, now seen corresponding path program 1 times [2025-03-17 12:18:35,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:18:35,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1507028180] [2025-03-17 12:18:35,991 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:18:35,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:18:36,004 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-17 12:18:36,019 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-17 12:18:36,019 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:18:36,019 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:18:36,111 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:18:36,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:18:36,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1507028180] [2025-03-17 12:18:36,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1507028180] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:18:36,111 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:18:36,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 12:18:36,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1494237342] [2025-03-17 12:18:36,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:18:36,112 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 12:18:36,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:18:36,112 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 12:18:36,112 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 12:18:36,112 INFO L87 Difference]: Start difference. First operand 63 states and 67 transitions. Second operand has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 12:18:36,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:18:36,220 INFO L93 Difference]: Finished difference Result 62 states and 66 transitions. [2025-03-17 12:18:36,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 12:18:36,221 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2025-03-17 12:18:36,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:18:36,221 INFO L225 Difference]: With dead ends: 62 [2025-03-17 12:18:36,221 INFO L226 Difference]: Without dead ends: 62 [2025-03-17 12:18:36,222 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 12:18:36,222 INFO L435 NwaCegarLoop]: 58 mSDtfsCounter, 2 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 191 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 12:18:36,222 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 191 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 12:18:36,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2025-03-17 12:18:36,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2025-03-17 12:18:36,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 37 states have (on average 1.6756756756756757) internal successors, (62), 58 states have internal predecessors, (62), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-17 12:18:36,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 66 transitions. [2025-03-17 12:18:36,226 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 66 transitions. Word has length 12 [2025-03-17 12:18:36,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:18:36,227 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 66 transitions. [2025-03-17 12:18:36,227 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 12:18:36,227 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 66 transitions. [2025-03-17 12:18:36,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-03-17 12:18:36,228 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:18:36,228 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:18:36,228 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 12:18:36,228 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 24 more)] === [2025-03-17 12:18:36,228 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:18:36,229 INFO L85 PathProgramCache]: Analyzing trace with hash -308010568, now seen corresponding path program 1 times [2025-03-17 12:18:36,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:18:36,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1445260757] [2025-03-17 12:18:36,229 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:18:36,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:18:36,245 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-17 12:18:36,256 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-17 12:18:36,256 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:18:36,256 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:18:36,382 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:18:36,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:18:36,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1445260757] [2025-03-17 12:18:36,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1445260757] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:18:36,382 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:18:36,382 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 12:18:36,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382764911] [2025-03-17 12:18:36,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:18:36,382 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 12:18:36,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:18:36,383 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 12:18:36,383 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 12:18:36,383 INFO L87 Difference]: Start difference. First operand 62 states and 66 transitions. Second operand has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 12:18:36,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:18:36,464 INFO L93 Difference]: Finished difference Result 61 states and 65 transitions. [2025-03-17 12:18:36,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 12:18:36,465 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2025-03-17 12:18:36,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:18:36,465 INFO L225 Difference]: With dead ends: 61 [2025-03-17 12:18:36,465 INFO L226 Difference]: Without dead ends: 61 [2025-03-17 12:18:36,466 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 12:18:36,466 INFO L435 NwaCegarLoop]: 58 mSDtfsCounter, 1 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 207 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 12:18:36,466 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 207 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 12:18:36,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2025-03-17 12:18:36,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2025-03-17 12:18:36,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 37 states have (on average 1.6486486486486487) internal successors, (61), 57 states have internal predecessors, (61), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-17 12:18:36,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 65 transitions. [2025-03-17 12:18:36,470 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 65 transitions. Word has length 12 [2025-03-17 12:18:36,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:18:36,471 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 65 transitions. [2025-03-17 12:18:36,471 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 12:18:36,471 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 65 transitions. [2025-03-17 12:18:36,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-03-17 12:18:36,471 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:18:36,471 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:18:36,471 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 12:18:36,471 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 24 more)] === [2025-03-17 12:18:36,471 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:18:36,472 INFO L85 PathProgramCache]: Analyzing trace with hash -221228080, now seen corresponding path program 1 times [2025-03-17 12:18:36,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:18:36,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [465774465] [2025-03-17 12:18:36,472 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:18:36,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:18:36,479 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-17 12:18:36,480 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-17 12:18:36,480 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:18:36,481 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:18:36,523 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:18:36,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:18:36,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [465774465] [2025-03-17 12:18:36,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [465774465] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:18:36,524 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:18:36,524 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 12:18:36,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [107962805] [2025-03-17 12:18:36,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:18:36,525 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 12:18:36,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:18:36,525 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 12:18:36,525 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 12:18:36,525 INFO L87 Difference]: Start difference. First operand 61 states and 65 transitions. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 12:18:36,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:18:36,534 INFO L93 Difference]: Finished difference Result 66 states and 71 transitions. [2025-03-17 12:18:36,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 12:18:36,536 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2025-03-17 12:18:36,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:18:36,536 INFO L225 Difference]: With dead ends: 66 [2025-03-17 12:18:36,536 INFO L226 Difference]: Without dead ends: 66 [2025-03-17 12:18:36,536 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-03-17 12:18:36,537 INFO L435 NwaCegarLoop]: 63 mSDtfsCounter, 3 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 12:18:36,537 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 124 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 12:18:36,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2025-03-17 12:18:36,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 62. [2025-03-17 12:18:36,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 38 states have (on average 1.631578947368421) internal successors, (62), 58 states have internal predecessors, (62), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-17 12:18:36,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 66 transitions. [2025-03-17 12:18:36,542 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 66 transitions. Word has length 12 [2025-03-17 12:18:36,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:18:36,542 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 66 transitions. [2025-03-17 12:18:36,542 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 12:18:36,542 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 66 transitions. [2025-03-17 12:18:36,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-03-17 12:18:36,543 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:18:36,543 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:18:36,543 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 12:18:36,543 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 24 more)] === [2025-03-17 12:18:36,544 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:18:36,544 INFO L85 PathProgramCache]: Analyzing trace with hash -619509652, now seen corresponding path program 1 times [2025-03-17 12:18:36,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:18:36,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [542627258] [2025-03-17 12:18:36,544 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:18:36,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:18:36,555 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-17 12:18:36,560 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-17 12:18:36,560 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:18:36,560 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:18:36,612 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-17 12:18:36,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:18:36,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [542627258] [2025-03-17 12:18:36,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [542627258] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:18:36,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [270631197] [2025-03-17 12:18:36,613 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:18:36,613 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:18:36,613 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 12:18:36,615 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 12:18:36,617 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-17 12:18:36,678 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-17 12:18:36,706 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-17 12:18:36,706 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:18:36,706 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:18:36,708 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-17 12:18:36,713 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 12:18:36,757 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:18:36,757 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 12:18:36,797 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-17 12:18:36,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [270631197] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 12:18:36,797 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 12:18:36,797 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2025-03-17 12:18:36,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1319750007] [2025-03-17 12:18:36,797 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 12:18:36,798 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 12:18:36,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:18:36,798 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 12:18:36,798 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-17 12:18:36,798 INFO L87 Difference]: Start difference. First operand 62 states and 66 transitions. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-17 12:18:36,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:18:36,809 INFO L93 Difference]: Finished difference Result 67 states and 72 transitions. [2025-03-17 12:18:36,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 12:18:36,809 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 24 [2025-03-17 12:18:36,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:18:36,810 INFO L225 Difference]: With dead ends: 67 [2025-03-17 12:18:36,810 INFO L226 Difference]: Without dead ends: 67 [2025-03-17 12:18:36,810 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 45 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-17 12:18:36,810 INFO L435 NwaCegarLoop]: 63 mSDtfsCounter, 3 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 12:18:36,810 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 181 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 12:18:36,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2025-03-17 12:18:36,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2025-03-17 12:18:36,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 42 states have (on average 1.5714285714285714) internal successors, (66), 62 states have internal predecessors, (66), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-17 12:18:36,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 72 transitions. [2025-03-17 12:18:36,815 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 72 transitions. Word has length 24 [2025-03-17 12:18:36,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:18:36,815 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 72 transitions. [2025-03-17 12:18:36,815 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-17 12:18:36,815 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 72 transitions. [2025-03-17 12:18:36,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-03-17 12:18:36,816 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:18:36,816 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2025-03-17 12:18:36,824 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-17 12:18:37,016 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2025-03-17 12:18:37,016 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 24 more)] === [2025-03-17 12:18:37,017 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:18:37,017 INFO L85 PathProgramCache]: Analyzing trace with hash -390089976, now seen corresponding path program 2 times [2025-03-17 12:18:37,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:18:37,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1462638551] [2025-03-17 12:18:37,017 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 12:18:37,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:18:37,031 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 36 statements into 2 equivalence classes. [2025-03-17 12:18:37,047 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 36 of 36 statements. [2025-03-17 12:18:37,048 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 12:18:37,048 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:18:37,491 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-17 12:18:37,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:18:37,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1462638551] [2025-03-17 12:18:37,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1462638551] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:18:37,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [653131899] [2025-03-17 12:18:37,491 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 12:18:37,492 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:18:37,492 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 12:18:37,493 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 12:18:37,495 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-17 12:18:37,559 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 36 statements into 2 equivalence classes. [2025-03-17 12:18:37,597 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 36 of 36 statements. [2025-03-17 12:18:37,597 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 12:18:37,597 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:18:37,599 INFO L256 TraceCheckSpWp]: Trace formula consists of 330 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-03-17 12:18:37,602 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 12:18:37,623 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-17 12:18:37,642 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2025-03-17 12:18:37,688 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-03-17 12:18:37,689 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2025-03-17 12:18:37,768 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2025-03-17 12:18:37,787 WARN L873 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| (select |c_#valid| |node_create_~temp~0#1.base|))))) is different from true [2025-03-17 12:18:37,834 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 12:18:37,836 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2025-03-17 12:18:37,881 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2025-03-17 12:18:37,935 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 12:18:37,935 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2025-03-17 12:18:37,939 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 12 not checked. [2025-03-17 12:18:37,940 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 12:18:38,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [653131899] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:18:38,005 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 12:18:38,005 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 16 [2025-03-17 12:18:38,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [650953222] [2025-03-17 12:18:38,006 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 12:18:38,006 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-17 12:18:38,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:18:38,006 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-17 12:18:38,006 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=257, Unknown=1, NotChecked=32, Total=342 [2025-03-17 12:18:38,007 INFO L87 Difference]: Start difference. First operand 67 states and 72 transitions. Second operand has 18 states, 16 states have (on average 2.625) internal successors, (42), 15 states have internal predecessors, (42), 3 states have call successors, (3), 1 states have call predecessors, (3), 5 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2025-03-17 12:18:38,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:18:38,299 INFO L93 Difference]: Finished difference Result 74 states and 80 transitions. [2025-03-17 12:18:38,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 12:18:38,300 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 2.625) internal successors, (42), 15 states have internal predecessors, (42), 3 states have call successors, (3), 1 states have call predecessors, (3), 5 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) Word has length 36 [2025-03-17 12:18:38,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:18:38,300 INFO L225 Difference]: With dead ends: 74 [2025-03-17 12:18:38,300 INFO L226 Difference]: Without dead ends: 74 [2025-03-17 12:18:38,301 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=77, Invalid=346, Unknown=1, NotChecked=38, Total=462 [2025-03-17 12:18:38,301 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 135 mSDsluCounter, 282 mSDsCounter, 0 mSdLazyCounter, 371 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 313 SdHoareTripleChecker+Invalid, 446 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 371 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 67 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 12:18:38,301 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 313 Invalid, 446 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 371 Invalid, 0 Unknown, 67 Unchecked, 0.2s Time] [2025-03-17 12:18:38,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2025-03-17 12:18:38,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 63. [2025-03-17 12:18:38,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 42 states have (on average 1.4761904761904763) internal successors, (62), 58 states have internal predecessors, (62), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-17 12:18:38,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 68 transitions. [2025-03-17 12:18:38,309 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 68 transitions. Word has length 36 [2025-03-17 12:18:38,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:18:38,309 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 68 transitions. [2025-03-17 12:18:38,309 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 2.625) internal successors, (42), 15 states have internal predecessors, (42), 3 states have call successors, (3), 1 states have call predecessors, (3), 5 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2025-03-17 12:18:38,309 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 68 transitions. [2025-03-17 12:18:38,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-03-17 12:18:38,310 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:18:38,310 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2025-03-17 12:18:38,318 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-17 12:18:38,510 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2025-03-17 12:18:38,510 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 24 more)] === [2025-03-17 12:18:38,511 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:18:38,511 INFO L85 PathProgramCache]: Analyzing trace with hash -390089975, now seen corresponding path program 1 times [2025-03-17 12:18:38,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:18:38,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [551207726] [2025-03-17 12:18:38,511 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:18:38,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:18:38,523 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-17 12:18:38,534 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-17 12:18:38,534 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:18:38,534 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:18:39,009 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-03-17 12:18:39,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:18:39,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [551207726] [2025-03-17 12:18:39,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [551207726] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:18:39,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1390372518] [2025-03-17 12:18:39,009 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:18:39,009 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:18:39,009 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 12:18:39,012 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 12:18:39,013 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-17 12:18:39,075 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-17 12:18:39,107 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-17 12:18:39,107 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:18:39,107 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:18:39,109 INFO L256 TraceCheckSpWp]: Trace formula consists of 330 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-03-17 12:18:39,111 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 12:18:39,118 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-03-17 12:18:39,131 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2025-03-17 12:18:39,164 WARN L873 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (= (store |c_old(#length)| |node_create_~temp~0#1.base| (select |c_#length| |node_create_~temp~0#1.base|)) |c_#length|))) is different from true [2025-03-17 12:18:39,195 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 12:18:39,195 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2025-03-17 12:18:39,218 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2025-03-17 12:18:39,248 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 12:18:39,249 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2025-03-17 12:18:39,275 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2025-03-17 12:18:39,305 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 12:18:39,306 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2025-03-17 12:18:39,311 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-03-17 12:18:39,311 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 12:18:39,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1390372518] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:18:39,311 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 12:18:39,311 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 11 [2025-03-17 12:18:39,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1028625015] [2025-03-17 12:18:39,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:18:39,311 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 12:18:39,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:18:39,312 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 12:18:39,312 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=103, Unknown=1, NotChecked=20, Total=156 [2025-03-17 12:18:39,312 INFO L87 Difference]: Start difference. First operand 63 states and 68 transitions. Second operand has 7 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-17 12:18:39,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:18:39,375 INFO L93 Difference]: Finished difference Result 61 states and 66 transitions. [2025-03-17 12:18:39,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 12:18:39,375 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 36 [2025-03-17 12:18:39,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:18:39,375 INFO L225 Difference]: With dead ends: 61 [2025-03-17 12:18:39,375 INFO L226 Difference]: Without dead ends: 61 [2025-03-17 12:18:39,376 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=122, Unknown=1, NotChecked=22, Total=182 [2025-03-17 12:18:39,376 INFO L435 NwaCegarLoop]: 48 mSDtfsCounter, 6 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 83 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 12:18:39,376 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 163 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 84 Invalid, 0 Unknown, 83 Unchecked, 0.0s Time] [2025-03-17 12:18:39,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2025-03-17 12:18:39,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2025-03-17 12:18:39,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 42 states have (on average 1.4285714285714286) internal successors, (60), 56 states have internal predecessors, (60), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-17 12:18:39,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 66 transitions. [2025-03-17 12:18:39,380 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 66 transitions. Word has length 36 [2025-03-17 12:18:39,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:18:39,380 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 66 transitions. [2025-03-17 12:18:39,380 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-17 12:18:39,380 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 66 transitions. [2025-03-17 12:18:39,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-03-17 12:18:39,381 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:18:39,381 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:18:39,387 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-17 12:18:39,581 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:18:39,582 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 24 more)] === [2025-03-17 12:18:39,582 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:18:39,582 INFO L85 PathProgramCache]: Analyzing trace with hash 792112655, now seen corresponding path program 1 times [2025-03-17 12:18:39,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:18:39,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1074491291] [2025-03-17 12:18:39,582 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:18:39,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:18:39,597 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-17 12:18:39,606 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-17 12:18:39,606 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:18:39,606 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:18:39,667 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-03-17 12:18:39,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:18:39,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1074491291] [2025-03-17 12:18:39,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1074491291] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:18:39,667 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:18:39,667 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 12:18:39,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [901876599] [2025-03-17 12:18:39,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:18:39,669 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 12:18:39,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:18:39,669 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 12:18:39,670 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 12:18:39,670 INFO L87 Difference]: Start difference. First operand 61 states and 66 transitions. Second operand has 6 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 12:18:39,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:18:39,730 INFO L93 Difference]: Finished difference Result 60 states and 65 transitions. [2025-03-17 12:18:39,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 12:18:39,730 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 37 [2025-03-17 12:18:39,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:18:39,731 INFO L225 Difference]: With dead ends: 60 [2025-03-17 12:18:39,731 INFO L226 Difference]: Without dead ends: 60 [2025-03-17 12:18:39,731 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 12:18:39,732 INFO L435 NwaCegarLoop]: 49 mSDtfsCounter, 3 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 12:18:39,732 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 171 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 12:18:39,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2025-03-17 12:18:39,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2025-03-17 12:18:39,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 42 states have (on average 1.4047619047619047) internal successors, (59), 55 states have internal predecessors, (59), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-17 12:18:39,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 65 transitions. [2025-03-17 12:18:39,739 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 65 transitions. Word has length 37 [2025-03-17 12:18:39,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:18:39,739 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 65 transitions. [2025-03-17 12:18:39,739 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 12:18:39,739 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 65 transitions. [2025-03-17 12:18:39,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-03-17 12:18:39,740 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:18:39,740 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:18:39,740 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-17 12:18:39,740 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 24 more)] === [2025-03-17 12:18:39,740 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:18:39,740 INFO L85 PathProgramCache]: Analyzing trace with hash 792112656, now seen corresponding path program 1 times [2025-03-17 12:18:39,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:18:39,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787350978] [2025-03-17 12:18:39,740 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:18:39,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:18:39,752 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-17 12:18:39,758 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-17 12:18:39,758 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:18:39,758 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:18:39,872 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-17 12:18:39,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:18:39,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1787350978] [2025-03-17 12:18:39,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1787350978] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:18:39,872 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:18:39,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 12:18:39,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [927824404] [2025-03-17 12:18:39,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:18:39,873 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 12:18:39,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:18:39,873 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 12:18:39,873 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-17 12:18:39,874 INFO L87 Difference]: Start difference. First operand 60 states and 65 transitions. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 12:18:39,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:18:39,935 INFO L93 Difference]: Finished difference Result 59 states and 64 transitions. [2025-03-17 12:18:39,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 12:18:39,935 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 37 [2025-03-17 12:18:39,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:18:39,936 INFO L225 Difference]: With dead ends: 59 [2025-03-17 12:18:39,936 INFO L226 Difference]: Without dead ends: 59 [2025-03-17 12:18:39,936 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-17 12:18:39,936 INFO L435 NwaCegarLoop]: 49 mSDtfsCounter, 3 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 227 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 12:18:39,936 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 227 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 12:18:39,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2025-03-17 12:18:39,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2025-03-17 12:18:39,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 42 states have (on average 1.380952380952381) internal successors, (58), 54 states have internal predecessors, (58), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-17 12:18:39,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 64 transitions. [2025-03-17 12:18:39,939 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 64 transitions. Word has length 37 [2025-03-17 12:18:39,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:18:39,939 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 64 transitions. [2025-03-17 12:18:39,939 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 12:18:39,939 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 64 transitions. [2025-03-17 12:18:39,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-03-17 12:18:39,940 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:18:39,940 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:18:39,940 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-17 12:18:39,940 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 24 more)] === [2025-03-17 12:18:39,940 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:18:39,940 INFO L85 PathProgramCache]: Analyzing trace with hash 957175882, now seen corresponding path program 1 times [2025-03-17 12:18:39,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:18:39,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1580157351] [2025-03-17 12:18:39,941 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:18:39,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:18:39,951 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-03-17 12:18:39,957 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-03-17 12:18:39,958 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:18:39,958 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:18:40,091 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-03-17 12:18:40,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:18:40,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1580157351] [2025-03-17 12:18:40,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1580157351] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:18:40,091 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:18:40,092 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 12:18:40,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1722135874] [2025-03-17 12:18:40,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:18:40,092 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 12:18:40,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:18:40,092 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 12:18:40,092 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-17 12:18:40,093 INFO L87 Difference]: Start difference. First operand 59 states and 64 transitions. Second operand has 7 states, 5 states have (on average 3.8) internal successors, (19), 7 states have internal predecessors, (19), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-17 12:18:40,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:18:40,134 INFO L93 Difference]: Finished difference Result 57 states and 62 transitions. [2025-03-17 12:18:40,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 12:18:40,135 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 3.8) internal successors, (19), 7 states have internal predecessors, (19), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 41 [2025-03-17 12:18:40,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:18:40,135 INFO L225 Difference]: With dead ends: 57 [2025-03-17 12:18:40,135 INFO L226 Difference]: Without dead ends: 57 [2025-03-17 12:18:40,135 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2025-03-17 12:18:40,136 INFO L435 NwaCegarLoop]: 45 mSDtfsCounter, 41 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 12:18:40,136 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 120 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 12:18:40,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2025-03-17 12:18:40,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2025-03-17 12:18:40,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 42 states have (on average 1.3333333333333333) internal successors, (56), 52 states have internal predecessors, (56), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-17 12:18:40,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 62 transitions. [2025-03-17 12:18:40,138 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 62 transitions. Word has length 41 [2025-03-17 12:18:40,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:18:40,139 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 62 transitions. [2025-03-17 12:18:40,139 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 3.8) internal successors, (19), 7 states have internal predecessors, (19), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-17 12:18:40,139 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 62 transitions. [2025-03-17 12:18:40,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-03-17 12:18:40,139 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:18:40,139 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:18:40,139 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-17 12:18:40,139 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 24 more)] === [2025-03-17 12:18:40,140 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:18:40,140 INFO L85 PathProgramCache]: Analyzing trace with hash 938806562, now seen corresponding path program 1 times [2025-03-17 12:18:40,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:18:40,140 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [501532740] [2025-03-17 12:18:40,140 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:18:40,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:18:40,151 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-17 12:18:40,156 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-17 12:18:40,157 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:18:40,157 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:18:40,318 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-03-17 12:18:40,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:18:40,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [501532740] [2025-03-17 12:18:40,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [501532740] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:18:40,318 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:18:40,318 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-17 12:18:40,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [412963313] [2025-03-17 12:18:40,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:18:40,319 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 12:18:40,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:18:40,319 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 12:18:40,319 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-03-17 12:18:40,319 INFO L87 Difference]: Start difference. First operand 57 states and 62 transitions. Second operand has 10 states, 8 states have (on average 3.25) internal successors, (26), 9 states have internal predecessors, (26), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-17 12:18:40,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:18:40,438 INFO L93 Difference]: Finished difference Result 58 states and 65 transitions. [2025-03-17 12:18:40,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 12:18:40,438 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 3.25) internal successors, (26), 9 states have internal predecessors, (26), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 44 [2025-03-17 12:18:40,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:18:40,439 INFO L225 Difference]: With dead ends: 58 [2025-03-17 12:18:40,439 INFO L226 Difference]: Without dead ends: 58 [2025-03-17 12:18:40,439 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2025-03-17 12:18:40,439 INFO L435 NwaCegarLoop]: 36 mSDtfsCounter, 24 mSDsluCounter, 187 mSDsCounter, 0 mSdLazyCounter, 223 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 223 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 12:18:40,439 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 223 Invalid, 226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 223 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 12:18:40,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2025-03-17 12:18:40,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2025-03-17 12:18:40,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 44 states have (on average 1.3409090909090908) internal successors, (59), 53 states have internal predecessors, (59), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-17 12:18:40,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 65 transitions. [2025-03-17 12:18:40,443 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 65 transitions. Word has length 44 [2025-03-17 12:18:40,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:18:40,444 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 65 transitions. [2025-03-17 12:18:40,444 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 3.25) internal successors, (26), 9 states have internal predecessors, (26), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-17 12:18:40,444 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 65 transitions. [2025-03-17 12:18:40,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-03-17 12:18:40,444 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:18:40,444 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:18:40,444 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-17 12:18:40,444 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 24 more)] === [2025-03-17 12:18:40,444 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:18:40,445 INFO L85 PathProgramCache]: Analyzing trace with hash 938806563, now seen corresponding path program 1 times [2025-03-17 12:18:40,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:18:40,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1485462571] [2025-03-17 12:18:40,445 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:18:40,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:18:40,457 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-17 12:18:40,465 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-17 12:18:40,465 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:18:40,465 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:18:40,744 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-17 12:18:40,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:18:40,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1485462571] [2025-03-17 12:18:40,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1485462571] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:18:40,744 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:18:40,744 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-17 12:18:40,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1390804770] [2025-03-17 12:18:40,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:18:40,745 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 12:18:40,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:18:40,746 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 12:18:40,746 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-03-17 12:18:40,746 INFO L87 Difference]: Start difference. First operand 58 states and 65 transitions. Second operand has 10 states, 8 states have (on average 3.5) internal successors, (28), 9 states have internal predecessors, (28), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-17 12:18:40,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:18:40,842 INFO L93 Difference]: Finished difference Result 60 states and 66 transitions. [2025-03-17 12:18:40,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 12:18:40,842 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 3.5) internal successors, (28), 9 states have internal predecessors, (28), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 44 [2025-03-17 12:18:40,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:18:40,842 INFO L225 Difference]: With dead ends: 60 [2025-03-17 12:18:40,842 INFO L226 Difference]: Without dead ends: 60 [2025-03-17 12:18:40,843 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2025-03-17 12:18:40,843 INFO L435 NwaCegarLoop]: 37 mSDtfsCounter, 24 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 204 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 12:18:40,843 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 204 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 12:18:40,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2025-03-17 12:18:40,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2025-03-17 12:18:40,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 46 states have (on average 1.3043478260869565) internal successors, (60), 55 states have internal predecessors, (60), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-17 12:18:40,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 66 transitions. [2025-03-17 12:18:40,845 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 66 transitions. Word has length 44 [2025-03-17 12:18:40,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:18:40,845 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 66 transitions. [2025-03-17 12:18:40,845 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 3.5) internal successors, (28), 9 states have internal predecessors, (28), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-17 12:18:40,845 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 66 transitions. [2025-03-17 12:18:40,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-03-17 12:18:40,849 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:18:40,849 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:18:40,849 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-17 12:18:40,849 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 24 more)] === [2025-03-17 12:18:40,849 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:18:40,849 INFO L85 PathProgramCache]: Analyzing trace with hash -840168078, now seen corresponding path program 1 times [2025-03-17 12:18:40,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:18:40,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [893595826] [2025-03-17 12:18:40,849 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:18:40,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:18:40,861 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-17 12:18:40,869 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-17 12:18:40,869 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:18:40,869 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:18:41,036 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-17 12:18:41,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:18:41,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [893595826] [2025-03-17 12:18:41,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [893595826] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:18:41,037 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:18:41,037 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-17 12:18:41,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2140254442] [2025-03-17 12:18:41,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:18:41,037 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 12:18:41,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:18:41,037 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 12:18:41,037 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-03-17 12:18:41,037 INFO L87 Difference]: Start difference. First operand 60 states and 66 transitions. Second operand has 10 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 9 states have internal predecessors, (31), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-17 12:18:41,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:18:41,116 INFO L93 Difference]: Finished difference Result 60 states and 65 transitions. [2025-03-17 12:18:41,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 12:18:41,117 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 9 states have internal predecessors, (31), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 47 [2025-03-17 12:18:41,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:18:41,117 INFO L225 Difference]: With dead ends: 60 [2025-03-17 12:18:41,118 INFO L226 Difference]: Without dead ends: 60 [2025-03-17 12:18:41,118 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2025-03-17 12:18:41,118 INFO L435 NwaCegarLoop]: 40 mSDtfsCounter, 24 mSDsluCounter, 277 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 317 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 12:18:41,119 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 317 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 12:18:41,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2025-03-17 12:18:41,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2025-03-17 12:18:41,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 46 states have (on average 1.2826086956521738) internal successors, (59), 55 states have internal predecessors, (59), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-17 12:18:41,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 65 transitions. [2025-03-17 12:18:41,121 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 65 transitions. Word has length 47 [2025-03-17 12:18:41,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:18:41,122 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 65 transitions. [2025-03-17 12:18:41,122 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 9 states have internal predecessors, (31), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-17 12:18:41,122 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 65 transitions. [2025-03-17 12:18:41,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-03-17 12:18:41,123 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:18:41,123 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:18:41,123 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-17 12:18:41,123 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 24 more)] === [2025-03-17 12:18:41,124 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:18:41,124 INFO L85 PathProgramCache]: Analyzing trace with hash -492639614, now seen corresponding path program 1 times [2025-03-17 12:18:41,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:18:41,124 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2132186690] [2025-03-17 12:18:41,124 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:18:41,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:18:41,136 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-17 12:18:41,144 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-17 12:18:41,144 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:18:41,144 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:18:41,918 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 21 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-17 12:18:41,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:18:41,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2132186690] [2025-03-17 12:18:41,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2132186690] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:18:41,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1281942374] [2025-03-17 12:18:41,918 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:18:41,918 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:18:41,918 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 12:18:41,920 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 12:18:41,922 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-17 12:18:42,001 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-17 12:18:42,039 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-17 12:18:42,040 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:18:42,040 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:18:42,042 INFO L256 TraceCheckSpWp]: Trace formula consists of 414 conjuncts, 59 conjuncts are in the unsatisfiable core [2025-03-17 12:18:42,045 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 12:18:42,076 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-17 12:18:42,187 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2025-03-17 12:18:42,252 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2025-03-17 12:18:42,253 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 21 [2025-03-17 12:18:42,386 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 17 treesize of output 13 [2025-03-17 12:18:42,466 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 12:18:42,467 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 12:18:42,467 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 23 [2025-03-17 12:18:42,471 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-17 12:18:42,547 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 12:18:42,547 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 24 [2025-03-17 12:18:42,551 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 12:18:42,553 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 12:18:42,553 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 18 [2025-03-17 12:18:42,616 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 21 treesize of output 9 [2025-03-17 12:18:42,673 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 19 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-17 12:18:42,674 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 12:18:42,795 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 68 treesize of output 64 [2025-03-17 12:18:48,847 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 36 [2025-03-17 12:18:49,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1281942374] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:18:49,217 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 12:18:49,217 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 21] total 37 [2025-03-17 12:18:49,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [742506109] [2025-03-17 12:18:49,217 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 12:18:49,217 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2025-03-17 12:18:49,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:18:49,217 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2025-03-17 12:18:49,218 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=2006, Unknown=1, NotChecked=0, Total=2162 [2025-03-17 12:18:49,218 INFO L87 Difference]: Start difference. First operand 60 states and 65 transitions. Second operand has 38 states, 35 states have (on average 2.0) internal successors, (70), 33 states have internal predecessors, (70), 4 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2025-03-17 12:18:50,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:18:50,113 INFO L93 Difference]: Finished difference Result 67 states and 74 transitions. [2025-03-17 12:18:50,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-03-17 12:18:50,113 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 35 states have (on average 2.0) internal successors, (70), 33 states have internal predecessors, (70), 4 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 49 [2025-03-17 12:18:50,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:18:50,114 INFO L225 Difference]: With dead ends: 67 [2025-03-17 12:18:50,114 INFO L226 Difference]: Without dead ends: 67 [2025-03-17 12:18:50,115 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 684 ImplicationChecksByTransitivity, 7.4s TimeCoverageRelationStatistics Valid=318, Invalid=3463, Unknown=1, NotChecked=0, Total=3782 [2025-03-17 12:18:50,115 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 118 mSDsluCounter, 456 mSDsCounter, 0 mSdLazyCounter, 903 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 486 SdHoareTripleChecker+Invalid, 911 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 903 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-17 12:18:50,115 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 486 Invalid, 911 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 903 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-17 12:18:50,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2025-03-17 12:18:50,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 63. [2025-03-17 12:18:50,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 49 states have (on average 1.3265306122448979) internal successors, (65), 58 states have internal predecessors, (65), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-17 12:18:50,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 71 transitions. [2025-03-17 12:18:50,118 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 71 transitions. Word has length 49 [2025-03-17 12:18:50,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:18:50,121 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 71 transitions. [2025-03-17 12:18:50,122 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 35 states have (on average 2.0) internal successors, (70), 33 states have internal predecessors, (70), 4 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2025-03-17 12:18:50,122 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 71 transitions. [2025-03-17 12:18:50,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-03-17 12:18:50,122 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:18:50,122 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:18:50,130 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-17 12:18:50,322 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-03-17 12:18:50,323 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 24 more)] === [2025-03-17 12:18:50,323 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:18:50,323 INFO L85 PathProgramCache]: Analyzing trace with hash -492639613, now seen corresponding path program 1 times [2025-03-17 12:18:50,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:18:50,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1835815256] [2025-03-17 12:18:50,323 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:18:50,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:18:50,335 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-17 12:18:50,354 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-17 12:18:50,354 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:18:50,354 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:18:51,290 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 23 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-17 12:18:51,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:18:51,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1835815256] [2025-03-17 12:18:51,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1835815256] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:18:51,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1851224108] [2025-03-17 12:18:51,291 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:18:51,291 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:18:51,291 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 12:18:51,293 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 12:18:51,295 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-17 12:18:51,386 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-17 12:18:51,425 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-17 12:18:51,425 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:18:51,425 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:18:51,427 INFO L256 TraceCheckSpWp]: Trace formula consists of 414 conjuncts, 81 conjuncts are in the unsatisfiable core [2025-03-17 12:18:51,434 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 12:18:51,691 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 9 [2025-03-17 12:18:51,702 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2025-03-17 12:18:51,894 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2025-03-17 12:18:51,894 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 27 [2025-03-17 12:18:51,913 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2025-03-17 12:18:51,913 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2025-03-17 12:18:52,142 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2025-03-17 12:18:52,151 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2025-03-17 12:18:52,249 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 12:18:52,280 INFO L349 Elim1Store]: treesize reduction 20, result has 58.3 percent of original size [2025-03-17 12:18:52,280 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 66 treesize of output 62 [2025-03-17 12:18:52,291 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 12:18:52,295 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 47 [2025-03-17 12:18:52,564 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 82 treesize of output 58 [2025-03-17 12:18:52,566 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 62 treesize of output 42 [2025-03-17 12:18:52,656 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 39 treesize of output 21 [2025-03-17 12:18:52,660 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 14 [2025-03-17 12:18:52,767 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 19 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-17 12:18:52,767 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 12:18:53,065 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 106 treesize of output 76 [2025-03-17 12:18:53,076 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 12:18:53,078 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 158 treesize of output 128 [2025-03-17 12:18:53,080 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 12:18:53,081 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 190 treesize of output 130 [2025-03-17 12:18:53,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1851224108] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:18:53,414 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 12:18:53,414 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 22] total 42 [2025-03-17 12:18:53,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [845894218] [2025-03-17 12:18:53,414 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 12:18:53,414 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2025-03-17 12:18:53,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:18:53,415 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2025-03-17 12:18:53,415 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=2606, Unknown=0, NotChecked=0, Total=2756 [2025-03-17 12:18:53,415 INFO L87 Difference]: Start difference. First operand 63 states and 71 transitions. Second operand has 43 states, 40 states have (on average 1.95) internal successors, (78), 37 states have internal predecessors, (78), 4 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2025-03-17 12:18:54,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:18:54,783 INFO L93 Difference]: Finished difference Result 76 states and 81 transitions. [2025-03-17 12:18:54,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-03-17 12:18:54,784 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 40 states have (on average 1.95) internal successors, (78), 37 states have internal predecessors, (78), 4 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 49 [2025-03-17 12:18:54,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:18:54,784 INFO L225 Difference]: With dead ends: 76 [2025-03-17 12:18:54,784 INFO L226 Difference]: Without dead ends: 76 [2025-03-17 12:18:54,785 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 871 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=322, Invalid=5080, Unknown=0, NotChecked=0, Total=5402 [2025-03-17 12:18:54,785 INFO L435 NwaCegarLoop]: 33 mSDtfsCounter, 120 mSDsluCounter, 831 mSDsCounter, 0 mSdLazyCounter, 1365 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 864 SdHoareTripleChecker+Invalid, 1368 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1365 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-17 12:18:54,786 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 864 Invalid, 1368 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1365 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-17 12:18:54,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2025-03-17 12:18:54,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 72. [2025-03-17 12:18:54,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 57 states have (on average 1.263157894736842) internal successors, (72), 66 states have internal predecessors, (72), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-17 12:18:54,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 78 transitions. [2025-03-17 12:18:54,788 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 78 transitions. Word has length 49 [2025-03-17 12:18:54,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:18:54,788 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 78 transitions. [2025-03-17 12:18:54,788 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 40 states have (on average 1.95) internal successors, (78), 37 states have internal predecessors, (78), 4 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2025-03-17 12:18:54,788 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 78 transitions. [2025-03-17 12:18:54,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-03-17 12:18:54,789 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:18:54,789 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:18:54,795 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-17 12:18:54,989 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-03-17 12:18:54,989 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 24 more)] === [2025-03-17 12:18:54,990 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:18:54,990 INFO L85 PathProgramCache]: Analyzing trace with hash 1907948869, now seen corresponding path program 1 times [2025-03-17 12:18:54,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:18:54,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [770523564] [2025-03-17 12:18:54,990 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:18:54,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:18:55,000 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-17 12:18:55,005 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-17 12:18:55,006 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:18:55,006 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:18:55,297 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-17 12:18:55,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:18:55,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [770523564] [2025-03-17 12:18:55,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [770523564] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:18:55,298 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:18:55,298 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-17 12:18:55,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1170871914] [2025-03-17 12:18:55,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:18:55,298 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-17 12:18:55,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:18:55,299 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-17 12:18:55,299 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-03-17 12:18:55,299 INFO L87 Difference]: Start difference. First operand 72 states and 78 transitions. Second operand has 12 states, 11 states have (on average 3.090909090909091) internal successors, (34), 11 states have internal predecessors, (34), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-17 12:18:55,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:18:55,444 INFO L93 Difference]: Finished difference Result 76 states and 80 transitions. [2025-03-17 12:18:55,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-17 12:18:55,445 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.090909090909091) internal successors, (34), 11 states have internal predecessors, (34), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 50 [2025-03-17 12:18:55,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:18:55,445 INFO L225 Difference]: With dead ends: 76 [2025-03-17 12:18:55,445 INFO L226 Difference]: Without dead ends: 76 [2025-03-17 12:18:55,445 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=231, Unknown=0, NotChecked=0, Total=272 [2025-03-17 12:18:55,446 INFO L435 NwaCegarLoop]: 36 mSDtfsCounter, 25 mSDsluCounter, 308 mSDsCounter, 0 mSdLazyCounter, 216 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 344 SdHoareTripleChecker+Invalid, 216 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 216 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 12:18:55,446 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 344 Invalid, 216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 216 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 12:18:55,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2025-03-17 12:18:55,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 72. [2025-03-17 12:18:55,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 57 states have (on average 1.2456140350877194) internal successors, (71), 66 states have internal predecessors, (71), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-17 12:18:55,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 77 transitions. [2025-03-17 12:18:55,451 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 77 transitions. Word has length 50 [2025-03-17 12:18:55,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:18:55,451 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 77 transitions. [2025-03-17 12:18:55,451 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.090909090909091) internal successors, (34), 11 states have internal predecessors, (34), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-17 12:18:55,451 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 77 transitions. [2025-03-17 12:18:55,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-03-17 12:18:55,452 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:18:55,452 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:18:55,453 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-17 12:18:55,453 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 24 more)] === [2025-03-17 12:18:55,453 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:18:55,453 INFO L85 PathProgramCache]: Analyzing trace with hash -322915310, now seen corresponding path program 1 times [2025-03-17 12:18:55,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:18:55,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1299839408] [2025-03-17 12:18:55,453 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:18:55,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:18:55,464 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-03-17 12:18:55,475 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-03-17 12:18:55,476 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:18:55,476 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:18:55,896 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 17 proven. 7 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-17 12:18:55,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:18:55,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1299839408] [2025-03-17 12:18:55,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1299839408] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:18:55,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [113266447] [2025-03-17 12:18:55,896 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:18:55,897 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:18:55,897 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 12:18:55,899 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 12:18:55,900 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-17 12:18:55,988 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-03-17 12:18:56,018 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-03-17 12:18:56,019 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:18:56,019 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:18:56,024 INFO L256 TraceCheckSpWp]: Trace formula consists of 420 conjuncts, 53 conjuncts are in the unsatisfiable core [2025-03-17 12:18:56,026 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 12:18:56,231 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 17 treesize of output 13 [2025-03-17 12:18:56,278 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 12:18:56,279 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 33 [2025-03-17 12:18:56,282 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-17 12:18:56,324 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 12:18:56,324 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 18 [2025-03-17 12:18:56,331 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 12:18:56,333 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 12:18:56,333 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 17 [2025-03-17 12:18:56,369 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 8 [2025-03-17 12:18:56,388 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 19 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-17 12:18:56,388 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 12:18:56,418 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 66 treesize of output 62 [2025-03-17 12:18:56,476 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 44 treesize of output 34 [2025-03-17 12:18:56,549 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 12:18:56,550 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 21 [2025-03-17 12:18:56,676 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 11 proven. 7 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-03-17 12:18:56,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [113266447] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 12:18:56,677 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 12:18:56,677 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 18, 17] total 40 [2025-03-17 12:18:56,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [858542650] [2025-03-17 12:18:56,677 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 12:18:56,677 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2025-03-17 12:18:56,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:18:56,678 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2025-03-17 12:18:56,678 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=1442, Unknown=0, NotChecked=0, Total=1560 [2025-03-17 12:18:56,678 INFO L87 Difference]: Start difference. First operand 72 states and 77 transitions. Second operand has 40 states, 39 states have (on average 2.128205128205128) internal successors, (83), 36 states have internal predecessors, (83), 5 states have call successors, (5), 2 states have call predecessors, (5), 4 states have return successors, (8), 8 states have call predecessors, (8), 5 states have call successors, (8) [2025-03-17 12:19:00,729 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-17 12:19:04,742 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-17 12:19:08,807 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-17 12:19:12,877 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-17 12:19:17,134 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-17 12:19:17,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:19:17,437 INFO L93 Difference]: Finished difference Result 72 states and 76 transitions. [2025-03-17 12:19:17,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-03-17 12:19:17,437 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 39 states have (on average 2.128205128205128) internal successors, (83), 36 states have internal predecessors, (83), 5 states have call successors, (5), 2 states have call predecessors, (5), 4 states have return successors, (8), 8 states have call predecessors, (8), 5 states have call successors, (8) Word has length 52 [2025-03-17 12:19:17,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:19:17,437 INFO L225 Difference]: With dead ends: 72 [2025-03-17 12:19:17,437 INFO L226 Difference]: Without dead ends: 72 [2025-03-17 12:19:17,438 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 83 SyntacticMatches, 2 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 534 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=292, Invalid=3130, Unknown=0, NotChecked=0, Total=3422 [2025-03-17 12:19:17,438 INFO L435 NwaCegarLoop]: 38 mSDtfsCounter, 64 mSDsluCounter, 855 mSDsCounter, 0 mSdLazyCounter, 784 mSolverCounterSat, 1 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 20.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 893 SdHoareTripleChecker+Invalid, 790 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 784 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 20.3s IncrementalHoareTripleChecker+Time [2025-03-17 12:19:17,439 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 893 Invalid, 790 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 784 Invalid, 5 Unknown, 0 Unchecked, 20.3s Time] [2025-03-17 12:19:17,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2025-03-17 12:19:17,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2025-03-17 12:19:17,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 57 states have (on average 1.2280701754385965) internal successors, (70), 66 states have internal predecessors, (70), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-17 12:19:17,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 76 transitions. [2025-03-17 12:19:17,441 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 76 transitions. Word has length 52 [2025-03-17 12:19:17,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:19:17,441 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 76 transitions. [2025-03-17 12:19:17,441 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 39 states have (on average 2.128205128205128) internal successors, (83), 36 states have internal predecessors, (83), 5 states have call successors, (5), 2 states have call predecessors, (5), 4 states have return successors, (8), 8 states have call predecessors, (8), 5 states have call successors, (8) [2025-03-17 12:19:17,441 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 76 transitions. [2025-03-17 12:19:17,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-03-17 12:19:17,441 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:19:17,441 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:19:17,448 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-17 12:19:17,642 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-03-17 12:19:17,642 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 24 more)] === [2025-03-17 12:19:17,642 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:19:17,642 INFO L85 PathProgramCache]: Analyzing trace with hash -1628935902, now seen corresponding path program 2 times [2025-03-17 12:19:17,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:19:17,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2062586115] [2025-03-17 12:19:17,642 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 12:19:17,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:19:17,654 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 54 statements into 2 equivalence classes. [2025-03-17 12:19:17,681 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 54 of 54 statements. [2025-03-17 12:19:17,681 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 12:19:17,681 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:19:19,125 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 16 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:19:19,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:19:19,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2062586115] [2025-03-17 12:19:19,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2062586115] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:19:19,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [524657167] [2025-03-17 12:19:19,125 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 12:19:19,125 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:19:19,125 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 12:19:19,127 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 12:19:19,128 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-17 12:19:19,223 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 54 statements into 2 equivalence classes. [2025-03-17 12:19:19,267 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 54 of 54 statements. [2025-03-17 12:19:19,267 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 12:19:19,267 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:19:19,270 INFO L256 TraceCheckSpWp]: Trace formula consists of 441 conjuncts, 114 conjuncts are in the unsatisfiable core [2025-03-17 12:19:19,277 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 12:19:19,452 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-03-17 12:19:19,453 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2025-03-17 12:19:19,518 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 19 treesize of output 1 [2025-03-17 12:19:19,635 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 19 treesize of output 5 [2025-03-17 12:19:19,643 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2025-03-17 12:19:19,643 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 7 [2025-03-17 12:19:19,718 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 12:19:19,718 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2025-03-17 12:19:19,738 INFO L349 Elim1Store]: treesize reduction 120, result has 31.4 percent of original size [2025-03-17 12:19:19,738 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 42 treesize of output 64 [2025-03-17 12:19:19,949 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2025-03-17 12:19:19,956 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 38 [2025-03-17 12:19:20,049 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 93 treesize of output 58 [2025-03-17 12:19:20,052 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 76 treesize of output 60 [2025-03-17 12:19:20,120 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 103 treesize of output 63 [2025-03-17 12:19:20,234 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 12:19:20,234 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 41 [2025-03-17 12:19:20,602 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2025-03-17 12:19:20,602 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 25 [2025-03-17 12:19:20,780 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 28 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:19:20,780 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 12:19:21,287 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 158 treesize of output 140 [2025-03-17 12:19:26,186 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 12:19:26,186 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 51 [2025-03-17 12:19:26,215 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 12:19:26,215 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 146 treesize of output 121 [2025-03-17 12:19:26,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [524657167] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:19:26,767 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 12:19:26,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 30] total 59 [2025-03-17 12:19:26,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [887980895] [2025-03-17 12:19:26,767 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 12:19:26,767 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 60 states [2025-03-17 12:19:26,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:19:26,768 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2025-03-17 12:19:26,769 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=239, Invalid=5016, Unknown=1, NotChecked=0, Total=5256 [2025-03-17 12:19:26,769 INFO L87 Difference]: Start difference. First operand 72 states and 76 transitions. Second operand has 60 states, 57 states have (on average 1.5789473684210527) internal successors, (90), 53 states have internal predecessors, (90), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-17 12:19:29,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:19:29,090 INFO L93 Difference]: Finished difference Result 82 states and 89 transitions. [2025-03-17 12:19:29,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2025-03-17 12:19:29,090 INFO L78 Accepts]: Start accepts. Automaton has has 60 states, 57 states have (on average 1.5789473684210527) internal successors, (90), 53 states have internal predecessors, (90), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 54 [2025-03-17 12:19:29,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:19:29,091 INFO L225 Difference]: With dead ends: 82 [2025-03-17 12:19:29,091 INFO L226 Difference]: Without dead ends: 82 [2025-03-17 12:19:29,092 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2153 ImplicationChecksByTransitivity, 8.5s TimeCoverageRelationStatistics Valid=546, Invalid=9155, Unknown=1, NotChecked=0, Total=9702 [2025-03-17 12:19:29,093 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 133 mSDsluCounter, 864 mSDsCounter, 0 mSdLazyCounter, 1965 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 896 SdHoareTripleChecker+Invalid, 1980 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 1965 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-17 12:19:29,093 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 896 Invalid, 1980 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 1965 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-17 12:19:29,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2025-03-17 12:19:29,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 75. [2025-03-17 12:19:29,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 60 states have (on average 1.2666666666666666) internal successors, (76), 69 states have internal predecessors, (76), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-17 12:19:29,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 82 transitions. [2025-03-17 12:19:29,095 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 82 transitions. Word has length 54 [2025-03-17 12:19:29,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:19:29,095 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 82 transitions. [2025-03-17 12:19:29,096 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 60 states, 57 states have (on average 1.5789473684210527) internal successors, (90), 53 states have internal predecessors, (90), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-17 12:19:29,096 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 82 transitions. [2025-03-17 12:19:29,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-03-17 12:19:29,096 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:19:29,096 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:19:29,103 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-17 12:19:29,296 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:19:29,297 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 24 more)] === [2025-03-17 12:19:29,297 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:19:29,297 INFO L85 PathProgramCache]: Analyzing trace with hash -1628935901, now seen corresponding path program 2 times [2025-03-17 12:19:29,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:19:29,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1396798223] [2025-03-17 12:19:29,297 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 12:19:29,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:19:29,307 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 54 statements into 2 equivalence classes. [2025-03-17 12:19:29,320 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 54 of 54 statements. [2025-03-17 12:19:29,320 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 12:19:29,320 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:19:31,016 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 10 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:19:31,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:19:31,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1396798223] [2025-03-17 12:19:31,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1396798223] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:19:31,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [356486285] [2025-03-17 12:19:31,016 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 12:19:31,017 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:19:31,017 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 12:19:31,018 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 12:19:31,019 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-17 12:19:31,115 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 54 statements into 2 equivalence classes. [2025-03-17 12:19:31,155 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 54 of 54 statements. [2025-03-17 12:19:31,155 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 12:19:31,155 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:19:31,157 INFO L256 TraceCheckSpWp]: Trace formula consists of 441 conjuncts, 141 conjuncts are in the unsatisfiable core [2025-03-17 12:19:31,160 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 12:19:31,192 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-03-17 12:19:31,522 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-03-17 12:19:31,522 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2025-03-17 12:19:31,527 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2025-03-17 12:19:31,625 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 13 treesize of output 9 [2025-03-17 12:19:31,634 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-03-17 12:19:31,838 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 61 treesize of output 19 [2025-03-17 12:19:31,842 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 3 [2025-03-17 12:19:31,845 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-03-17 12:19:31,847 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2025-03-17 12:19:32,053 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2025-03-17 12:19:32,053 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 29 [2025-03-17 12:19:32,059 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2025-03-17 12:19:32,063 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 12:19:32,064 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 52 [2025-03-17 12:19:32,076 INFO L349 Elim1Store]: treesize reduction 41, result has 47.4 percent of original size [2025-03-17 12:19:32,077 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 41 [2025-03-17 12:19:32,100 INFO L349 Elim1Store]: treesize reduction 8, result has 77.1 percent of original size [2025-03-17 12:19:32,100 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 36 [2025-03-17 12:19:32,350 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 32 [2025-03-17 12:19:32,364 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 46 [2025-03-17 12:19:32,490 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 12:19:32,491 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 12:19:32,491 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 123 treesize of output 80 [2025-03-17 12:19:32,494 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 12:19:32,495 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 127 treesize of output 103 [2025-03-17 12:19:32,616 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 12:19:32,616 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 140 treesize of output 88 [2025-03-17 12:19:33,164 INFO L349 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2025-03-17 12:19:33,164 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 102 treesize of output 37 [2025-03-17 12:19:33,167 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-03-17 12:19:33,306 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 6 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:19:33,306 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 12:19:35,417 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 12:19:35,417 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 270 treesize of output 246 [2025-03-17 12:19:35,422 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 12:19:35,422 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 235 treesize of output 218 [2025-03-17 12:19:35,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [356486285] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:19:35,780 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 12:19:35,781 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34] total 65 [2025-03-17 12:19:35,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1193366446] [2025-03-17 12:19:35,781 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 12:19:35,781 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 66 states [2025-03-17 12:19:35,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:19:35,781 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2025-03-17 12:19:35,782 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=230, Invalid=6250, Unknown=0, NotChecked=0, Total=6480 [2025-03-17 12:19:35,783 INFO L87 Difference]: Start difference. First operand 75 states and 82 transitions. Second operand has 66 states, 63 states have (on average 1.5238095238095237) internal successors, (96), 58 states have internal predecessors, (96), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-17 12:19:39,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:19:39,626 INFO L93 Difference]: Finished difference Result 84 states and 90 transitions. [2025-03-17 12:19:39,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2025-03-17 12:19:39,627 INFO L78 Accepts]: Start accepts. Automaton has has 66 states, 63 states have (on average 1.5238095238095237) internal successors, (96), 58 states have internal predecessors, (96), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 54 [2025-03-17 12:19:39,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:19:39,627 INFO L225 Difference]: With dead ends: 84 [2025-03-17 12:19:39,627 INFO L226 Difference]: Without dead ends: 84 [2025-03-17 12:19:39,629 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1817 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=525, Invalid=11247, Unknown=0, NotChecked=0, Total=11772 [2025-03-17 12:19:39,630 INFO L435 NwaCegarLoop]: 34 mSDtfsCounter, 147 mSDsluCounter, 1137 mSDsCounter, 0 mSdLazyCounter, 2399 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 1171 SdHoareTripleChecker+Invalid, 2412 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 2399 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-03-17 12:19:39,630 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 1171 Invalid, 2412 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 2399 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-03-17 12:19:39,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2025-03-17 12:19:39,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 77. [2025-03-17 12:19:39,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 62 states have (on average 1.2419354838709677) internal successors, (77), 71 states have internal predecessors, (77), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-17 12:19:39,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 83 transitions. [2025-03-17 12:19:39,631 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 83 transitions. Word has length 54 [2025-03-17 12:19:39,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:19:39,632 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 83 transitions. [2025-03-17 12:19:39,632 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 66 states, 63 states have (on average 1.5238095238095237) internal successors, (96), 58 states have internal predecessors, (96), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-17 12:19:39,632 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 83 transitions. [2025-03-17 12:19:39,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-03-17 12:19:39,632 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:19:39,632 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:19:39,639 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-03-17 12:19:39,832 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:19:39,833 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 24 more)] === [2025-03-17 12:19:39,833 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:19:39,833 INFO L85 PathProgramCache]: Analyzing trace with hash 1042502309, now seen corresponding path program 1 times [2025-03-17 12:19:39,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:19:39,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [39771790] [2025-03-17 12:19:39,833 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:19:39,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:19:39,844 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-17 12:19:39,850 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-17 12:19:39,850 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:19:39,850 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:19:40,897 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 14 proven. 16 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-17 12:19:40,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:19:40,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [39771790] [2025-03-17 12:19:40,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [39771790] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:19:40,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [536494671] [2025-03-17 12:19:40,897 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:19:40,898 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:19:40,898 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 12:19:40,899 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 12:19:40,900 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-17 12:19:41,005 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-17 12:19:41,036 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-17 12:19:41,036 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:19:41,036 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:19:41,038 INFO L256 TraceCheckSpWp]: Trace formula consists of 435 conjuncts, 96 conjuncts are in the unsatisfiable core [2025-03-17 12:19:41,040 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 12:19:41,090 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-03-17 12:19:41,218 INFO L349 Elim1Store]: treesize reduction 21, result has 38.2 percent of original size [2025-03-17 12:19:41,218 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 17 [2025-03-17 12:19:41,351 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2025-03-17 12:19:41,622 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2025-03-17 12:19:41,622 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 41 [2025-03-17 12:19:41,991 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 17 treesize of output 13 [2025-03-17 12:19:41,996 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 19 treesize of output 1 [2025-03-17 12:19:42,008 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2025-03-17 12:19:42,008 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 56 [2025-03-17 12:19:42,167 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 12:19:42,168 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 12:19:42,169 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 58 [2025-03-17 12:19:42,174 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 12:19:42,175 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 12:19:42,226 INFO L349 Elim1Store]: treesize reduction 52, result has 51.4 percent of original size [2025-03-17 12:19:42,227 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 7 case distinctions, treesize of input 130 treesize of output 145 [2025-03-17 12:19:42,603 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 12:19:42,604 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 146 treesize of output 166 [2025-03-17 12:19:42,637 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 12:19:42,638 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 122 treesize of output 134 [2025-03-17 12:19:43,533 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 74 treesize of output 56 [2025-03-17 12:19:43,535 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 62 treesize of output 38 [2025-03-17 12:19:43,907 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 14 proven. 16 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-17 12:19:43,907 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 12:19:44,539 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 116 treesize of output 86 [2025-03-17 12:19:44,553 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 102 treesize of output 72 [2025-03-17 12:19:46,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [536494671] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:19:46,448 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 12:19:46,448 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 51 [2025-03-17 12:19:46,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244912978] [2025-03-17 12:19:46,449 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 12:19:46,449 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2025-03-17 12:19:46,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:19:46,449 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2025-03-17 12:19:46,450 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=164, Invalid=3738, Unknown=4, NotChecked=0, Total=3906 [2025-03-17 12:19:46,450 INFO L87 Difference]: Start difference. First operand 77 states and 83 transitions. Second operand has 51 states, 49 states have (on average 1.7346938775510203) internal successors, (85), 45 states have internal predecessors, (85), 4 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2025-03-17 12:19:49,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:19:49,544 INFO L93 Difference]: Finished difference Result 81 states and 85 transitions. [2025-03-17 12:19:49,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2025-03-17 12:19:49,544 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 49 states have (on average 1.7346938775510203) internal successors, (85), 45 states have internal predecessors, (85), 4 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 55 [2025-03-17 12:19:49,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:19:49,545 INFO L225 Difference]: With dead ends: 81 [2025-03-17 12:19:49,545 INFO L226 Difference]: Without dead ends: 81 [2025-03-17 12:19:49,546 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 952 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=377, Invalid=7629, Unknown=4, NotChecked=0, Total=8010 [2025-03-17 12:19:49,546 INFO L435 NwaCegarLoop]: 34 mSDtfsCounter, 65 mSDsluCounter, 1246 mSDsCounter, 0 mSdLazyCounter, 1771 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 1280 SdHoareTripleChecker+Invalid, 1778 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1771 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-17 12:19:49,546 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 1280 Invalid, 1778 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1771 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-17 12:19:49,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2025-03-17 12:19:49,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 77. [2025-03-17 12:19:49,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 62 states have (on average 1.2258064516129032) internal successors, (76), 71 states have internal predecessors, (76), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-17 12:19:49,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 82 transitions. [2025-03-17 12:19:49,548 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 82 transitions. Word has length 55 [2025-03-17 12:19:49,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:19:49,549 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 82 transitions. [2025-03-17 12:19:49,549 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 49 states have (on average 1.7346938775510203) internal successors, (85), 45 states have internal predecessors, (85), 4 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2025-03-17 12:19:49,549 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 82 transitions. [2025-03-17 12:19:49,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-03-17 12:19:49,549 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:19:49,549 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:19:49,556 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-03-17 12:19:49,749 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:19:49,749 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 24 more)] === [2025-03-17 12:19:49,750 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:19:49,750 INFO L85 PathProgramCache]: Analyzing trace with hash 1206595954, now seen corresponding path program 2 times [2025-03-17 12:19:49,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:19:49,750 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [163499265] [2025-03-17 12:19:49,750 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 12:19:49,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:19:49,760 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 57 statements into 2 equivalence classes. [2025-03-17 12:19:49,772 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 57 of 57 statements. [2025-03-17 12:19:49,772 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 12:19:49,772 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:19:50,862 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 7 proven. 27 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 12:19:50,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:19:50,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [163499265] [2025-03-17 12:19:50,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [163499265] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:19:50,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [89699208] [2025-03-17 12:19:50,863 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 12:19:50,863 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:19:50,863 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 12:19:50,885 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 12:19:50,886 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-17 12:19:50,987 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 57 statements into 2 equivalence classes. [2025-03-17 12:19:51,023 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 57 of 57 statements. [2025-03-17 12:19:51,023 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 12:19:51,023 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:19:51,025 INFO L256 TraceCheckSpWp]: Trace formula consists of 447 conjuncts, 100 conjuncts are in the unsatisfiable core [2025-03-17 12:19:51,028 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 12:19:51,135 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-03-17 12:19:51,238 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 18 treesize of output 4 [2025-03-17 12:19:51,240 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2025-03-17 12:19:51,287 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2025-03-17 12:19:51,287 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2025-03-17 12:19:51,444 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 33 [2025-03-17 12:19:51,450 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2025-03-17 12:19:51,517 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 61 treesize of output 34 [2025-03-17 12:19:51,519 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 49 treesize of output 37 [2025-03-17 12:19:51,571 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 50 treesize of output 30 [2025-03-17 12:19:51,658 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 12:19:51,659 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 26 [2025-03-17 12:19:51,938 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2025-03-17 12:19:51,939 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 15 [2025-03-17 12:19:51,980 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 11 proven. 23 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 12:19:51,980 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 12:19:52,433 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 156 treesize of output 138 [2025-03-17 12:19:53,121 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 12:19:53,121 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 227 treesize of output 196 [2025-03-17 12:19:53,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [89699208] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:19:53,432 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 12:19:53,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 29] total 53 [2025-03-17 12:19:53,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [987579582] [2025-03-17 12:19:53,432 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 12:19:53,432 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2025-03-17 12:19:53,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:19:53,433 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2025-03-17 12:19:53,433 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=183, Invalid=3977, Unknown=0, NotChecked=0, Total=4160 [2025-03-17 12:19:53,433 INFO L87 Difference]: Start difference. First operand 77 states and 82 transitions. Second operand has 53 states, 51 states have (on average 1.6470588235294117) internal successors, (84), 47 states have internal predecessors, (84), 6 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-17 12:19:55,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:19:55,238 INFO L93 Difference]: Finished difference Result 78 states and 83 transitions. [2025-03-17 12:19:55,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2025-03-17 12:19:55,239 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 51 states have (on average 1.6470588235294117) internal successors, (84), 47 states have internal predecessors, (84), 6 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 57 [2025-03-17 12:19:55,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:19:55,240 INFO L225 Difference]: With dead ends: 78 [2025-03-17 12:19:55,240 INFO L226 Difference]: Without dead ends: 78 [2025-03-17 12:19:55,240 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 53 SyntacticMatches, 1 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1293 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=412, Invalid=7420, Unknown=0, NotChecked=0, Total=7832 [2025-03-17 12:19:55,241 INFO L435 NwaCegarLoop]: 37 mSDtfsCounter, 109 mSDsluCounter, 1156 mSDsCounter, 0 mSdLazyCounter, 1552 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 1193 SdHoareTripleChecker+Invalid, 1557 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1552 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-17 12:19:55,241 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 1193 Invalid, 1557 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1552 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-17 12:19:55,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2025-03-17 12:19:55,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 77. [2025-03-17 12:19:55,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 62 states have (on average 1.2096774193548387) internal successors, (75), 71 states have internal predecessors, (75), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-17 12:19:55,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 81 transitions. [2025-03-17 12:19:55,243 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 81 transitions. Word has length 57 [2025-03-17 12:19:55,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:19:55,243 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 81 transitions. [2025-03-17 12:19:55,243 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 51 states have (on average 1.6470588235294117) internal successors, (84), 47 states have internal predecessors, (84), 6 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-17 12:19:55,244 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 81 transitions. [2025-03-17 12:19:55,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2025-03-17 12:19:55,244 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:19:55,244 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:19:55,251 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-03-17 12:19:55,444 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2025-03-17 12:19:55,444 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 24 more)] === [2025-03-17 12:19:55,444 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:19:55,445 INFO L85 PathProgramCache]: Analyzing trace with hash -647426430, now seen corresponding path program 3 times [2025-03-17 12:19:55,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:19:55,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1409675056] [2025-03-17 12:19:55,445 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 12:19:55,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:19:55,456 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 59 statements into 4 equivalence classes. [2025-03-17 12:19:55,469 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 59 of 59 statements. [2025-03-17 12:19:55,469 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-03-17 12:19:55,469 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:19:58,048 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 9 proven. 39 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 12:19:58,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:19:58,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1409675056] [2025-03-17 12:19:58,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1409675056] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:19:58,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [531435467] [2025-03-17 12:19:58,048 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 12:19:58,048 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:19:58,048 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 12:19:58,050 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 12:19:58,051 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-17 12:19:58,163 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 59 statements into 4 equivalence classes. [2025-03-17 12:19:58,413 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 59 of 59 statements. [2025-03-17 12:19:58,413 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-03-17 12:19:58,413 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:19:58,417 INFO L256 TraceCheckSpWp]: Trace formula consists of 468 conjuncts, 169 conjuncts are in the unsatisfiable core [2025-03-17 12:19:58,424 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 12:19:58,483 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-17 12:19:58,592 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-03-17 12:19:58,596 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-03-17 12:19:58,881 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-03-17 12:19:58,882 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2025-03-17 12:19:58,893 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-03-17 12:19:58,898 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-03-17 12:19:59,024 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2025-03-17 12:19:59,030 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2025-03-17 12:19:59,241 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2025-03-17 12:19:59,241 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 27 [2025-03-17 12:19:59,244 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-03-17 12:19:59,246 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2025-03-17 12:19:59,599 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 12:19:59,608 INFO L349 Elim1Store]: treesize reduction 29, result has 14.7 percent of original size [2025-03-17 12:19:59,609 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 68 treesize of output 51 [2025-03-17 12:19:59,637 INFO L349 Elim1Store]: treesize reduction 48, result has 47.3 percent of original size [2025-03-17 12:19:59,637 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 53 [2025-03-17 12:19:59,660 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2025-03-17 12:19:59,660 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2025-03-17 12:20:00,047 INFO L349 Elim1Store]: treesize reduction 33, result has 17.5 percent of original size [2025-03-17 12:20:00,047 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 74 treesize of output 55 [2025-03-17 12:20:00,052 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 44 [2025-03-17 12:20:00,247 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 12:20:00,248 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 12:20:00,248 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 104 treesize of output 61 [2025-03-17 12:20:00,252 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 12:20:00,263 INFO L349 Elim1Store]: treesize reduction 37, result has 15.9 percent of original size [2025-03-17 12:20:00,263 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 41 treesize of output 32 [2025-03-17 12:20:00,436 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 12:20:00,437 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 116 treesize of output 80 [2025-03-17 12:20:01,488 INFO L349 Elim1Store]: treesize reduction 44, result has 22.8 percent of original size [2025-03-17 12:20:01,488 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 115 treesize of output 63 [2025-03-17 12:20:01,494 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 12:20:01,494 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 24 [2025-03-17 12:20:01,632 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 12 proven. 37 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:20:01,632 INFO L312 TraceCheckSpWp]: Computing backward predicates...