./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/list-simple/sll2c_insert_unequal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 48c9605d Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/list-simple/sll2c_insert_unequal.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-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 b7b415e0519ab150e9247d3d9d0133f92cfd07c34f9918f9ebd19cf8109bf4e7 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 06:42:43,573 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 06:42:43,625 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-02-08 06:42:43,628 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 06:42:43,628 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 06:42:43,648 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 06:42:43,649 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 06:42:43,649 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 06:42:43,650 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 06:42:43,650 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 06:42:43,650 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 06:42:43,650 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 06:42:43,651 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 06:42:43,651 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 06:42:43,651 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 06:42:43,652 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 06:42:43,652 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 06:42:43,652 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 06:42:43,652 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 06:42:43,652 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 06:42:43,652 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-02-08 06:42:43,652 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-02-08 06:42:43,652 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-02-08 06:42:43,652 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 06:42:43,652 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-08 06:42:43,652 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 06:42:43,652 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 06:42:43,652 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 06:42:43,652 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 06:42:43,653 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 06:42:43,653 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 06:42:43,653 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 06:42:43,653 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 06:42:43,653 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 06:42:43,653 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 06:42:43,653 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 06:42:43,653 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 06:42:43,654 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 06:42:43,654 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 06:42:43,654 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 06:42:43,654 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 06:42:43,654 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 06:42:43,654 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-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 -> b7b415e0519ab150e9247d3d9d0133f92cfd07c34f9918f9ebd19cf8109bf4e7 [2025-02-08 06:42:43,901 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 06:42:43,908 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 06:42:43,910 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 06:42:43,911 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 06:42:43,911 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 06:42:43,913 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-simple/sll2c_insert_unequal.i [2025-02-08 06:42:45,102 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f0c1403a1/76c054d7c07b44529c1f87cbd987e48d/FLAG13e407820 [2025-02-08 06:42:45,360 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 06:42:45,361 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/list-simple/sll2c_insert_unequal.i [2025-02-08 06:42:45,369 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f0c1403a1/76c054d7c07b44529c1f87cbd987e48d/FLAG13e407820 [2025-02-08 06:42:45,649 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f0c1403a1/76c054d7c07b44529c1f87cbd987e48d [2025-02-08 06:42:45,650 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 06:42:45,651 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 06:42:45,652 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 06:42:45,652 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 06:42:45,655 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 06:42:45,656 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 06:42:45" (1/1) ... [2025-02-08 06:42:45,656 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@51f1b3f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:42:45, skipping insertion in model container [2025-02-08 06:42:45,657 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 06:42:45" (1/1) ... [2025-02-08 06:42:45,679 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 06:42:45,845 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 06:42:45,851 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 06:42:45,878 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 06:42:45,896 INFO L204 MainTranslator]: Completed translation [2025-02-08 06:42:45,896 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:42:45 WrapperNode [2025-02-08 06:42:45,896 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 06:42:45,897 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 06:42:45,897 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 06:42:45,897 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 06:42:45,901 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:42:45" (1/1) ... [2025-02-08 06:42:45,910 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:42:45" (1/1) ... [2025-02-08 06:42:45,931 INFO L138 Inliner]: procedures = 127, calls = 49, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 171 [2025-02-08 06:42:45,931 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 06:42:45,933 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 06:42:45,933 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 06:42:45,934 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 06:42:45,940 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:42:45" (1/1) ... [2025-02-08 06:42:45,940 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:42:45" (1/1) ... [2025-02-08 06:42:45,946 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:42:45" (1/1) ... [2025-02-08 06:42:45,968 INFO L175 MemorySlicer]: Split 30 memory accesses to 3 slices as follows [2, 18, 10]. 60 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 0, 1]. The 10 writes are split as follows [0, 9, 1]. [2025-02-08 06:42:45,971 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:42:45" (1/1) ... [2025-02-08 06:42:45,971 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:42:45" (1/1) ... [2025-02-08 06:42:45,980 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:42:45" (1/1) ... [2025-02-08 06:42:45,985 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:42:45" (1/1) ... [2025-02-08 06:42:45,986 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:42:45" (1/1) ... [2025-02-08 06:42:45,991 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:42:45" (1/1) ... [2025-02-08 06:42:45,993 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 06:42:45,994 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 06:42:45,994 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 06:42:45,994 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 06:42:45,994 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:42:45" (1/1) ... [2025-02-08 06:42:46,002 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 06:42:46,018 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:42:46,031 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-08 06:42:46,038 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-08 06:42:46,065 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-08 06:42:46,065 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-08 06:42:46,065 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-08 06:42:46,065 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-08 06:42:46,065 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-08 06:42:46,065 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-08 06:42:46,065 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2025-02-08 06:42:46,065 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2025-02-08 06:42:46,065 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-08 06:42:46,065 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 06:42:46,065 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-08 06:42:46,065 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-02-08 06:42:46,065 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-02-08 06:42:46,065 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-02-08 06:42:46,065 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-02-08 06:42:46,065 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-02-08 06:42:46,065 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-02-08 06:42:46,066 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-08 06:42:46,066 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-02-08 06:42:46,066 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-02-08 06:42:46,066 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-02-08 06:42:46,066 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-08 06:42:46,066 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-08 06:42:46,066 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-08 06:42:46,066 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 06:42:46,066 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 06:42:46,182 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 06:42:46,185 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 06:42:46,506 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L631: 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-02-08 06:42:46,506 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L12: assume false; [2025-02-08 06:42:46,507 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L12: assume !false; [2025-02-08 06:42:46,507 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L12-1: assume false; [2025-02-08 06:42:46,507 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L12-1: assume !false; [2025-02-08 06:42:46,507 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L661: havoc reach_error_#t~nondet0#1.base, reach_error_#t~nondet0#1.offset;assume { :end_inline_reach_error } true;assume false;main_#res#1 := 1;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-02-08 06:42:46,507 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L661-1: assume { :begin_inline_reach_error } true;havoc reach_error_#t~nondet0#1.base, reach_error_#t~nondet0#1.offset; [2025-02-08 06:42:46,530 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L577: havoc myexit_~s#1;havoc myexit_#in~s#1;assume { :end_inline_myexit } true; [2025-02-08 06:42:46,551 INFO L? ?]: Removed 159 outVars from TransFormulas that were not future-live. [2025-02-08 06:42:46,551 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 06:42:46,563 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 06:42:46,564 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 06:42:46,565 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 06:42:46 BoogieIcfgContainer [2025-02-08 06:42:46,565 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 06:42:46,566 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 06:42:46,567 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 06:42:46,570 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 06:42:46,570 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 06:42:45" (1/3) ... [2025-02-08 06:42:46,571 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59703996 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 06:42:46, skipping insertion in model container [2025-02-08 06:42:46,572 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:42:45" (2/3) ... [2025-02-08 06:42:46,573 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59703996 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 06:42:46, skipping insertion in model container [2025-02-08 06:42:46,573 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 06:42:46" (3/3) ... [2025-02-08 06:42:46,573 INFO L128 eAbstractionObserver]: Analyzing ICFG sll2c_insert_unequal.i [2025-02-08 06:42:46,583 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 06:42:46,584 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG sll2c_insert_unequal.i that has 2 procedures, 140 locations, 1 initial locations, 5 loop locations, and 62 error locations. [2025-02-08 06:42:46,612 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 06:42:46,619 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;@7dac41bb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 06:42:46,619 INFO L334 AbstractCegarLoop]: Starting to check reachability of 62 error locations. [2025-02-08 06:42:46,622 INFO L276 IsEmpty]: Start isEmpty. Operand has 140 states, 72 states have (on average 2.0555555555555554) internal successors, (148), 135 states have internal predecessors, (148), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 06:42:46,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-02-08 06:42:46,625 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:42:46,625 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-02-08 06:42:46,626 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting node_createErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 59 more)] === [2025-02-08 06:42:46,629 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:42:46,629 INFO L85 PathProgramCache]: Analyzing trace with hash 173308107, now seen corresponding path program 1 times [2025-02-08 06:42:46,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:42:46,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1311948737] [2025-02-08 06:42:46,635 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:42:46,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:42:46,690 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-08 06:42:46,700 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-08 06:42:46,701 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:42:46,701 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:42:46,776 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:42:46,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:42:46,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1311948737] [2025-02-08 06:42:46,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1311948737] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:42:46,777 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:42:46,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 06:42:46,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1671853786] [2025-02-08 06:42:46,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:42:46,782 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 06:42:46,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:42:46,801 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 06:42:46,801 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 06:42:46,803 INFO L87 Difference]: Start difference. First operand has 140 states, 72 states have (on average 2.0555555555555554) internal successors, (148), 135 states have internal predecessors, (148), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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-02-08 06:42:46,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:42:46,918 INFO L93 Difference]: Finished difference Result 138 states and 150 transitions. [2025-02-08 06:42:46,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 06:42:46,920 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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 5 [2025-02-08 06:42:46,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:42:46,924 INFO L225 Difference]: With dead ends: 138 [2025-02-08 06:42:46,924 INFO L226 Difference]: Without dead ends: 134 [2025-02-08 06:42:46,925 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 06:42:46,930 INFO L435 NwaCegarLoop]: 143 mSDtfsCounter, 2 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 227 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 06:42:46,931 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 227 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 06:42:46,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2025-02-08 06:42:46,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 134. [2025-02-08 06:42:46,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 71 states have (on average 1.9295774647887325) internal successors, (137), 129 states have internal predecessors, (137), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 06:42:46,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 143 transitions. [2025-02-08 06:42:46,956 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 143 transitions. Word has length 5 [2025-02-08 06:42:46,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:42:46,956 INFO L471 AbstractCegarLoop]: Abstraction has 134 states and 143 transitions. [2025-02-08 06:42:46,957 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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-02-08 06:42:46,957 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 143 transitions. [2025-02-08 06:42:46,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-02-08 06:42:46,957 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:42:46,957 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-02-08 06:42:46,957 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 06:42:46,957 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting node_createErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 59 more)] === [2025-02-08 06:42:46,958 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:42:46,958 INFO L85 PathProgramCache]: Analyzing trace with hash 173308108, now seen corresponding path program 1 times [2025-02-08 06:42:46,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:42:46,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1970261435] [2025-02-08 06:42:46,958 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:42:46,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:42:46,964 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-08 06:42:46,971 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-08 06:42:46,972 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:42:46,972 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:42:47,088 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:42:47,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:42:47,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1970261435] [2025-02-08 06:42:47,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1970261435] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:42:47,090 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:42:47,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 06:42:47,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1912149587] [2025-02-08 06:42:47,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:42:47,091 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 06:42:47,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:42:47,091 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 06:42:47,091 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 06:42:47,091 INFO L87 Difference]: Start difference. First operand 134 states and 143 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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-02-08 06:42:47,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:42:47,174 INFO L93 Difference]: Finished difference Result 132 states and 141 transitions. [2025-02-08 06:42:47,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 06:42:47,174 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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 5 [2025-02-08 06:42:47,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:42:47,175 INFO L225 Difference]: With dead ends: 132 [2025-02-08 06:42:47,176 INFO L226 Difference]: Without dead ends: 132 [2025-02-08 06:42:47,176 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 06:42:47,177 INFO L435 NwaCegarLoop]: 137 mSDtfsCounter, 2 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 06:42:47,177 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 222 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 06:42:47,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2025-02-08 06:42:47,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 132. [2025-02-08 06:42:47,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 71 states have (on average 1.9014084507042253) internal successors, (135), 127 states have internal predecessors, (135), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 06:42:47,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 141 transitions. [2025-02-08 06:42:47,188 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 141 transitions. Word has length 5 [2025-02-08 06:42:47,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:42:47,188 INFO L471 AbstractCegarLoop]: Abstraction has 132 states and 141 transitions. [2025-02-08 06:42:47,188 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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-02-08 06:42:47,188 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 141 transitions. [2025-02-08 06:42:47,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-02-08 06:42:47,189 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:42:47,189 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:42:47,189 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 06:42:47,189 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr54REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 59 more)] === [2025-02-08 06:42:47,189 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:42:47,189 INFO L85 PathProgramCache]: Analyzing trace with hash -723767427, now seen corresponding path program 1 times [2025-02-08 06:42:47,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:42:47,189 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787338925] [2025-02-08 06:42:47,189 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:42:47,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:42:47,200 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-08 06:42:47,211 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-08 06:42:47,211 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:42:47,211 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:42:47,273 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:42:47,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:42:47,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1787338925] [2025-02-08 06:42:47,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1787338925] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:42:47,273 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:42:47,273 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 06:42:47,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1522838384] [2025-02-08 06:42:47,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:42:47,273 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 06:42:47,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:42:47,274 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 06:42:47,274 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 06:42:47,274 INFO L87 Difference]: Start difference. First operand 132 states and 141 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-02-08 06:42:47,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:42:47,287 INFO L93 Difference]: Finished difference Result 139 states and 149 transitions. [2025-02-08 06:42:47,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 06:42:47,288 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-02-08 06:42:47,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:42:47,289 INFO L225 Difference]: With dead ends: 139 [2025-02-08 06:42:47,289 INFO L226 Difference]: Without dead ends: 139 [2025-02-08 06:42:47,289 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 06:42:47,290 INFO L435 NwaCegarLoop]: 139 mSDtfsCounter, 5 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 273 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 06:42:47,290 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 273 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 06:42:47,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2025-02-08 06:42:47,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 133. [2025-02-08 06:42:47,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 72 states have (on average 1.8888888888888888) internal successors, (136), 128 states have internal predecessors, (136), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 06:42:47,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 142 transitions. [2025-02-08 06:42:47,296 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 142 transitions. Word has length 12 [2025-02-08 06:42:47,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:42:47,296 INFO L471 AbstractCegarLoop]: Abstraction has 133 states and 142 transitions. [2025-02-08 06:42:47,296 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-02-08 06:42:47,296 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 142 transitions. [2025-02-08 06:42:47,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-02-08 06:42:47,297 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:42:47,297 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:42:47,297 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 06:42:47,297 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr57REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 59 more)] === [2025-02-08 06:42:47,297 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:42:47,297 INFO L85 PathProgramCache]: Analyzing trace with hash 1587476965, now seen corresponding path program 1 times [2025-02-08 06:42:47,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:42:47,298 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2036689011] [2025-02-08 06:42:47,298 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:42:47,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:42:47,307 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-02-08 06:42:47,313 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-02-08 06:42:47,314 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:42:47,314 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:42:47,571 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 06:42:47,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:42:47,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2036689011] [2025-02-08 06:42:47,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2036689011] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:42:47,571 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:42:47,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 06:42:47,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1907910893] [2025-02-08 06:42:47,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:42:47,571 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 06:42:47,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:42:47,572 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 06:42:47,572 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-08 06:42:47,572 INFO L87 Difference]: Start difference. First operand 133 states and 142 transitions. Second operand has 6 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 06:42:47,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:42:47,731 INFO L93 Difference]: Finished difference Result 132 states and 141 transitions. [2025-02-08 06:42:47,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 06:42:47,731 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 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 21 [2025-02-08 06:42:47,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:42:47,732 INFO L225 Difference]: With dead ends: 132 [2025-02-08 06:42:47,732 INFO L226 Difference]: Without dead ends: 132 [2025-02-08 06:42:47,732 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-08 06:42:47,733 INFO L435 NwaCegarLoop]: 132 mSDtfsCounter, 1 mSDsluCounter, 313 mSDsCounter, 0 mSdLazyCounter, 246 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 445 SdHoareTripleChecker+Invalid, 246 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 246 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 06:42:47,733 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 445 Invalid, 246 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 246 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 06:42:47,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2025-02-08 06:42:47,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 132. [2025-02-08 06:42:47,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 72 states have (on average 1.875) internal successors, (135), 127 states have internal predecessors, (135), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 06:42:47,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 141 transitions. [2025-02-08 06:42:47,737 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 141 transitions. Word has length 21 [2025-02-08 06:42:47,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:42:47,737 INFO L471 AbstractCegarLoop]: Abstraction has 132 states and 141 transitions. [2025-02-08 06:42:47,737 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 06:42:47,738 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 141 transitions. [2025-02-08 06:42:47,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-02-08 06:42:47,738 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:42:47,738 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:42:47,738 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 06:42:47,738 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr56REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 59 more)] === [2025-02-08 06:42:47,739 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:42:47,739 INFO L85 PathProgramCache]: Analyzing trace with hash 1587476964, now seen corresponding path program 1 times [2025-02-08 06:42:47,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:42:47,739 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1433413470] [2025-02-08 06:42:47,739 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:42:47,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:42:47,752 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-02-08 06:42:47,763 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-02-08 06:42:47,763 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:42:47,763 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:42:47,848 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-08 06:42:47,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:42:47,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1433413470] [2025-02-08 06:42:47,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1433413470] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:42:47,848 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:42:47,848 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 06:42:47,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775604725] [2025-02-08 06:42:47,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:42:47,849 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 06:42:47,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:42:47,849 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 06:42:47,849 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-08 06:42:47,849 INFO L87 Difference]: Start difference. First operand 132 states and 141 transitions. Second operand has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 06:42:47,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:42:47,982 INFO L93 Difference]: Finished difference Result 131 states and 140 transitions. [2025-02-08 06:42:47,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 06:42:47,983 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 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 21 [2025-02-08 06:42:47,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:42:47,983 INFO L225 Difference]: With dead ends: 131 [2025-02-08 06:42:47,984 INFO L226 Difference]: Without dead ends: 131 [2025-02-08 06:42:47,984 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-02-08 06:42:47,984 INFO L435 NwaCegarLoop]: 132 mSDtfsCounter, 2 mSDsluCounter, 289 mSDsCounter, 0 mSdLazyCounter, 265 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 421 SdHoareTripleChecker+Invalid, 266 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 265 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 06:42:47,984 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 421 Invalid, 266 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 265 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 06:42:47,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2025-02-08 06:42:47,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2025-02-08 06:42:47,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 72 states have (on average 1.8611111111111112) internal successors, (134), 126 states have internal predecessors, (134), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 06:42:47,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 140 transitions. [2025-02-08 06:42:47,989 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 140 transitions. Word has length 21 [2025-02-08 06:42:47,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:42:47,989 INFO L471 AbstractCegarLoop]: Abstraction has 131 states and 140 transitions. [2025-02-08 06:42:47,989 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 06:42:47,989 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 140 transitions. [2025-02-08 06:42:47,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-02-08 06:42:47,989 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:42:47,989 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:42:47,990 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 06:42:47,990 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr54REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 59 more)] === [2025-02-08 06:42:47,990 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:42:47,990 INFO L85 PathProgramCache]: Analyzing trace with hash 641448705, now seen corresponding path program 1 times [2025-02-08 06:42:47,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:42:47,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1896583332] [2025-02-08 06:42:47,990 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:42:47,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:42:48,000 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-02-08 06:42:48,007 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-02-08 06:42:48,007 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:42:48,007 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:42:48,183 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 06:42:48,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:42:48,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1896583332] [2025-02-08 06:42:48,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1896583332] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:42:48,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [977133331] [2025-02-08 06:42:48,184 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:42:48,184 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:42:48,184 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:42:48,186 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 06:42:48,188 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-08 06:42:48,244 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-02-08 06:42:48,265 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-02-08 06:42:48,265 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:42:48,265 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:42:48,267 INFO L256 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-02-08 06:42:48,275 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:42:48,303 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-02-08 06:42:48,343 WARN L873 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| (select |c_#valid| |node_create_~temp~0#1.base|))) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) is different from true [2025-02-08 06:42:48,420 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-02-08 06:42:48,420 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-02-08 06:42:48,436 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 6 not checked. [2025-02-08 06:42:48,437 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 06:42:48,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [977133331] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:42:48,483 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-08 06:42:48,483 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 10 [2025-02-08 06:42:48,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1188507677] [2025-02-08 06:42:48,483 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-08 06:42:48,483 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-08 06:42:48,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:42:48,484 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-08 06:42:48,484 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=86, Unknown=1, NotChecked=18, Total=132 [2025-02-08 06:42:48,484 INFO L87 Difference]: Start difference. First operand 131 states and 140 transitions. Second operand has 11 states, 10 states have (on average 2.6) internal successors, (26), 9 states have internal predecessors, (26), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-02-08 06:42:48,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:42:48,769 INFO L93 Difference]: Finished difference Result 130 states and 139 transitions. [2025-02-08 06:42:48,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 06:42:48,769 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.6) internal successors, (26), 9 states have internal predecessors, (26), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 24 [2025-02-08 06:42:48,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:42:48,770 INFO L225 Difference]: With dead ends: 130 [2025-02-08 06:42:48,770 INFO L226 Difference]: Without dead ends: 130 [2025-02-08 06:42:48,770 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=122, Unknown=1, NotChecked=22, Total=182 [2025-02-08 06:42:48,771 INFO L435 NwaCegarLoop]: 128 mSDtfsCounter, 1 mSDsluCounter, 560 mSDsCounter, 0 mSdLazyCounter, 517 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 688 SdHoareTripleChecker+Invalid, 652 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 517 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 132 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 06:42:48,771 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 688 Invalid, 652 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 517 Invalid, 0 Unknown, 132 Unchecked, 0.2s Time] [2025-02-08 06:42:48,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2025-02-08 06:42:48,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 130. [2025-02-08 06:42:48,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 72 states have (on average 1.8472222222222223) internal successors, (133), 125 states have internal predecessors, (133), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 06:42:48,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 139 transitions. [2025-02-08 06:42:48,775 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 139 transitions. Word has length 24 [2025-02-08 06:42:48,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:42:48,775 INFO L471 AbstractCegarLoop]: Abstraction has 130 states and 139 transitions. [2025-02-08 06:42:48,775 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.6) internal successors, (26), 9 states have internal predecessors, (26), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-02-08 06:42:48,775 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 139 transitions. [2025-02-08 06:42:48,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-02-08 06:42:48,776 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:42:48,776 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:42:48,782 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-02-08 06:42:48,980 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:42:48,980 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr55REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 59 more)] === [2025-02-08 06:42:48,981 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:42:48,981 INFO L85 PathProgramCache]: Analyzing trace with hash 641448706, now seen corresponding path program 1 times [2025-02-08 06:42:48,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:42:48,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1974134299] [2025-02-08 06:42:48,981 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:42:48,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:42:48,991 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-02-08 06:42:49,001 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-02-08 06:42:49,003 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:42:49,004 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:42:49,287 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:42:49,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:42:49,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1974134299] [2025-02-08 06:42:49,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1974134299] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:42:49,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [822229235] [2025-02-08 06:42:49,288 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:42:49,288 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:42:49,288 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:42:49,290 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 06:42:49,296 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-08 06:42:49,357 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-02-08 06:42:49,382 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-02-08 06:42:49,382 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:42:49,382 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:42:49,384 INFO L256 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-02-08 06:42:49,386 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:42:49,393 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-02-08 06:42:49,558 WARN L873 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (= (store |c_old(#length)| |node_create_~temp~0#1.base| (select |c_#length| |node_create_~temp~0#1.base|)) |c_#length|) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) is different from true [2025-02-08 06:42:49,601 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 06:42:49,602 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 16 treesize of output 11 [2025-02-08 06:42:49,614 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-08 06:42:49,614 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 11 treesize of output 11 [2025-02-08 06:42:49,648 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2025-02-08 06:42:49,648 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 06:42:49,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [822229235] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:42:49,767 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-08 06:42:49,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 17 [2025-02-08 06:42:49,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [441461696] [2025-02-08 06:42:49,768 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-08 06:42:49,768 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-02-08 06:42:49,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:42:49,768 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-02-08 06:42:49,768 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=289, Unknown=1, NotChecked=34, Total=380 [2025-02-08 06:42:49,769 INFO L87 Difference]: Start difference. First operand 130 states and 139 transitions. Second operand has 18 states, 17 states have (on average 2.2941176470588234) internal successors, (39), 15 states have internal predecessors, (39), 3 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-02-08 06:42:50,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:42:50,226 INFO L93 Difference]: Finished difference Result 137 states and 149 transitions. [2025-02-08 06:42:50,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 06:42:50,227 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 2.2941176470588234) internal successors, (39), 15 states have internal predecessors, (39), 3 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 24 [2025-02-08 06:42:50,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:42:50,229 INFO L225 Difference]: With dead ends: 137 [2025-02-08 06:42:50,229 INFO L226 Difference]: Without dead ends: 137 [2025-02-08 06:42:50,229 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=69, Invalid=354, Unknown=1, NotChecked=38, Total=462 [2025-02-08 06:42:50,230 INFO L435 NwaCegarLoop]: 129 mSDtfsCounter, 3 mSDsluCounter, 574 mSDsCounter, 0 mSdLazyCounter, 663 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 703 SdHoareTripleChecker+Invalid, 816 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 663 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 143 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-08 06:42:50,230 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 703 Invalid, 816 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 663 Invalid, 0 Unknown, 143 Unchecked, 0.4s Time] [2025-02-08 06:42:50,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2025-02-08 06:42:50,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 136. [2025-02-08 06:42:50,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 77 states have (on average 1.8051948051948052) internal successors, (139), 130 states have internal predecessors, (139), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-08 06:42:50,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 147 transitions. [2025-02-08 06:42:50,241 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 147 transitions. Word has length 24 [2025-02-08 06:42:50,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:42:50,242 INFO L471 AbstractCegarLoop]: Abstraction has 136 states and 147 transitions. [2025-02-08 06:42:50,242 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 2.2941176470588234) internal successors, (39), 15 states have internal predecessors, (39), 3 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-02-08 06:42:50,242 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 147 transitions. [2025-02-08 06:42:50,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-02-08 06:42:50,242 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:42:50,242 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:42:50,257 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-08 06:42:50,443 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:42:50,443 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr52REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 59 more)] === [2025-02-08 06:42:50,445 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:42:50,445 INFO L85 PathProgramCache]: Analyzing trace with hash -1314828640, now seen corresponding path program 1 times [2025-02-08 06:42:50,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:42:50,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1939429250] [2025-02-08 06:42:50,445 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:42:50,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:42:50,462 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-02-08 06:42:50,494 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-02-08 06:42:50,497 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:42:50,498 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:42:50,911 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-08 06:42:50,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:42:50,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1939429250] [2025-02-08 06:42:50,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1939429250] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:42:50,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2032560359] [2025-02-08 06:42:50,912 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:42:50,912 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:42:50,912 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:42:50,915 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 06:42:50,920 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-08 06:42:50,990 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-02-08 06:42:51,020 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-02-08 06:42:51,020 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:42:51,021 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:42:51,022 INFO L256 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-02-08 06:42:51,024 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:42:51,030 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-02-08 06:42:51,042 WARN L873 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| (select |c_#valid| |node_create_~temp~0#1.base|))) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) is different from true [2025-02-08 06:42:51,090 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-02-08 06:42:51,090 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-02-08 06:42:51,140 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-02-08 06:42:51,141 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-02-08 06:42:51,211 WARN L873 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| 1))) is different from true [2025-02-08 06:42:51,234 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2025-02-08 06:42:51,234 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 12 treesize of output 14 [2025-02-08 06:42:51,250 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 18 not checked. [2025-02-08 06:42:51,250 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 06:42:51,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2032560359] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:42:51,539 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-08 06:42:51,539 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 16 [2025-02-08 06:42:51,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915127607] [2025-02-08 06:42:51,539 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-08 06:42:51,540 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-02-08 06:42:51,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:42:51,540 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-02-08 06:42:51,540 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=379, Unknown=2, NotChecked=82, Total=552 [2025-02-08 06:42:51,540 INFO L87 Difference]: Start difference. First operand 136 states and 147 transitions. Second operand has 18 states, 17 states have (on average 2.9411764705882355) internal successors, (50), 15 states have internal predecessors, (50), 3 states have call successors, (5), 1 states have call predecessors, (5), 6 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2025-02-08 06:42:51,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:42:51,999 INFO L93 Difference]: Finished difference Result 146 states and 158 transitions. [2025-02-08 06:42:51,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 06:42:52,000 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 2.9411764705882355) internal successors, (50), 15 states have internal predecessors, (50), 3 states have call successors, (5), 1 states have call predecessors, (5), 6 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) Word has length 35 [2025-02-08 06:42:52,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:42:52,000 INFO L225 Difference]: With dead ends: 146 [2025-02-08 06:42:52,001 INFO L226 Difference]: Without dead ends: 146 [2025-02-08 06:42:52,001 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 49 SyntacticMatches, 5 SemanticMatches, 25 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=120, Invalid=486, Unknown=2, NotChecked=94, Total=702 [2025-02-08 06:42:52,001 INFO L435 NwaCegarLoop]: 63 mSDtfsCounter, 141 mSDsluCounter, 536 mSDsCounter, 0 mSdLazyCounter, 710 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 599 SdHoareTripleChecker+Invalid, 1008 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 710 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 286 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-08 06:42:52,001 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 599 Invalid, 1008 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 710 Invalid, 0 Unknown, 286 Unchecked, 0.4s Time] [2025-02-08 06:42:52,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2025-02-08 06:42:52,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 127. [2025-02-08 06:42:52,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 77 states have (on average 1.6883116883116882) internal successors, (130), 121 states have internal predecessors, (130), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-08 06:42:52,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 138 transitions. [2025-02-08 06:42:52,005 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 138 transitions. Word has length 35 [2025-02-08 06:42:52,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:42:52,005 INFO L471 AbstractCegarLoop]: Abstraction has 127 states and 138 transitions. [2025-02-08 06:42:52,005 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 2.9411764705882355) internal successors, (50), 15 states have internal predecessors, (50), 3 states have call successors, (5), 1 states have call predecessors, (5), 6 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2025-02-08 06:42:52,005 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 138 transitions. [2025-02-08 06:42:52,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-02-08 06:42:52,006 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:42:52,006 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:42:52,014 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-02-08 06:42:52,210 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:42:52,210 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr53REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 59 more)] === [2025-02-08 06:42:52,211 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:42:52,211 INFO L85 PathProgramCache]: Analyzing trace with hash -1314828639, now seen corresponding path program 1 times [2025-02-08 06:42:52,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:42:52,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [707840560] [2025-02-08 06:42:52,211 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:42:52,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:42:52,225 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-02-08 06:42:52,234 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-02-08 06:42:52,234 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:42:52,234 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:42:52,578 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-02-08 06:42:52,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:42:52,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [707840560] [2025-02-08 06:42:52,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [707840560] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:42:52,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1321536444] [2025-02-08 06:42:52,579 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:42:52,579 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:42:52,579 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:42:52,584 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 06:42:52,585 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-08 06:42:52,651 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-02-08 06:42:52,680 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-02-08 06:42:52,680 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:42:52,680 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:42:52,682 INFO L256 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-02-08 06:42:52,684 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:42:52,690 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-02-08 06:42:52,696 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-02-08 06:42:52,702 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-02-08 06:42:52,726 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 06:42:52,727 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-02-08 06:42:52,742 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-02-08 06:42:52,770 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 06:42:52,770 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-02-08 06:42:52,804 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-02-08 06:42:52,838 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 06:42:52,839 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-02-08 06:42:52,844 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-02-08 06:42:52,844 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 06:42:52,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1321536444] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:42:52,844 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 06:42:52,845 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 11 [2025-02-08 06:42:52,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1033009729] [2025-02-08 06:42:52,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:42:52,845 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 06:42:52,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:42:52,845 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 06:42:52,846 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=103, Unknown=1, NotChecked=20, Total=156 [2025-02-08 06:42:52,846 INFO L87 Difference]: Start difference. First operand 127 states and 138 transitions. Second operand has 7 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-02-08 06:42:53,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:42:53,062 INFO L93 Difference]: Finished difference Result 123 states and 134 transitions. [2025-02-08 06:42:53,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 06:42:53,064 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 35 [2025-02-08 06:42:53,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:42:53,065 INFO L225 Difference]: With dead ends: 123 [2025-02-08 06:42:53,065 INFO L226 Difference]: Without dead ends: 123 [2025-02-08 06:42:53,065 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 37 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-02-08 06:42:53,066 INFO L435 NwaCegarLoop]: 97 mSDtfsCounter, 34 mSDsluCounter, 231 mSDsCounter, 0 mSdLazyCounter, 207 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 328 SdHoareTripleChecker+Invalid, 364 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 207 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 153 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 06:42:53,066 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 328 Invalid, 364 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 207 Invalid, 0 Unknown, 153 Unchecked, 0.2s Time] [2025-02-08 06:42:53,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2025-02-08 06:42:53,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 122. [2025-02-08 06:42:53,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 77 states have (on average 1.6233766233766234) internal successors, (125), 116 states have internal predecessors, (125), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-08 06:42:53,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 133 transitions. [2025-02-08 06:42:53,069 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 133 transitions. Word has length 35 [2025-02-08 06:42:53,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:42:53,070 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 133 transitions. [2025-02-08 06:42:53,070 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-02-08 06:42:53,070 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 133 transitions. [2025-02-08 06:42:53,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-02-08 06:42:53,070 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:42:53,070 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2025-02-08 06:42:53,079 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-02-08 06:42:53,271 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2025-02-08 06:42:53,271 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr55REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 59 more)] === [2025-02-08 06:42:53,272 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:42:53,272 INFO L85 PathProgramCache]: Analyzing trace with hash -2127421306, now seen corresponding path program 2 times [2025-02-08 06:42:53,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:42:53,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [374555726] [2025-02-08 06:42:53,272 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 06:42:53,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:42:53,284 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 36 statements into 2 equivalence classes. [2025-02-08 06:42:53,290 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 36 of 36 statements. [2025-02-08 06:42:53,290 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 06:42:53,290 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:42:53,344 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-02-08 06:42:53,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:42:53,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [374555726] [2025-02-08 06:42:53,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [374555726] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:42:53,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [623023122] [2025-02-08 06:42:53,345 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 06:42:53,345 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:42:53,345 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:42:53,346 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 06:42:53,351 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-08 06:42:53,421 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 36 statements into 2 equivalence classes. [2025-02-08 06:42:53,447 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 36 of 36 statements. [2025-02-08 06:42:53,448 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 06:42:53,448 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:42:53,449 INFO L256 TraceCheckSpWp]: Trace formula consists of 310 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-08 06:42:53,450 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:42:53,469 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-02-08 06:42:53,469 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 06:42:53,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [623023122] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:42:53,469 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 06:42:53,470 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2025-02-08 06:42:53,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [935638261] [2025-02-08 06:42:53,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:42:53,470 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 06:42:53,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:42:53,470 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 06:42:53,470 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-08 06:42:53,471 INFO L87 Difference]: Start difference. First operand 122 states and 133 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-02-08 06:42:53,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:42:53,494 INFO L93 Difference]: Finished difference Result 115 states and 123 transitions. [2025-02-08 06:42:53,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 06:42:53,498 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 36 [2025-02-08 06:42:53,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:42:53,498 INFO L225 Difference]: With dead ends: 115 [2025-02-08 06:42:53,498 INFO L226 Difference]: Without dead ends: 115 [2025-02-08 06:42:53,498 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-08 06:42:53,499 INFO L435 NwaCegarLoop]: 120 mSDtfsCounter, 0 mSDsluCounter, 229 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 349 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 06:42:53,499 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 349 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 06:42:53,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2025-02-08 06:42:53,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2025-02-08 06:42:53,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 72 states have (on average 1.625) internal successors, (117), 110 states have internal predecessors, (117), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 06:42:53,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 123 transitions. [2025-02-08 06:42:53,501 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 123 transitions. Word has length 36 [2025-02-08 06:42:53,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:42:53,501 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 123 transitions. [2025-02-08 06:42:53,502 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-02-08 06:42:53,502 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 123 transitions. [2025-02-08 06:42:53,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-02-08 06:42:53,502 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:42:53,502 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:42:53,516 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-02-08 06:42:53,707 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-02-08 06:42:53,707 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr51REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 59 more)] === [2025-02-08 06:42:53,708 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:42:53,708 INFO L85 PathProgramCache]: Analyzing trace with hash 41825507, now seen corresponding path program 1 times [2025-02-08 06:42:53,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:42:53,708 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [315192883] [2025-02-08 06:42:53,708 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:42:53,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:42:53,723 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-02-08 06:42:53,730 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-02-08 06:42:53,731 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:42:53,731 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:42:54,085 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 15 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 06:42:54,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:42:54,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [315192883] [2025-02-08 06:42:54,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [315192883] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:42:54,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [782763192] [2025-02-08 06:42:54,086 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:42:54,086 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:42:54,086 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:42:54,088 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 06:42:54,090 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-02-08 06:42:54,160 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-02-08 06:42:54,295 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-02-08 06:42:54,296 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:42:54,296 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:42:54,298 INFO L256 TraceCheckSpWp]: Trace formula consists of 352 conjuncts, 58 conjuncts are in the unsatisfiable core [2025-02-08 06:42:54,300 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:42:54,319 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-02-08 06:42:54,490 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-02-08 06:42:54,492 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-02-08 06:42:54,522 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_4| Int)) (= 0 (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_4|) 0))) (exists ((|node_create_~temp~0#1.base| Int)) (and (= (store |c_old(#length)| |node_create_~temp~0#1.base| (select |c_#length| |node_create_~temp~0#1.base|)) |c_#length|) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|))))) is different from true [2025-02-08 06:42:54,575 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2025-02-08 06:42:54,576 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-02-08 06:42:54,580 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 18 treesize of output 13 [2025-02-08 06:42:54,628 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 17 treesize of output 9 [2025-02-08 06:42:54,671 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 6 not checked. [2025-02-08 06:42:54,671 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 06:42:54,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [782763192] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:42:54,814 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-08 06:42:54,814 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 27 [2025-02-08 06:42:54,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1361398135] [2025-02-08 06:42:54,814 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-08 06:42:54,815 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-02-08 06:42:54,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:42:54,815 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-02-08 06:42:54,816 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=845, Unknown=1, NotChecked=58, Total=992 [2025-02-08 06:42:54,816 INFO L87 Difference]: Start difference. First operand 115 states and 123 transitions. Second operand has 28 states, 25 states have (on average 2.32) internal successors, (58), 24 states have internal predecessors, (58), 4 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2025-02-08 06:42:55,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:42:55,647 INFO L93 Difference]: Finished difference Result 149 states and 160 transitions. [2025-02-08 06:42:55,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-02-08 06:42:55,648 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 25 states have (on average 2.32) internal successors, (58), 24 states have internal predecessors, (58), 4 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 38 [2025-02-08 06:42:55,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:42:55,648 INFO L225 Difference]: With dead ends: 149 [2025-02-08 06:42:55,648 INFO L226 Difference]: Without dead ends: 149 [2025-02-08 06:42:55,649 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 259 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=173, Invalid=1636, Unknown=1, NotChecked=82, Total=1892 [2025-02-08 06:42:55,649 INFO L435 NwaCegarLoop]: 86 mSDtfsCounter, 273 mSDsluCounter, 985 mSDsCounter, 0 mSdLazyCounter, 1219 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 273 SdHoareTripleChecker+Valid, 1071 SdHoareTripleChecker+Invalid, 1378 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1219 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 154 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-08 06:42:55,649 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [273 Valid, 1071 Invalid, 1378 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1219 Invalid, 0 Unknown, 154 Unchecked, 0.6s Time] [2025-02-08 06:42:55,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2025-02-08 06:42:55,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 124. [2025-02-08 06:42:55,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 80 states have (on average 1.5875) internal successors, (127), 118 states have internal predecessors, (127), 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-02-08 06:42:55,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 133 transitions. [2025-02-08 06:42:55,653 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 133 transitions. Word has length 38 [2025-02-08 06:42:55,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:42:55,654 INFO L471 AbstractCegarLoop]: Abstraction has 124 states and 133 transitions. [2025-02-08 06:42:55,654 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 25 states have (on average 2.32) internal successors, (58), 24 states have internal predecessors, (58), 4 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2025-02-08 06:42:55,654 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 133 transitions. [2025-02-08 06:42:55,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-02-08 06:42:55,655 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:42:55,655 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:42:55,662 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-02-08 06:42:55,855 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-02-08 06:42:55,856 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr50REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 59 more)] === [2025-02-08 06:42:55,856 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:42:55,856 INFO L85 PathProgramCache]: Analyzing trace with hash 41825506, now seen corresponding path program 1 times [2025-02-08 06:42:55,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:42:55,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [900745666] [2025-02-08 06:42:55,856 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:42:55,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:42:55,866 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-02-08 06:42:55,873 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-02-08 06:42:55,873 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:42:55,873 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:42:56,065 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 17 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 06:42:56,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:42:56,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [900745666] [2025-02-08 06:42:56,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [900745666] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:42:56,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [491530503] [2025-02-08 06:42:56,066 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:42:56,066 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:42:56,066 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:42:56,068 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 06:42:56,069 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-02-08 06:42:56,151 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-02-08 06:42:56,216 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-02-08 06:42:56,216 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:42:56,216 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:42:56,218 INFO L256 TraceCheckSpWp]: Trace formula consists of 352 conjuncts, 36 conjuncts are in the unsatisfiable core [2025-02-08 06:42:56,220 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:42:56,287 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-02-08 06:42:56,292 WARN L873 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| (select |c_#valid| |node_create_~temp~0#1.base|))) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) is different from true [2025-02-08 06:42:56,326 INFO L349 Elim1Store]: treesize reduction 32, result has 36.0 percent of original size [2025-02-08 06:42:56,326 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 23 treesize of output 24 [2025-02-08 06:42:56,333 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 17 treesize of output 9 [2025-02-08 06:42:56,337 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-02-08 06:42:56,337 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 06:42:56,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [491530503] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:42:56,337 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 06:42:56,337 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [13] total 18 [2025-02-08 06:42:56,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [105856431] [2025-02-08 06:42:56,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:42:56,337 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-08 06:42:56,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:42:56,338 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-08 06:42:56,338 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=264, Unknown=1, NotChecked=32, Total=342 [2025-02-08 06:42:56,338 INFO L87 Difference]: Start difference. First operand 124 states and 133 transitions. Second operand has 10 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-02-08 06:42:56,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:42:56,522 INFO L93 Difference]: Finished difference Result 149 states and 159 transitions. [2025-02-08 06:42:56,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-08 06:42:56,523 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 38 [2025-02-08 06:42:56,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:42:56,523 INFO L225 Difference]: With dead ends: 149 [2025-02-08 06:42:56,523 INFO L226 Difference]: Without dead ends: 149 [2025-02-08 06:42:56,524 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=363, Unknown=1, NotChecked=38, Total=462 [2025-02-08 06:42:56,524 INFO L435 NwaCegarLoop]: 98 mSDtfsCounter, 85 mSDsluCounter, 426 mSDsCounter, 0 mSdLazyCounter, 357 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 524 SdHoareTripleChecker+Invalid, 562 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 357 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 203 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 06:42:56,524 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 524 Invalid, 562 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 357 Invalid, 0 Unknown, 203 Unchecked, 0.2s Time] [2025-02-08 06:42:56,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2025-02-08 06:42:56,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 124. [2025-02-08 06:42:56,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 80 states have (on average 1.575) internal successors, (126), 118 states have internal predecessors, (126), 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-02-08 06:42:56,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 132 transitions. [2025-02-08 06:42:56,527 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 132 transitions. Word has length 38 [2025-02-08 06:42:56,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:42:56,527 INFO L471 AbstractCegarLoop]: Abstraction has 124 states and 132 transitions. [2025-02-08 06:42:56,527 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-02-08 06:42:56,527 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 132 transitions. [2025-02-08 06:42:56,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-02-08 06:42:56,528 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:42:56,528 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:42:56,535 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-02-08 06:42:56,728 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:42:56,729 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 59 more)] === [2025-02-08 06:42:56,729 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:42:56,729 INFO L85 PathProgramCache]: Analyzing trace with hash 1296591619, now seen corresponding path program 1 times [2025-02-08 06:42:56,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:42:56,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [617119156] [2025-02-08 06:42:56,729 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:42:56,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:42:56,739 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-02-08 06:42:56,743 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-02-08 06:42:56,743 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:42:56,743 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:42:56,764 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-02-08 06:42:56,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:42:56,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [617119156] [2025-02-08 06:42:56,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [617119156] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:42:56,765 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:42:56,765 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 06:42:56,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1901639820] [2025-02-08 06:42:56,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:42:56,765 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 06:42:56,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:42:56,766 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 06:42:56,766 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 06:42:56,766 INFO L87 Difference]: Start difference. First operand 124 states and 132 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-08 06:42:56,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:42:56,774 INFO L93 Difference]: Finished difference Result 125 states and 133 transitions. [2025-02-08 06:42:56,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 06:42:56,774 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 39 [2025-02-08 06:42:56,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:42:56,775 INFO L225 Difference]: With dead ends: 125 [2025-02-08 06:42:56,775 INFO L226 Difference]: Without dead ends: 125 [2025-02-08 06:42:56,775 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 06:42:56,775 INFO L435 NwaCegarLoop]: 122 mSDtfsCounter, 0 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 234 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 06:42:56,776 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 234 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 06:42:56,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2025-02-08 06:42:56,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2025-02-08 06:42:56,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 81 states have (on average 1.5679012345679013) internal successors, (127), 119 states have internal predecessors, (127), 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-02-08 06:42:56,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 133 transitions. [2025-02-08 06:42:56,778 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 133 transitions. Word has length 39 [2025-02-08 06:42:56,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:42:56,778 INFO L471 AbstractCegarLoop]: Abstraction has 125 states and 133 transitions. [2025-02-08 06:42:56,778 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-08 06:42:56,778 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 133 transitions. [2025-02-08 06:42:56,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-02-08 06:42:56,779 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:42:56,779 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:42:56,779 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-08 06:42:56,779 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr51REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 59 more)] === [2025-02-08 06:42:56,779 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:42:56,779 INFO L85 PathProgramCache]: Analyzing trace with hash 483227867, now seen corresponding path program 1 times [2025-02-08 06:42:56,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:42:56,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [222274311] [2025-02-08 06:42:56,779 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:42:56,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:42:56,804 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-02-08 06:42:56,813 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-02-08 06:42:56,814 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:42:56,814 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:42:56,883 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-02-08 06:42:56,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:42:56,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [222274311] [2025-02-08 06:42:56,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [222274311] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:42:56,883 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:42:56,883 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 06:42:56,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1411674552] [2025-02-08 06:42:56,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:42:56,884 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 06:42:56,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:42:56,884 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 06:42:56,884 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-08 06:42:56,884 INFO L87 Difference]: Start difference. First operand 125 states and 133 transitions. Second operand has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-02-08 06:42:56,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:42:56,905 INFO L93 Difference]: Finished difference Result 122 states and 129 transitions. [2025-02-08 06:42:56,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 06:42:56,906 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 41 [2025-02-08 06:42:56,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:42:56,906 INFO L225 Difference]: With dead ends: 122 [2025-02-08 06:42:56,906 INFO L226 Difference]: Without dead ends: 122 [2025-02-08 06:42:56,907 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-02-08 06:42:56,907 INFO L435 NwaCegarLoop]: 116 mSDtfsCounter, 71 mSDsluCounter, 262 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 378 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 06:42:56,907 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 378 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 06:42:56,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2025-02-08 06:42:56,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2025-02-08 06:42:56,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 80 states have (on average 1.5375) internal successors, (123), 116 states have internal predecessors, (123), 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-02-08 06:42:56,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 129 transitions. [2025-02-08 06:42:56,912 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 129 transitions. Word has length 41 [2025-02-08 06:42:56,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:42:56,912 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 129 transitions. [2025-02-08 06:42:56,912 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-02-08 06:42:56,912 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 129 transitions. [2025-02-08 06:42:56,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-02-08 06:42:56,912 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:42:56,912 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:42:56,913 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-08 06:42:56,913 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr46REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 59 more)] === [2025-02-08 06:42:56,913 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:42:56,913 INFO L85 PathProgramCache]: Analyzing trace with hash 484086680, now seen corresponding path program 1 times [2025-02-08 06:42:56,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:42:56,913 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [173400255] [2025-02-08 06:42:56,913 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:42:56,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:42:56,927 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-02-08 06:42:56,931 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-02-08 06:42:56,931 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:42:56,931 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:42:56,975 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-02-08 06:42:56,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:42:56,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [173400255] [2025-02-08 06:42:56,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [173400255] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:42:56,975 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:42:56,975 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 06:42:56,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [659916828] [2025-02-08 06:42:56,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:42:56,976 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 06:42:56,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:42:56,976 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 06:42:56,977 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-08 06:42:56,977 INFO L87 Difference]: Start difference. First operand 122 states and 129 transitions. Second operand has 6 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-08 06:42:57,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:42:57,093 INFO L93 Difference]: Finished difference Result 119 states and 126 transitions. [2025-02-08 06:42:57,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 06:42:57,093 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 41 [2025-02-08 06:42:57,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:42:57,094 INFO L225 Difference]: With dead ends: 119 [2025-02-08 06:42:57,094 INFO L226 Difference]: Without dead ends: 119 [2025-02-08 06:42:57,094 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-02-08 06:42:57,094 INFO L435 NwaCegarLoop]: 97 mSDtfsCounter, 18 mSDsluCounter, 239 mSDsCounter, 0 mSdLazyCounter, 223 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 336 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-02-08 06:42:57,094 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 336 Invalid, 226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 223 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 06:42:57,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2025-02-08 06:42:57,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2025-02-08 06:42:57,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 80 states have (on average 1.5) internal successors, (120), 113 states have internal predecessors, (120), 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-02-08 06:42:57,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 126 transitions. [2025-02-08 06:42:57,096 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 126 transitions. Word has length 41 [2025-02-08 06:42:57,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:42:57,096 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 126 transitions. [2025-02-08 06:42:57,098 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-08 06:42:57,098 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 126 transitions. [2025-02-08 06:42:57,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-02-08 06:42:57,099 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:42:57,099 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:42:57,099 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-08 06:42:57,099 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr47REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 59 more)] === [2025-02-08 06:42:57,099 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:42:57,100 INFO L85 PathProgramCache]: Analyzing trace with hash 484086681, now seen corresponding path program 1 times [2025-02-08 06:42:57,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:42:57,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1822730206] [2025-02-08 06:42:57,100 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:42:57,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:42:57,111 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-02-08 06:42:57,116 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-02-08 06:42:57,117 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:42:57,117 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:42:57,164 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-02-08 06:42:57,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:42:57,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1822730206] [2025-02-08 06:42:57,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1822730206] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:42:57,164 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:42:57,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 06:42:57,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1818774118] [2025-02-08 06:42:57,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:42:57,165 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 06:42:57,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:42:57,166 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 06:42:57,166 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 06:42:57,166 INFO L87 Difference]: Start difference. First operand 119 states and 126 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-02-08 06:42:57,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:42:57,180 INFO L93 Difference]: Finished difference Result 118 states and 124 transitions. [2025-02-08 06:42:57,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 06:42:57,180 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 41 [2025-02-08 06:42:57,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:42:57,181 INFO L225 Difference]: With dead ends: 118 [2025-02-08 06:42:57,181 INFO L226 Difference]: Without dead ends: 118 [2025-02-08 06:42:57,181 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-08 06:42:57,182 INFO L435 NwaCegarLoop]: 114 mSDtfsCounter, 70 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 259 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 06:42:57,182 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 259 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 06:42:57,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2025-02-08 06:42:57,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2025-02-08 06:42:57,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 79 states have (on average 1.4936708860759493) internal successors, (118), 112 states have internal predecessors, (118), 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-02-08 06:42:57,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 124 transitions. [2025-02-08 06:42:57,186 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 124 transitions. Word has length 41 [2025-02-08 06:42:57,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:42:57,186 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 124 transitions. [2025-02-08 06:42:57,186 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-02-08 06:42:57,186 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 124 transitions. [2025-02-08 06:42:57,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-02-08 06:42:57,187 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:42:57,187 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:42:57,187 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-08 06:42:57,187 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 59 more)] === [2025-02-08 06:42:57,187 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:42:57,187 INFO L85 PathProgramCache]: Analyzing trace with hash 2095162891, now seen corresponding path program 1 times [2025-02-08 06:42:57,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:42:57,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1435476155] [2025-02-08 06:42:57,187 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:42:57,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:42:57,198 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-02-08 06:42:57,203 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-02-08 06:42:57,203 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:42:57,203 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:42:57,233 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-02-08 06:42:57,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:42:57,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1435476155] [2025-02-08 06:42:57,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1435476155] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:42:57,233 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:42:57,233 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 06:42:57,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [400685034] [2025-02-08 06:42:57,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:42:57,234 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 06:42:57,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:42:57,235 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 06:42:57,235 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 06:42:57,235 INFO L87 Difference]: Start difference. First operand 118 states and 124 transitions. Second operand has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-08 06:42:57,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:42:57,297 INFO L93 Difference]: Finished difference Result 117 states and 123 transitions. [2025-02-08 06:42:57,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 06:42:57,298 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 42 [2025-02-08 06:42:57,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:42:57,298 INFO L225 Difference]: With dead ends: 117 [2025-02-08 06:42:57,298 INFO L226 Difference]: Without dead ends: 117 [2025-02-08 06:42:57,298 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 06:42:57,299 INFO L435 NwaCegarLoop]: 112 mSDtfsCounter, 0 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 240 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 06:42:57,299 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 240 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 06:42:57,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2025-02-08 06:42:57,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2025-02-08 06:42:57,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 79 states have (on average 1.481012658227848) internal successors, (117), 111 states have internal predecessors, (117), 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-02-08 06:42:57,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 123 transitions. [2025-02-08 06:42:57,304 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 123 transitions. Word has length 42 [2025-02-08 06:42:57,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:42:57,304 INFO L471 AbstractCegarLoop]: Abstraction has 117 states and 123 transitions. [2025-02-08 06:42:57,304 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-08 06:42:57,304 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 123 transitions. [2025-02-08 06:42:57,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-02-08 06:42:57,305 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:42:57,305 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:42:57,305 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-08 06:42:57,305 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 59 more)] === [2025-02-08 06:42:57,305 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:42:57,305 INFO L85 PathProgramCache]: Analyzing trace with hash 2095162892, now seen corresponding path program 1 times [2025-02-08 06:42:57,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:42:57,305 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15245113] [2025-02-08 06:42:57,306 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:42:57,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:42:57,317 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-02-08 06:42:57,323 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-02-08 06:42:57,323 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:42:57,323 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:42:57,394 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-02-08 06:42:57,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:42:57,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [15245113] [2025-02-08 06:42:57,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [15245113] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:42:57,395 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:42:57,395 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 06:42:57,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1456665288] [2025-02-08 06:42:57,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:42:57,395 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 06:42:57,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:42:57,396 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 06:42:57,396 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 06:42:57,396 INFO L87 Difference]: Start difference. First operand 117 states and 123 transitions. Second operand has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-08 06:42:57,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:42:57,463 INFO L93 Difference]: Finished difference Result 116 states and 122 transitions. [2025-02-08 06:42:57,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 06:42:57,464 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 42 [2025-02-08 06:42:57,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:42:57,464 INFO L225 Difference]: With dead ends: 116 [2025-02-08 06:42:57,464 INFO L226 Difference]: Without dead ends: 116 [2025-02-08 06:42:57,464 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 06:42:57,465 INFO L435 NwaCegarLoop]: 112 mSDtfsCounter, 0 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 238 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 06:42:57,465 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 238 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 06:42:57,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2025-02-08 06:42:57,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2025-02-08 06:42:57,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 79 states have (on average 1.4683544303797469) internal successors, (116), 110 states have internal predecessors, (116), 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-02-08 06:42:57,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 122 transitions. [2025-02-08 06:42:57,467 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 122 transitions. Word has length 42 [2025-02-08 06:42:57,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:42:57,467 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 122 transitions. [2025-02-08 06:42:57,467 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-08 06:42:57,468 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 122 transitions. [2025-02-08 06:42:57,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-02-08 06:42:57,469 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:42:57,469 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:42:57,469 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-08 06:42:57,469 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 59 more)] === [2025-02-08 06:42:57,469 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:42:57,469 INFO L85 PathProgramCache]: Analyzing trace with hash 525540244, now seen corresponding path program 1 times [2025-02-08 06:42:57,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:42:57,469 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869606709] [2025-02-08 06:42:57,470 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:42:57,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:42:57,480 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-02-08 06:42:57,486 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-02-08 06:42:57,486 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:42:57,486 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:42:57,581 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-02-08 06:42:57,581 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:42:57,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [869606709] [2025-02-08 06:42:57,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [869606709] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:42:57,582 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:42:57,582 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 06:42:57,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1011649642] [2025-02-08 06:42:57,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:42:57,582 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 06:42:57,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:42:57,583 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 06:42:57,583 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-08 06:42:57,583 INFO L87 Difference]: Start difference. First operand 116 states and 122 transitions. Second operand has 6 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-08 06:42:57,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:42:57,688 INFO L93 Difference]: Finished difference Result 113 states and 119 transitions. [2025-02-08 06:42:57,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 06:42:57,689 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 43 [2025-02-08 06:42:57,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:42:57,689 INFO L225 Difference]: With dead ends: 113 [2025-02-08 06:42:57,689 INFO L226 Difference]: Without dead ends: 113 [2025-02-08 06:42:57,689 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-02-08 06:42:57,690 INFO L435 NwaCegarLoop]: 96 mSDtfsCounter, 13 mSDsluCounter, 244 mSDsCounter, 0 mSdLazyCounter, 196 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 340 SdHoareTripleChecker+Invalid, 198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 06:42:57,690 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 340 Invalid, 198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 196 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 06:42:57,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2025-02-08 06:42:57,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2025-02-08 06:42:57,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 79 states have (on average 1.4303797468354431) internal successors, (113), 107 states have internal predecessors, (113), 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-02-08 06:42:57,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 119 transitions. [2025-02-08 06:42:57,692 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 119 transitions. Word has length 43 [2025-02-08 06:42:57,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:42:57,692 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 119 transitions. [2025-02-08 06:42:57,692 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-08 06:42:57,692 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 119 transitions. [2025-02-08 06:42:57,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-02-08 06:42:57,692 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:42:57,692 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:42:57,692 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-08 06:42:57,692 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 59 more)] === [2025-02-08 06:42:57,695 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:42:57,695 INFO L85 PathProgramCache]: Analyzing trace with hash -1761965455, now seen corresponding path program 1 times [2025-02-08 06:42:57,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:42:57,695 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2128958262] [2025-02-08 06:42:57,695 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:42:57,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:42:57,708 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-02-08 06:42:57,715 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-02-08 06:42:57,715 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:42:57,715 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:42:57,830 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-02-08 06:42:57,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:42:57,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2128958262] [2025-02-08 06:42:57,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2128958262] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:42:57,830 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:42:57,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 06:42:57,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2018544190] [2025-02-08 06:42:57,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:42:57,831 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 06:42:57,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:42:57,831 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 06:42:57,831 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-02-08 06:42:57,831 INFO L87 Difference]: Start difference. First operand 113 states and 119 transitions. Second operand has 6 states, 4 states have (on average 6.75) internal successors, (27), 6 states have internal predecessors, (27), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-02-08 06:42:57,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:42:57,896 INFO L93 Difference]: Finished difference Result 110 states and 116 transitions. [2025-02-08 06:42:57,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 06:42:57,896 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 6.75) internal successors, (27), 6 states have internal predecessors, (27), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 45 [2025-02-08 06:42:57,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:42:57,897 INFO L225 Difference]: With dead ends: 110 [2025-02-08 06:42:57,897 INFO L226 Difference]: Without dead ends: 110 [2025-02-08 06:42:57,897 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2025-02-08 06:42:57,897 INFO L435 NwaCegarLoop]: 80 mSDtfsCounter, 94 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 06:42:57,897 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 200 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 06:42:57,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2025-02-08 06:42:57,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 109. [2025-02-08 06:42:57,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 79 states have (on average 1.379746835443038) internal successors, (109), 103 states have internal predecessors, (109), 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-02-08 06:42:57,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 115 transitions. [2025-02-08 06:42:57,903 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 115 transitions. Word has length 45 [2025-02-08 06:42:57,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:42:57,904 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 115 transitions. [2025-02-08 06:42:57,904 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 6.75) internal successors, (27), 6 states have internal predecessors, (27), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-02-08 06:42:57,904 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 115 transitions. [2025-02-08 06:42:57,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-02-08 06:42:57,904 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:42:57,904 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:42:57,904 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-08 06:42:57,904 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 59 more)] === [2025-02-08 06:42:57,904 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:42:57,904 INFO L85 PathProgramCache]: Analyzing trace with hash -1917518746, now seen corresponding path program 1 times [2025-02-08 06:42:57,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:42:57,905 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2132239946] [2025-02-08 06:42:57,905 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:42:57,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:42:57,919 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-02-08 06:42:57,926 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-02-08 06:42:57,926 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:42:57,926 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:42:58,052 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-02-08 06:42:58,052 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:42:58,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2132239946] [2025-02-08 06:42:58,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2132239946] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:42:58,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [533101062] [2025-02-08 06:42:58,052 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:42:58,052 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:42:58,053 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:42:58,056 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 06:42:58,066 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-02-08 06:42:58,163 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-02-08 06:42:58,195 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-02-08 06:42:58,195 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:42:58,195 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:42:58,200 INFO L256 TraceCheckSpWp]: Trace formula consists of 416 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-02-08 06:42:58,202 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:42:58,208 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-02-08 06:42:58,264 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-02-08 06:42:58,310 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2025-02-08 06:42:58,310 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-02-08 06:42:58,371 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 17 treesize of output 9 [2025-02-08 06:42:58,374 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 15 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-08 06:42:58,374 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 06:42:58,590 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 10 [2025-02-08 06:42:58,619 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 15 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-08 06:42:58,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [533101062] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 06:42:58,619 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 06:42:58,619 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 14, 14] total 22 [2025-02-08 06:42:58,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1648090189] [2025-02-08 06:42:58,620 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 06:42:58,620 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-02-08 06:42:58,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:42:58,621 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-02-08 06:42:58,622 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=448, Unknown=0, NotChecked=0, Total=506 [2025-02-08 06:42:58,622 INFO L87 Difference]: Start difference. First operand 109 states and 115 transitions. Second operand has 23 states, 22 states have (on average 3.3636363636363638) internal successors, (74), 18 states have internal predecessors, (74), 3 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) [2025-02-08 06:42:59,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:42:59,114 INFO L93 Difference]: Finished difference Result 140 states and 149 transitions. [2025-02-08 06:42:59,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-02-08 06:42:59,115 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 3.3636363636363638) internal successors, (74), 18 states have internal predecessors, (74), 3 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) Word has length 48 [2025-02-08 06:42:59,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:42:59,115 INFO L225 Difference]: With dead ends: 140 [2025-02-08 06:42:59,116 INFO L226 Difference]: Without dead ends: 140 [2025-02-08 06:42:59,116 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 79 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=116, Invalid=754, Unknown=0, NotChecked=0, Total=870 [2025-02-08 06:42:59,116 INFO L435 NwaCegarLoop]: 64 mSDtfsCounter, 90 mSDsluCounter, 839 mSDsCounter, 0 mSdLazyCounter, 934 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 903 SdHoareTripleChecker+Invalid, 959 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 934 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-08 06:42:59,116 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 903 Invalid, 959 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 934 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-08 06:42:59,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2025-02-08 06:42:59,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 111. [2025-02-08 06:42:59,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 84 states have (on average 1.3333333333333333) internal successors, (112), 105 states have internal predecessors, (112), 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-02-08 06:42:59,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 118 transitions. [2025-02-08 06:42:59,119 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 118 transitions. Word has length 48 [2025-02-08 06:42:59,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:42:59,119 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 118 transitions. [2025-02-08 06:42:59,119 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 3.3636363636363638) internal successors, (74), 18 states have internal predecessors, (74), 3 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) [2025-02-08 06:42:59,119 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 118 transitions. [2025-02-08 06:42:59,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-02-08 06:42:59,120 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:42:59,120 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:42:59,126 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-02-08 06:42:59,324 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:42:59,324 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 59 more)] === [2025-02-08 06:42:59,325 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:42:59,325 INFO L85 PathProgramCache]: Analyzing trace with hash -1917518745, now seen corresponding path program 1 times [2025-02-08 06:42:59,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:42:59,325 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [22358444] [2025-02-08 06:42:59,325 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:42:59,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:42:59,338 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-02-08 06:42:59,346 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-02-08 06:42:59,346 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:42:59,346 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:42:59,856 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 15 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 06:42:59,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:42:59,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [22358444] [2025-02-08 06:42:59,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [22358444] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:42:59,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1319700875] [2025-02-08 06:42:59,857 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:42:59,857 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:42:59,857 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:42:59,862 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 06:42:59,863 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-02-08 06:42:59,970 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-02-08 06:43:00,002 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-02-08 06:43:00,002 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:43:00,003 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:43:00,005 INFO L256 TraceCheckSpWp]: Trace formula consists of 416 conjuncts, 50 conjuncts are in the unsatisfiable core [2025-02-08 06:43:00,007 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:43:00,019 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-02-08 06:43:00,022 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-02-08 06:43:00,197 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-02-08 06:43:00,202 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-02-08 06:43:00,319 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2025-02-08 06:43:00,319 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-02-08 06:43:00,330 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2025-02-08 06:43:00,330 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-02-08 06:43:00,413 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 17 treesize of output 9 [2025-02-08 06:43:00,419 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 15 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-08 06:43:00,419 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 06:43:00,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1319700875] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:43:00,590 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-08 06:43:00,591 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 15] total 29 [2025-02-08 06:43:00,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [903735402] [2025-02-08 06:43:00,591 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-08 06:43:00,591 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-02-08 06:43:00,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:43:00,592 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-02-08 06:43:00,592 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=1021, Unknown=0, NotChecked=0, Total=1122 [2025-02-08 06:43:00,592 INFO L87 Difference]: Start difference. First operand 111 states and 118 transitions. Second operand has 30 states, 27 states have (on average 2.5555555555555554) internal successors, (69), 25 states have internal predecessors, (69), 3 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2025-02-08 06:43:01,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:43:01,305 INFO L93 Difference]: Finished difference Result 142 states and 150 transitions. [2025-02-08 06:43:01,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-02-08 06:43:01,305 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 27 states have (on average 2.5555555555555554) internal successors, (69), 25 states have internal predecessors, (69), 3 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Word has length 48 [2025-02-08 06:43:01,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:43:01,306 INFO L225 Difference]: With dead ends: 142 [2025-02-08 06:43:01,306 INFO L226 Difference]: Without dead ends: 142 [2025-02-08 06:43:01,307 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 49 SyntacticMatches, 1 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 328 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=180, Invalid=1800, Unknown=0, NotChecked=0, Total=1980 [2025-02-08 06:43:01,308 INFO L435 NwaCegarLoop]: 61 mSDtfsCounter, 148 mSDsluCounter, 709 mSDsCounter, 0 mSdLazyCounter, 1167 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 770 SdHoareTripleChecker+Invalid, 1175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 1167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-08 06:43:01,309 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 770 Invalid, 1175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 1167 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-08 06:43:01,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2025-02-08 06:43:01,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 113. [2025-02-08 06:43:01,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 86 states have (on average 1.313953488372093) internal successors, (113), 107 states have internal predecessors, (113), 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-02-08 06:43:01,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 119 transitions. [2025-02-08 06:43:01,311 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 119 transitions. Word has length 48 [2025-02-08 06:43:01,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:43:01,311 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 119 transitions. [2025-02-08 06:43:01,311 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 27 states have (on average 2.5555555555555554) internal successors, (69), 25 states have internal predecessors, (69), 3 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2025-02-08 06:43:01,311 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 119 transitions. [2025-02-08 06:43:01,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-02-08 06:43:01,312 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:43:01,313 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:43:01,319 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-02-08 06:43:01,517 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:43:01,517 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 59 more)] === [2025-02-08 06:43:01,517 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:43:01,517 INFO L85 PathProgramCache]: Analyzing trace with hash 1216557980, now seen corresponding path program 1 times [2025-02-08 06:43:01,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:43:01,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348624067] [2025-02-08 06:43:01,517 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:43:01,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:43:01,529 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-02-08 06:43:01,534 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-02-08 06:43:01,535 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:43:01,535 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:43:01,657 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-02-08 06:43:01,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:43:01,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1348624067] [2025-02-08 06:43:01,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1348624067] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:43:01,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [773489765] [2025-02-08 06:43:01,658 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:43:01,658 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:43:01,658 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:43:01,661 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 06:43:01,664 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-02-08 06:43:01,777 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-02-08 06:43:01,810 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-02-08 06:43:01,810 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:43:01,810 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:43:01,812 INFO L256 TraceCheckSpWp]: Trace formula consists of 413 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-02-08 06:43:01,814 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:43:01,819 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-02-08 06:43:01,840 WARN L873 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| (select |c_#valid| |node_create_~temp~0#1.base|))) (not (= |node_create_~temp~0#1.base| 0)))) is different from true [2025-02-08 06:43:01,859 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-02-08 06:43:01,883 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-02-08 06:43:01,910 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-02-08 06:43:01,955 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2025-02-08 06:43:01,956 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-02-08 06:43:01,971 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-02-08 06:43:01,971 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 06:43:02,216 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-02-08 06:43:02,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [773489765] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 06:43:02,216 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 06:43:02,217 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 7] total 20 [2025-02-08 06:43:02,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [349864338] [2025-02-08 06:43:02,217 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 06:43:02,217 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-02-08 06:43:02,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:43:02,217 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-02-08 06:43:02,218 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=280, Unknown=1, NotChecked=34, Total=380 [2025-02-08 06:43:02,218 INFO L87 Difference]: Start difference. First operand 113 states and 119 transitions. Second operand has 20 states, 20 states have (on average 3.9) internal successors, (78), 19 states have internal predecessors, (78), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2025-02-08 06:43:02,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:43:02,453 INFO L93 Difference]: Finished difference Result 98 states and 102 transitions. [2025-02-08 06:43:02,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-08 06:43:02,453 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 3.9) internal successors, (78), 19 states have internal predecessors, (78), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 48 [2025-02-08 06:43:02,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:43:02,454 INFO L225 Difference]: With dead ends: 98 [2025-02-08 06:43:02,454 INFO L226 Difference]: Without dead ends: 98 [2025-02-08 06:43:02,454 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 77 SyntacticMatches, 6 SemanticMatches, 24 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=123, Invalid=472, Unknown=9, NotChecked=46, Total=650 [2025-02-08 06:43:02,454 INFO L435 NwaCegarLoop]: 54 mSDtfsCounter, 214 mSDsluCounter, 447 mSDsCounter, 0 mSdLazyCounter, 406 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 214 SdHoareTripleChecker+Valid, 501 SdHoareTripleChecker+Invalid, 510 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 406 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 86 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 06:43:02,454 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [214 Valid, 501 Invalid, 510 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 406 Invalid, 0 Unknown, 86 Unchecked, 0.2s Time] [2025-02-08 06:43:02,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2025-02-08 06:43:02,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2025-02-08 06:43:02,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 73 states have (on average 1.3150684931506849) internal successors, (96), 92 states have internal predecessors, (96), 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-02-08 06:43:02,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 102 transitions. [2025-02-08 06:43:02,456 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 102 transitions. Word has length 48 [2025-02-08 06:43:02,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:43:02,456 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 102 transitions. [2025-02-08 06:43:02,456 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 3.9) internal successors, (78), 19 states have internal predecessors, (78), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2025-02-08 06:43:02,457 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 102 transitions. [2025-02-08 06:43:02,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-02-08 06:43:02,457 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:43:02,457 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:43:02,464 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-02-08 06:43:02,661 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2025-02-08 06:43:02,661 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 59 more)] === [2025-02-08 06:43:02,661 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:43:02,661 INFO L85 PathProgramCache]: Analyzing trace with hash -2040000454, now seen corresponding path program 1 times [2025-02-08 06:43:02,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:43:02,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1830991498] [2025-02-08 06:43:02,661 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:43:02,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:43:02,672 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-02-08 06:43:02,679 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-02-08 06:43:02,679 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:43:02,679 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:43:03,165 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 19 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-08 06:43:03,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:43:03,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1830991498] [2025-02-08 06:43:03,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1830991498] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:43:03,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1658454192] [2025-02-08 06:43:03,165 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:43:03,165 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:43:03,166 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:43:03,170 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 06:43:03,171 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-02-08 06:43:03,294 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-02-08 06:43:03,334 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-02-08 06:43:03,334 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:43:03,334 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:43:03,336 INFO L256 TraceCheckSpWp]: Trace formula consists of 447 conjuncts, 74 conjuncts are in the unsatisfiable core [2025-02-08 06:43:03,339 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:43:03,340 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-02-08 06:43:03,448 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-02-08 06:43:03,448 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-02-08 06:43:03,505 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-08 06:43:03,576 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-02-08 06:43:03,576 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 33 [2025-02-08 06:43:03,644 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 38 treesize of output 14 [2025-02-08 06:43:03,647 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-02-08 06:43:03,745 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 06:43:03,745 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 46 treesize of output 35 [2025-02-08 06:43:03,762 INFO L349 Elim1Store]: treesize reduction 88, result has 36.7 percent of original size [2025-02-08 06:43:03,763 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 40 treesize of output 60 [2025-02-08 06:43:03,879 INFO L349 Elim1Store]: treesize reduction 33, result has 48.4 percent of original size [2025-02-08 06:43:03,879 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 1 case distinctions, treesize of input 65 treesize of output 56 [2025-02-08 06:43:03,974 INFO L349 Elim1Store]: treesize reduction 25, result has 26.5 percent of original size [2025-02-08 06:43:03,974 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 104 treesize of output 88 [2025-02-08 06:43:03,993 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-02-08 06:43:04,110 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 152 treesize of output 104 [2025-02-08 06:43:04,114 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 75 [2025-02-08 06:43:04,321 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 79 treesize of output 51 [2025-02-08 06:43:04,531 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 9 proven. 13 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 06:43:04,531 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 06:43:04,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1658454192] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:43:04,784 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-08 06:43:04,784 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 26] total 44 [2025-02-08 06:43:04,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1952147040] [2025-02-08 06:43:04,785 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-08 06:43:04,785 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2025-02-08 06:43:04,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:43:04,785 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2025-02-08 06:43:04,786 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=2206, Unknown=1, NotChecked=0, Total=2352 [2025-02-08 06:43:04,786 INFO L87 Difference]: Start difference. First operand 98 states and 102 transitions. Second operand has 45 states, 42 states have (on average 2.142857142857143) internal successors, (90), 38 states have internal predecessors, (90), 4 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2025-02-08 06:43:06,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:43:06,303 INFO L93 Difference]: Finished difference Result 104 states and 111 transitions. [2025-02-08 06:43:06,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-02-08 06:43:06,303 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 42 states have (on average 2.142857142857143) internal successors, (90), 38 states have internal predecessors, (90), 4 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 54 [2025-02-08 06:43:06,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:43:06,304 INFO L225 Difference]: With dead ends: 104 [2025-02-08 06:43:06,304 INFO L226 Difference]: Without dead ends: 104 [2025-02-08 06:43:06,304 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 806 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=323, Invalid=3836, Unknown=1, NotChecked=0, Total=4160 [2025-02-08 06:43:06,305 INFO L435 NwaCegarLoop]: 49 mSDtfsCounter, 124 mSDsluCounter, 968 mSDsCounter, 0 mSdLazyCounter, 1625 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 1017 SdHoareTripleChecker+Invalid, 1636 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 1625 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-08 06:43:06,305 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 1017 Invalid, 1636 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 1625 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-08 06:43:06,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2025-02-08 06:43:06,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2025-02-08 06:43:06,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 79 states have (on average 1.3291139240506329) internal successors, (105), 98 states have internal predecessors, (105), 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-02-08 06:43:06,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 111 transitions. [2025-02-08 06:43:06,309 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 111 transitions. Word has length 54 [2025-02-08 06:43:06,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:43:06,309 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 111 transitions. [2025-02-08 06:43:06,309 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 42 states have (on average 2.142857142857143) internal successors, (90), 38 states have internal predecessors, (90), 4 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2025-02-08 06:43:06,309 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 111 transitions. [2025-02-08 06:43:06,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-02-08 06:43:06,309 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:43:06,309 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:43:06,316 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2025-02-08 06:43:06,510 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2025-02-08 06:43:06,510 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 59 more)] === [2025-02-08 06:43:06,510 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:43:06,510 INFO L85 PathProgramCache]: Analyzing trace with hash -2040000453, now seen corresponding path program 1 times [2025-02-08 06:43:06,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:43:06,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [47410280] [2025-02-08 06:43:06,510 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:43:06,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:43:06,523 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-02-08 06:43:06,531 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-02-08 06:43:06,531 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:43:06,531 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:43:07,147 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 15 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-08 06:43:07,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:43:07,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [47410280] [2025-02-08 06:43:07,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [47410280] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:43:07,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1309184207] [2025-02-08 06:43:07,148 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:43:07,148 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:43:07,148 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:43:07,151 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 06:43:07,152 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-02-08 06:43:07,271 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-02-08 06:43:07,315 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-02-08 06:43:07,315 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:43:07,315 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:43:07,318 INFO L256 TraceCheckSpWp]: Trace formula consists of 447 conjuncts, 124 conjuncts are in the unsatisfiable core [2025-02-08 06:43:07,323 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:43:07,326 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-02-08 06:43:07,329 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-02-08 06:43:07,596 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-02-08 06:43:07,596 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-02-08 06:43:07,605 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-02-08 06:43:07,681 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-08 06:43:07,686 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-08 06:43:07,792 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-02-08 06:43:07,792 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 59 treesize of output 52 [2025-02-08 06:43:07,795 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 24 treesize of output 11 [2025-02-08 06:43:07,886 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 43 treesize of output 19 [2025-02-08 06:43:07,889 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-02-08 06:43:07,893 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-02-08 06:43:07,895 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 11 treesize of output 3 [2025-02-08 06:43:08,156 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 06:43:08,157 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 51 treesize of output 34 [2025-02-08 06:43:08,169 INFO L349 Elim1Store]: treesize reduction 29, result has 46.3 percent of original size [2025-02-08 06:43:08,169 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 22 treesize of output 29 [2025-02-08 06:43:08,184 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2025-02-08 06:43:08,184 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-02-08 06:43:08,196 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2025-02-08 06:43:08,449 INFO L349 Elim1Store]: treesize reduction 25, result has 47.9 percent of original size [2025-02-08 06:43:08,449 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 1 case distinctions, treesize of input 53 treesize of output 48 [2025-02-08 06:43:08,463 INFO L349 Elim1Store]: treesize reduction 37, result has 22.9 percent of original size [2025-02-08 06:43:08,463 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 22 [2025-02-08 06:43:08,600 INFO L349 Elim1Store]: treesize reduction 25, result has 26.5 percent of original size [2025-02-08 06:43:08,601 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 95 treesize of output 79 [2025-02-08 06:43:08,616 INFO L349 Elim1Store]: treesize reduction 25, result has 26.5 percent of original size [2025-02-08 06:43:08,617 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 104 treesize of output 106 [2025-02-08 06:43:08,653 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-02-08 06:43:08,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 5 treesize of output 3 [2025-02-08 06:43:08,968 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 239 treesize of output 163 [2025-02-08 06:43:09,489 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 06:43:09,490 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 160 treesize of output 136 [2025-02-08 06:43:09,500 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 06:43:09,501 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 104 treesize of output 108 [2025-02-08 06:43:09,962 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 3 proven. 19 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 06:43:09,962 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 06:43:10,192 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse1 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (and (forall ((v_ArrVal_2014 (Array Int Int)) (v_ArrVal_2013 (Array Int Int))) (<= (+ 8 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_2013) .cse0) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_2014) .cse0) .cse1)))) (forall ((v_ArrVal_2013 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_2013) .cse0) .cse1) 4))))) is different from false [2025-02-08 06:43:10,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1309184207] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:43:10,851 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-08 06:43:10,851 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 27] total 47 [2025-02-08 06:43:10,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [767648931] [2025-02-08 06:43:10,851 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-08 06:43:10,851 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2025-02-08 06:43:10,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:43:10,852 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2025-02-08 06:43:10,852 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=154, Invalid=2869, Unknown=61, NotChecked=108, Total=3192 [2025-02-08 06:43:10,853 INFO L87 Difference]: Start difference. First operand 104 states and 111 transitions. Second operand has 48 states, 45 states have (on average 2.066666666666667) internal successors, (93), 40 states have internal predecessors, (93), 4 states have call successors, (5), 4 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2025-02-08 06:43:13,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:43:13,956 INFO L93 Difference]: Finished difference Result 108 states and 113 transitions. [2025-02-08 06:43:13,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2025-02-08 06:43:13,956 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 45 states have (on average 2.066666666666667) internal successors, (93), 40 states have internal predecessors, (93), 4 states have call successors, (5), 4 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 54 [2025-02-08 06:43:13,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:43:13,957 INFO L225 Difference]: With dead ends: 108 [2025-02-08 06:43:13,957 INFO L226 Difference]: Without dead ends: 108 [2025-02-08 06:43:13,958 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 829 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=351, Invalid=5288, Unknown=65, NotChecked=148, Total=5852 [2025-02-08 06:43:13,958 INFO L435 NwaCegarLoop]: 54 mSDtfsCounter, 136 mSDsluCounter, 1450 mSDsCounter, 0 mSdLazyCounter, 2236 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 1504 SdHoareTripleChecker+Invalid, 2243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 2236 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-02-08 06:43:13,958 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 1504 Invalid, 2243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 2236 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-02-08 06:43:13,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2025-02-08 06:43:13,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2025-02-08 06:43:13,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 83 states have (on average 1.2891566265060241) internal successors, (107), 102 states have internal predecessors, (107), 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-02-08 06:43:13,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 113 transitions. [2025-02-08 06:43:13,961 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 113 transitions. Word has length 54 [2025-02-08 06:43:13,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:43:13,961 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 113 transitions. [2025-02-08 06:43:13,964 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 45 states have (on average 2.066666666666667) internal successors, (93), 40 states have internal predecessors, (93), 4 states have call successors, (5), 4 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2025-02-08 06:43:13,965 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 113 transitions. [2025-02-08 06:43:13,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2025-02-08 06:43:13,965 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:43:13,965 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:43:13,974 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2025-02-08 06:43:14,167 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,13 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:43:14,167 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 59 more)] === [2025-02-08 06:43:14,167 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:43:14,167 INFO L85 PathProgramCache]: Analyzing trace with hash -316351034, now seen corresponding path program 1 times [2025-02-08 06:43:14,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:43:14,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1873595412] [2025-02-08 06:43:14,167 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:43:14,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:43:14,178 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-02-08 06:43:14,187 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-02-08 06:43:14,189 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:43:14,190 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:43:15,335 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 17 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:43:15,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:43:15,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1873595412] [2025-02-08 06:43:15,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1873595412] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:43:15,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [520269992] [2025-02-08 06:43:15,335 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:43:15,335 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:43:15,335 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:43:15,338 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 06:43:15,343 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-02-08 06:43:15,478 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-02-08 06:43:15,526 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-02-08 06:43:15,526 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:43:15,526 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:43:15,530 INFO L256 TraceCheckSpWp]: Trace formula consists of 470 conjuncts, 160 conjuncts are in the unsatisfiable core [2025-02-08 06:43:15,540 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:43:15,580 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-02-08 06:43:15,622 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-02-08 06:43:15,919 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-08 06:43:15,920 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 11 treesize of output 11 [2025-02-08 06:43:15,925 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-02-08 06:43:16,008 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-08 06:43:16,013 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-02-08 06:43:16,017 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 1 [2025-02-08 06:43:16,126 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2025-02-08 06:43:16,127 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 91 treesize of output 57 [2025-02-08 06:43:16,131 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 15 [2025-02-08 06:43:16,135 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 24 treesize of output 11 [2025-02-08 06:43:16,246 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2025-02-08 06:43:16,246 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 64 treesize of output 31 [2025-02-08 06:43:16,249 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-02-08 06:43:16,252 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 11 treesize of output 3 [2025-02-08 06:43:16,255 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 7 treesize of output 3 [2025-02-08 06:43:16,540 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 06:43:16,549 INFO L349 Elim1Store]: treesize reduction 29, result has 14.7 percent of original size [2025-02-08 06:43:16,549 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 72 treesize of output 55 [2025-02-08 06:43:16,580 INFO L349 Elim1Store]: treesize reduction 76, result has 36.1 percent of original size [2025-02-08 06:43:16,580 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 36 treesize of output 52 [2025-02-08 06:43:16,595 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 19 [2025-02-08 06:43:16,603 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2025-02-08 06:43:17,353 INFO L349 Elim1Store]: treesize reduction 52, result has 56.3 percent of original size [2025-02-08 06:43:17,353 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 94 treesize of output 111 [2025-02-08 06:43:17,373 INFO L349 Elim1Store]: treesize reduction 21, result has 41.7 percent of original size [2025-02-08 06:43:17,374 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 19 [2025-02-08 06:43:17,393 INFO L349 Elim1Store]: treesize reduction 29, result has 44.2 percent of original size [2025-02-08 06:43:17,394 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 27 [2025-02-08 06:43:18,313 INFO L349 Elim1Store]: treesize reduction 272, result has 50.3 percent of original size [2025-02-08 06:43:18,313 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 2 disjoint index pairs (out of 28 index pairs), introduced 9 new quantified variables, introduced 34 case distinctions, treesize of input 510 treesize of output 578 [2025-02-08 06:43:18,496 INFO L349 Elim1Store]: treesize reduction 144, result has 54.7 percent of original size [2025-02-08 06:43:18,496 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 20 case distinctions, treesize of input 442 treesize of output 582 [2025-02-08 06:43:18,558 INFO L349 Elim1Store]: treesize reduction 68, result has 38.7 percent of original size [2025-02-08 06:43:18,558 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 3 case distinctions, treesize of input 403 treesize of output 411