./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/list-simple/dll2c_insert_equal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/list-simple/dll2c_insert_equal.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 535caea86e22f289c2fcb0364594f5e7b1dfaabfa814e56099346e6a240c0067 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 10:37:10,505 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 10:37:10,561 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-02-06 10:37:10,567 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 10:37:10,567 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 10:37:10,590 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 10:37:10,592 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 10:37:10,592 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 10:37:10,592 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 10:37:10,592 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 10:37:10,593 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 10:37:10,593 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 10:37:10,594 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 10:37:10,594 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 10:37:10,594 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 10:37:10,594 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 10:37:10,595 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 10:37:10,595 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 10:37:10,595 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 10:37:10,595 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 10:37:10,595 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-02-06 10:37:10,595 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-02-06 10:37:10,595 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-02-06 10:37:10,595 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 10:37:10,595 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-06 10:37:10,595 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-06 10:37:10,595 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 10:37:10,595 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 10:37:10,595 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 10:37:10,596 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 10:37:10,596 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 10:37:10,596 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 10:37:10,596 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 10:37:10,596 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 10:37:10,596 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 10:37:10,596 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 10:37:10,596 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 10:37:10,596 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 10:37:10,597 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 10:37:10,597 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 10:37:10,597 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 10:37:10,597 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 10:37:10,597 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 -> 535caea86e22f289c2fcb0364594f5e7b1dfaabfa814e56099346e6a240c0067 [2025-02-06 10:37:10,817 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 10:37:10,825 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 10:37:10,826 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 10:37:10,827 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 10:37:10,827 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 10:37:10,828 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-simple/dll2c_insert_equal.i [2025-02-06 10:37:11,956 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4a46e464f/92944d7ed016414abe8f7d04c94f591a/FLAGe03b46f6e [2025-02-06 10:37:12,287 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 10:37:12,287 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/list-simple/dll2c_insert_equal.i [2025-02-06 10:37:12,301 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4a46e464f/92944d7ed016414abe8f7d04c94f591a/FLAGe03b46f6e [2025-02-06 10:37:12,532 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4a46e464f/92944d7ed016414abe8f7d04c94f591a [2025-02-06 10:37:12,534 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 10:37:12,535 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 10:37:12,536 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 10:37:12,536 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 10:37:12,539 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 10:37:12,539 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 10:37:12" (1/1) ... [2025-02-06 10:37:12,540 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4d7ff13c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:37:12, skipping insertion in model container [2025-02-06 10:37:12,540 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 10:37:12" (1/1) ... [2025-02-06 10:37:12,565 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 10:37:12,746 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 10:37:12,753 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 10:37:12,782 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 10:37:12,799 INFO L204 MainTranslator]: Completed translation [2025-02-06 10:37:12,799 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:37:12 WrapperNode [2025-02-06 10:37:12,800 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 10:37:12,800 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 10:37:12,801 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 10:37:12,801 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 10:37:12,805 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:37:12" (1/1) ... [2025-02-06 10:37:12,813 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:37:12" (1/1) ... [2025-02-06 10:37:12,826 INFO L138 Inliner]: procedures = 127, calls = 54, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 154 [2025-02-06 10:37:12,827 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 10:37:12,827 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 10:37:12,827 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 10:37:12,827 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 10:37:12,832 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:37:12" (1/1) ... [2025-02-06 10:37:12,833 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:37:12" (1/1) ... [2025-02-06 10:37:12,835 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:37:12" (1/1) ... [2025-02-06 10:37:12,851 INFO L175 MemorySlicer]: Split 35 memory accesses to 3 slices as follows [2, 22, 11]. 63 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 0, 1]. The 18 writes are split as follows [0, 17, 1]. [2025-02-06 10:37:12,851 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:37:12" (1/1) ... [2025-02-06 10:37:12,851 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:37:12" (1/1) ... [2025-02-06 10:37:12,861 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:37:12" (1/1) ... [2025-02-06 10:37:12,862 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:37:12" (1/1) ... [2025-02-06 10:37:12,863 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:37:12" (1/1) ... [2025-02-06 10:37:12,863 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:37:12" (1/1) ... [2025-02-06 10:37:12,865 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 10:37:12,866 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 10:37:12,866 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 10:37:12,866 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 10:37:12,867 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:37:12" (1/1) ... [2025-02-06 10:37:12,882 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 10:37:12,891 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:37:12,911 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 10:37:12,916 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 10:37:12,934 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-06 10:37:12,934 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-06 10:37:12,934 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-06 10:37:12,934 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-06 10:37:12,935 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-06 10:37:12,935 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-06 10:37:12,935 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2025-02-06 10:37:12,935 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2025-02-06 10:37:12,935 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-06 10:37:12,935 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 10:37:12,935 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-06 10:37:12,935 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-02-06 10:37:12,935 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-02-06 10:37:12,935 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-02-06 10:37:12,935 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-02-06 10:37:12,936 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-02-06 10:37:12,936 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-02-06 10:37:12,936 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-06 10:37:12,936 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-02-06 10:37:12,936 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-02-06 10:37:12,936 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-02-06 10:37:12,936 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 10:37:12,936 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-06 10:37:12,936 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-06 10:37:12,936 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 10:37:12,937 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 10:37:13,046 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 10:37:13,048 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 10:37:13,357 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L642: 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-06 10:37:13,374 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint myexit_returnLabel#1: havoc myexit_~s#1;havoc myexit_#in~s#1;assume { :end_inline_myexit } true; [2025-02-06 10:37:13,388 INFO L? ?]: Removed 174 outVars from TransFormulas that were not future-live. [2025-02-06 10:37:13,389 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 10:37:13,400 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 10:37:13,402 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 10:37:13,402 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 10:37:13 BoogieIcfgContainer [2025-02-06 10:37:13,402 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 10:37:13,404 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 10:37:13,404 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 10:37:13,407 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 10:37:13,408 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 10:37:12" (1/3) ... [2025-02-06 10:37:13,410 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ea3909a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 10:37:13, skipping insertion in model container [2025-02-06 10:37:13,410 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:37:12" (2/3) ... [2025-02-06 10:37:13,410 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ea3909a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 10:37:13, skipping insertion in model container [2025-02-06 10:37:13,410 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 10:37:13" (3/3) ... [2025-02-06 10:37:13,411 INFO L128 eAbstractionObserver]: Analyzing ICFG dll2c_insert_equal.i [2025-02-06 10:37:13,420 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 10:37:13,421 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG dll2c_insert_equal.i that has 2 procedures, 158 locations, 1 initial locations, 4 loop locations, and 72 error locations. [2025-02-06 10:37:13,448 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 10:37:13,455 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;@53627b19, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 10:37:13,455 INFO L334 AbstractCegarLoop]: Starting to check reachability of 72 error locations. [2025-02-06 10:37:13,458 INFO L276 IsEmpty]: Start isEmpty. Operand has 158 states, 81 states have (on average 2.049382716049383) internal successors, (166), 153 states have internal predecessors, (166), 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-06 10:37:13,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-02-06 10:37:13,461 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:37:13,462 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-02-06 10:37:13,462 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting node_createErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 69 more)] === [2025-02-06 10:37:13,465 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:37:13,465 INFO L85 PathProgramCache]: Analyzing trace with hash 1266499956, now seen corresponding path program 1 times [2025-02-06 10:37:13,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:37:13,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1497686979] [2025-02-06 10:37:13,471 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:37:13,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:37:13,520 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-06 10:37:13,530 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-06 10:37:13,530 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:37:13,531 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:37:13,608 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:37:13,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:37:13,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1497686979] [2025-02-06 10:37:13,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1497686979] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:37:13,609 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:37:13,609 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 10:37:13,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [290140766] [2025-02-06 10:37:13,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:37:13,612 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 10:37:13,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:37:13,640 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 10:37:13,640 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 10:37:13,642 INFO L87 Difference]: Start difference. First operand has 158 states, 81 states have (on average 2.049382716049383) internal successors, (166), 153 states have internal predecessors, (166), 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.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:37:13,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:37:13,751 INFO L93 Difference]: Finished difference Result 154 states and 165 transitions. [2025-02-06 10:37:13,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 10:37:13,752 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2025-02-06 10:37:13,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:37:13,757 INFO L225 Difference]: With dead ends: 154 [2025-02-06 10:37:13,757 INFO L226 Difference]: Without dead ends: 151 [2025-02-06 10:37:13,758 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-06 10:37:13,760 INFO L435 NwaCegarLoop]: 156 mSDtfsCounter, 3 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 244 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:37:13,760 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 244 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 10:37:13,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2025-02-06 10:37:13,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 151. [2025-02-06 10:37:13,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 78 states have (on average 1.9871794871794872) internal successors, (155), 146 states have internal predecessors, (155), 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-06 10:37:13,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 161 transitions. [2025-02-06 10:37:13,786 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 161 transitions. Word has length 6 [2025-02-06 10:37:13,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:37:13,787 INFO L471 AbstractCegarLoop]: Abstraction has 151 states and 161 transitions. [2025-02-06 10:37:13,787 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:37:13,787 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 161 transitions. [2025-02-06 10:37:13,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-02-06 10:37:13,787 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:37:13,787 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-02-06 10:37:13,787 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 10:37:13,788 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting node_createErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 69 more)] === [2025-02-06 10:37:13,788 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:37:13,788 INFO L85 PathProgramCache]: Analyzing trace with hash 1266499957, now seen corresponding path program 1 times [2025-02-06 10:37:13,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:37:13,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [550558876] [2025-02-06 10:37:13,788 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:37:13,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:37:13,794 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-06 10:37:13,801 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-06 10:37:13,801 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:37:13,801 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:37:13,889 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:37:13,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:37:13,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [550558876] [2025-02-06 10:37:13,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [550558876] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:37:13,890 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:37:13,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 10:37:13,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1467241465] [2025-02-06 10:37:13,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:37:13,890 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 10:37:13,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:37:13,891 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 10:37:13,891 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 10:37:13,891 INFO L87 Difference]: Start difference. First operand 151 states and 161 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:37:13,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:37:13,969 INFO L93 Difference]: Finished difference Result 148 states and 158 transitions. [2025-02-06 10:37:13,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 10:37:13,970 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2025-02-06 10:37:13,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:37:13,970 INFO L225 Difference]: With dead ends: 148 [2025-02-06 10:37:13,970 INFO L226 Difference]: Without dead ends: 148 [2025-02-06 10:37:13,971 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-06 10:37:13,971 INFO L435 NwaCegarLoop]: 153 mSDtfsCounter, 3 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 245 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:37:13,971 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 245 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 10:37:13,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2025-02-06 10:37:13,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 148. [2025-02-06 10:37:13,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 78 states have (on average 1.9487179487179487) internal successors, (152), 143 states have internal predecessors, (152), 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-06 10:37:13,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 158 transitions. [2025-02-06 10:37:13,977 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 158 transitions. Word has length 6 [2025-02-06 10:37:13,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:37:13,977 INFO L471 AbstractCegarLoop]: Abstraction has 148 states and 158 transitions. [2025-02-06 10:37:13,977 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:37:13,977 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 158 transitions. [2025-02-06 10:37:13,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-02-06 10:37:13,977 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:37:13,978 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:37:13,978 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 10:37:13,978 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr60REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 69 more)] === [2025-02-06 10:37:13,978 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:37:13,978 INFO L85 PathProgramCache]: Analyzing trace with hash 1702144598, now seen corresponding path program 1 times [2025-02-06 10:37:13,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:37:13,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1607357341] [2025-02-06 10:37:13,978 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:37:13,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:37:13,987 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-02-06 10:37:13,994 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-02-06 10:37:13,994 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:37:13,994 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:37:14,040 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:37:14,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:37:14,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1607357341] [2025-02-06 10:37:14,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1607357341] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:37:14,040 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:37:14,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 10:37:14,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2009312904] [2025-02-06 10:37:14,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:37:14,040 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 10:37:14,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:37:14,041 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 10:37:14,041 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 10:37:14,041 INFO L87 Difference]: Start difference. First operand 148 states and 158 transitions. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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-06 10:37:14,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:37:14,056 INFO L93 Difference]: Finished difference Result 159 states and 171 transitions. [2025-02-06 10:37:14,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 10:37:14,060 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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 14 [2025-02-06 10:37:14,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:37:14,060 INFO L225 Difference]: With dead ends: 159 [2025-02-06 10:37:14,060 INFO L226 Difference]: Without dead ends: 159 [2025-02-06 10:37:14,061 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 10:37:14,061 INFO L435 NwaCegarLoop]: 156 mSDtfsCounter, 10 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 307 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-06 10:37:14,061 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 307 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 10:37:14,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2025-02-06 10:37:14,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 149. [2025-02-06 10:37:14,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 79 states have (on average 1.9367088607594938) internal successors, (153), 144 states have internal predecessors, (153), 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-06 10:37:14,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 159 transitions. [2025-02-06 10:37:14,074 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 159 transitions. Word has length 14 [2025-02-06 10:37:14,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:37:14,074 INFO L471 AbstractCegarLoop]: Abstraction has 149 states and 159 transitions. [2025-02-06 10:37:14,074 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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-06 10:37:14,074 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 159 transitions. [2025-02-06 10:37:14,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-02-06 10:37:14,074 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:37:14,074 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:37:14,074 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 10:37:14,074 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr64REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 69 more)] === [2025-02-06 10:37:14,075 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:37:14,075 INFO L85 PathProgramCache]: Analyzing trace with hash -1366614308, now seen corresponding path program 1 times [2025-02-06 10:37:14,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:37:14,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337279936] [2025-02-06 10:37:14,075 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:37:14,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:37:14,090 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-02-06 10:37:14,099 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-02-06 10:37:14,099 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:37:14,099 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:37:14,193 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-06 10:37:14,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:37:14,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1337279936] [2025-02-06 10:37:14,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1337279936] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:37:14,193 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:37:14,194 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 10:37:14,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [788009000] [2025-02-06 10:37:14,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:37:14,194 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 10:37:14,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:37:14,194 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 10:37:14,195 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 10:37:14,195 INFO L87 Difference]: Start difference. First operand 149 states and 159 transitions. Second operand has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 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-06 10:37:14,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:37:14,366 INFO L93 Difference]: Finished difference Result 148 states and 158 transitions. [2025-02-06 10:37:14,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 10:37:14,366 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 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 24 [2025-02-06 10:37:14,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:37:14,367 INFO L225 Difference]: With dead ends: 148 [2025-02-06 10:37:14,367 INFO L226 Difference]: Without dead ends: 148 [2025-02-06 10:37:14,368 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-06 10:37:14,368 INFO L435 NwaCegarLoop]: 146 mSDtfsCounter, 7 mSDsluCounter, 314 mSDsCounter, 0 mSdLazyCounter, 310 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 460 SdHoareTripleChecker+Invalid, 311 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 310 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 10:37:14,368 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 460 Invalid, 311 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 310 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 10:37:14,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2025-02-06 10:37:14,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 148. [2025-02-06 10:37:14,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 79 states have (on average 1.9240506329113924) internal successors, (152), 143 states have internal predecessors, (152), 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-06 10:37:14,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 158 transitions. [2025-02-06 10:37:14,373 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 158 transitions. Word has length 24 [2025-02-06 10:37:14,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:37:14,373 INFO L471 AbstractCegarLoop]: Abstraction has 148 states and 158 transitions. [2025-02-06 10:37:14,373 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 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-06 10:37:14,374 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 158 transitions. [2025-02-06 10:37:14,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-02-06 10:37:14,374 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:37:14,374 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:37:14,374 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 10:37:14,374 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr65REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 69 more)] === [2025-02-06 10:37:14,375 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:37:14,375 INFO L85 PathProgramCache]: Analyzing trace with hash -1366614307, now seen corresponding path program 1 times [2025-02-06 10:37:14,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:37:14,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1026532940] [2025-02-06 10:37:14,375 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:37:14,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:37:14,385 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-02-06 10:37:14,394 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-02-06 10:37:14,394 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:37:14,394 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:37:14,616 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 10:37:14,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:37:14,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1026532940] [2025-02-06 10:37:14,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1026532940] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:37:14,617 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:37:14,617 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 10:37:14,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475892621] [2025-02-06 10:37:14,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:37:14,617 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 10:37:14,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:37:14,618 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 10:37:14,618 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 10:37:14,618 INFO L87 Difference]: Start difference. First operand 148 states and 158 transitions. Second operand has 6 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 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-06 10:37:14,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:37:14,775 INFO L93 Difference]: Finished difference Result 147 states and 157 transitions. [2025-02-06 10:37:14,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 10:37:14,776 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 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 24 [2025-02-06 10:37:14,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:37:14,777 INFO L225 Difference]: With dead ends: 147 [2025-02-06 10:37:14,777 INFO L226 Difference]: Without dead ends: 147 [2025-02-06 10:37:14,777 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-06 10:37:14,778 INFO L435 NwaCegarLoop]: 146 mSDtfsCounter, 6 mSDsluCounter, 338 mSDsCounter, 0 mSdLazyCounter, 281 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 484 SdHoareTripleChecker+Invalid, 281 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 281 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:37:14,778 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 484 Invalid, 281 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 281 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 10:37:14,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2025-02-06 10:37:14,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 147. [2025-02-06 10:37:14,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 79 states have (on average 1.9113924050632911) internal successors, (151), 142 states have internal predecessors, (151), 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-06 10:37:14,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 157 transitions. [2025-02-06 10:37:14,786 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 157 transitions. Word has length 24 [2025-02-06 10:37:14,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:37:14,786 INFO L471 AbstractCegarLoop]: Abstraction has 147 states and 157 transitions. [2025-02-06 10:37:14,786 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 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-06 10:37:14,787 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 157 transitions. [2025-02-06 10:37:14,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-02-06 10:37:14,787 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:37:14,787 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:37:14,787 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 10:37:14,787 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr62REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 69 more)] === [2025-02-06 10:37:14,788 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:37:14,788 INFO L85 PathProgramCache]: Analyzing trace with hash 943646297, now seen corresponding path program 1 times [2025-02-06 10:37:14,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:37:14,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [685979434] [2025-02-06 10:37:14,788 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:37:14,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:37:14,810 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-02-06 10:37:14,822 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-02-06 10:37:14,822 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:37:14,822 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:37:15,049 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:37:15,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:37:15,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [685979434] [2025-02-06 10:37:15,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [685979434] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:37:15,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [843196201] [2025-02-06 10:37:15,051 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:37:15,051 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:37:15,051 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:37:15,054 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 10:37:15,056 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-06 10:37:15,120 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-02-06 10:37:15,154 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-02-06 10:37:15,155 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:37:15,155 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:37:15,157 INFO L256 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-02-06 10:37:15,160 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:37:15,182 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-06 10:37:15,250 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-02-06 10:37:15,250 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-06 10:37:15,298 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-06 10:37:15,298 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:37:15,507 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-06 10:37:15,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [843196201] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 10:37:15,507 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 10:37:15,508 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 10] total 17 [2025-02-06 10:37:15,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1445972435] [2025-02-06 10:37:15,508 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 10:37:15,508 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-02-06 10:37:15,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:37:15,509 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-02-06 10:37:15,509 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=248, Unknown=0, NotChecked=0, Total=306 [2025-02-06 10:37:15,509 INFO L87 Difference]: Start difference. First operand 147 states and 157 transitions. Second operand has 18 states, 17 states have (on average 2.235294117647059) internal successors, (38), 13 states have internal predecessors, (38), 2 states have call successors, (3), 3 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) [2025-02-06 10:37:15,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:37:15,876 INFO L93 Difference]: Finished difference Result 152 states and 165 transitions. [2025-02-06 10:37:15,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 10:37:15,876 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 2.235294117647059) internal successors, (38), 13 states have internal predecessors, (38), 2 states have call successors, (3), 3 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) Word has length 26 [2025-02-06 10:37:15,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:37:15,878 INFO L225 Difference]: With dead ends: 152 [2025-02-06 10:37:15,878 INFO L226 Difference]: Without dead ends: 152 [2025-02-06 10:37:15,878 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=276, Unknown=0, NotChecked=0, Total=342 [2025-02-06 10:37:15,878 INFO L435 NwaCegarLoop]: 142 mSDtfsCounter, 3 mSDsluCounter, 662 mSDsCounter, 0 mSdLazyCounter, 724 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 804 SdHoareTripleChecker+Invalid, 743 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 724 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 10:37:15,878 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 804 Invalid, 743 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 724 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 10:37:15,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2025-02-06 10:37:15,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 152. [2025-02-06 10:37:15,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 83 states have (on average 1.891566265060241) internal successors, (157), 146 states have internal predecessors, (157), 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-06 10:37:15,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 165 transitions. [2025-02-06 10:37:15,882 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 165 transitions. Word has length 26 [2025-02-06 10:37:15,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:37:15,882 INFO L471 AbstractCegarLoop]: Abstraction has 152 states and 165 transitions. [2025-02-06 10:37:15,882 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 2.235294117647059) internal successors, (38), 13 states have internal predecessors, (38), 2 states have call successors, (3), 3 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) [2025-02-06 10:37:15,882 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 165 transitions. [2025-02-06 10:37:15,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-02-06 10:37:15,883 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:37:15,883 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:37:15,889 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-06 10:37:16,087 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-06 10:37:16,087 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr63REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 69 more)] === [2025-02-06 10:37:16,088 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:37:16,088 INFO L85 PathProgramCache]: Analyzing trace with hash 943646298, now seen corresponding path program 1 times [2025-02-06 10:37:16,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:37:16,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1483411756] [2025-02-06 10:37:16,089 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:37:16,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:37:16,105 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-02-06 10:37:16,123 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-02-06 10:37:16,123 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:37:16,123 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:37:16,450 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-06 10:37:16,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:37:16,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1483411756] [2025-02-06 10:37:16,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1483411756] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:37:16,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1246727816] [2025-02-06 10:37:16,450 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:37:16,450 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:37:16,451 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:37:16,452 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 10:37:16,454 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-06 10:37:16,507 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-02-06 10:37:16,531 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-02-06 10:37:16,531 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:37:16,531 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:37:16,532 INFO L256 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-02-06 10:37:16,534 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:37:16,541 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-06 10:37:16,546 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-06 10:37:16,606 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-06 10:37:16,638 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 10:37:16,639 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-06 10:37:16,644 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-06 10:37:16,644 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-06 10:37:16,655 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 7 not checked. [2025-02-06 10:37:16,655 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:37:16,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1246727816] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:37:16,752 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-06 10:37:16,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 11 [2025-02-06 10:37:16,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [324802257] [2025-02-06 10:37:16,752 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-06 10:37:16,752 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-06 10:37:16,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:37:16,753 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-06 10:37:16,753 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=127, Unknown=1, NotChecked=22, Total=182 [2025-02-06 10:37:16,753 INFO L87 Difference]: Start difference. First operand 152 states and 165 transitions. Second operand has 12 states, 11 states have (on average 2.909090909090909) internal successors, (32), 10 states have internal predecessors, (32), 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-06 10:37:17,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:37:17,049 INFO L93 Difference]: Finished difference Result 152 states and 164 transitions. [2025-02-06 10:37:17,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 10:37:17,050 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.909090909090909) internal successors, (32), 10 states have internal predecessors, (32), 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 26 [2025-02-06 10:37:17,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:37:17,050 INFO L225 Difference]: With dead ends: 152 [2025-02-06 10:37:17,051 INFO L226 Difference]: Without dead ends: 152 [2025-02-06 10:37:17,051 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=171, Unknown=1, NotChecked=26, Total=240 [2025-02-06 10:37:17,051 INFO L435 NwaCegarLoop]: 144 mSDtfsCounter, 0 mSDsluCounter, 345 mSDsCounter, 0 mSdLazyCounter, 444 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 489 SdHoareTripleChecker+Invalid, 607 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 444 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 157 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 10:37:17,051 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 489 Invalid, 607 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 444 Invalid, 0 Unknown, 157 Unchecked, 0.2s Time] [2025-02-06 10:37:17,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2025-02-06 10:37:17,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 152. [2025-02-06 10:37:17,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 83 states have (on average 1.8795180722891567) internal successors, (156), 146 states have internal predecessors, (156), 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-06 10:37:17,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 164 transitions. [2025-02-06 10:37:17,055 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 164 transitions. Word has length 26 [2025-02-06 10:37:17,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:37:17,055 INFO L471 AbstractCegarLoop]: Abstraction has 152 states and 164 transitions. [2025-02-06 10:37:17,055 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.909090909090909) internal successors, (32), 10 states have internal predecessors, (32), 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-06 10:37:17,055 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 164 transitions. [2025-02-06 10:37:17,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-02-06 10:37:17,056 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:37:17,056 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:37:17,062 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-02-06 10:37:17,256 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-06 10:37:17,257 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr60REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 69 more)] === [2025-02-06 10:37:17,257 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:37:17,257 INFO L85 PathProgramCache]: Analyzing trace with hash 606024744, now seen corresponding path program 1 times [2025-02-06 10:37:17,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:37:17,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [67598394] [2025-02-06 10:37:17,257 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:37:17,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:37:17,266 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-02-06 10:37:17,271 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-02-06 10:37:17,271 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:37:17,271 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:37:17,337 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 10:37:17,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:37:17,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [67598394] [2025-02-06 10:37:17,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [67598394] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:37:17,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [197737050] [2025-02-06 10:37:17,337 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:37:17,337 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:37:17,338 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:37:17,339 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 10:37:17,343 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-06 10:37:17,430 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-02-06 10:37:17,452 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-02-06 10:37:17,452 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:37:17,452 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:37:17,453 INFO L256 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-02-06 10:37:17,455 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:37:17,470 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 10:37:17,471 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:37:17,502 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 10:37:17,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [197737050] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 10:37:17,502 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 10:37:17,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 6 [2025-02-06 10:37:17,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1901140415] [2025-02-06 10:37:17,502 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 10:37:17,502 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 10:37:17,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:37:17,503 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 10:37:17,503 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 10:37:17,503 INFO L87 Difference]: Start difference. First operand 152 states and 164 transitions. Second operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-06 10:37:17,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:37:17,533 INFO L93 Difference]: Finished difference Result 152 states and 163 transitions. [2025-02-06 10:37:17,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 10:37:17,534 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 28 [2025-02-06 10:37:17,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:37:17,534 INFO L225 Difference]: With dead ends: 152 [2025-02-06 10:37:17,535 INFO L226 Difference]: Without dead ends: 152 [2025-02-06 10:37:17,535 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 56 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-06 10:37:17,535 INFO L435 NwaCegarLoop]: 147 mSDtfsCounter, 1 mSDsluCounter, 572 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 719 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 10:37:17,535 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 719 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 10:37:17,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2025-02-06 10:37:17,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 152. [2025-02-06 10:37:17,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 83 states have (on average 1.8674698795180722) internal successors, (155), 146 states have internal predecessors, (155), 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-06 10:37:17,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 163 transitions. [2025-02-06 10:37:17,542 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 163 transitions. Word has length 28 [2025-02-06 10:37:17,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:37:17,542 INFO L471 AbstractCegarLoop]: Abstraction has 152 states and 163 transitions. [2025-02-06 10:37:17,542 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-06 10:37:17,542 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 163 transitions. [2025-02-06 10:37:17,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-02-06 10:37:17,543 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:37:17,543 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:37:17,549 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-02-06 10:37:17,747 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-06 10:37:17,747 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr60REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 69 more)] === [2025-02-06 10:37:17,748 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:37:17,748 INFO L85 PathProgramCache]: Analyzing trace with hash 1605993192, now seen corresponding path program 1 times [2025-02-06 10:37:17,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:37:17,748 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807388488] [2025-02-06 10:37:17,748 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:37:17,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:37:17,757 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-02-06 10:37:17,762 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-02-06 10:37:17,762 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:37:17,762 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:37:17,815 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-02-06 10:37:17,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:37:17,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1807388488] [2025-02-06 10:37:17,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1807388488] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:37:17,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [399520019] [2025-02-06 10:37:17,815 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:37:17,816 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:37:17,816 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:37:17,820 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-06 10:37:17,821 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-06 10:37:17,888 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-02-06 10:37:17,914 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-02-06 10:37:17,914 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:37:17,914 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:37:17,918 INFO L256 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-02-06 10:37:17,919 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:37:17,926 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-06 10:37:17,970 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-06 10:37:18,008 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-02-06 10:37:18,008 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-06 10:37:18,017 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 7 not checked. [2025-02-06 10:37:18,017 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:37:18,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [399520019] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:37:18,058 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-06 10:37:18,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 7] total 9 [2025-02-06 10:37:18,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1558601792] [2025-02-06 10:37:18,058 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-06 10:37:18,058 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-06 10:37:18,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:37:18,059 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-06 10:37:18,059 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=72, Unknown=1, NotChecked=16, Total=110 [2025-02-06 10:37:18,059 INFO L87 Difference]: Start difference. First operand 152 states and 163 transitions. Second operand has 10 states, 9 states have (on average 4.222222222222222) internal successors, (38), 8 states have internal predecessors, (38), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-02-06 10:37:18,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:37:18,315 INFO L93 Difference]: Finished difference Result 151 states and 162 transitions. [2025-02-06 10:37:18,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 10:37:18,315 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.222222222222222) internal successors, (38), 8 states have internal predecessors, (38), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 29 [2025-02-06 10:37:18,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:37:18,316 INFO L225 Difference]: With dead ends: 151 [2025-02-06 10:37:18,316 INFO L226 Difference]: Without dead ends: 151 [2025-02-06 10:37:18,316 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=126, Unknown=1, NotChecked=22, Total=182 [2025-02-06 10:37:18,316 INFO L435 NwaCegarLoop]: 139 mSDtfsCounter, 9 mSDsluCounter, 450 mSDsCounter, 0 mSdLazyCounter, 469 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 589 SdHoareTripleChecker+Invalid, 627 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 469 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 155 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 10:37:18,316 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 589 Invalid, 627 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 469 Invalid, 0 Unknown, 155 Unchecked, 0.2s Time] [2025-02-06 10:37:18,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2025-02-06 10:37:18,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 151. [2025-02-06 10:37:18,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 83 states have (on average 1.855421686746988) internal successors, (154), 145 states have internal predecessors, (154), 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-06 10:37:18,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 162 transitions. [2025-02-06 10:37:18,323 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 162 transitions. Word has length 29 [2025-02-06 10:37:18,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:37:18,323 INFO L471 AbstractCegarLoop]: Abstraction has 151 states and 162 transitions. [2025-02-06 10:37:18,323 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.222222222222222) internal successors, (38), 8 states have internal predecessors, (38), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-02-06 10:37:18,324 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 162 transitions. [2025-02-06 10:37:18,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-02-06 10:37:18,324 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:37:18,324 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:37:18,334 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-06 10:37:18,524 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-06 10:37:18,525 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr61REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 69 more)] === [2025-02-06 10:37:18,525 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:37:18,525 INFO L85 PathProgramCache]: Analyzing trace with hash 1605993193, now seen corresponding path program 1 times [2025-02-06 10:37:18,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:37:18,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [523999145] [2025-02-06 10:37:18,526 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:37:18,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:37:18,535 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-02-06 10:37:18,546 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-02-06 10:37:18,548 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:37:18,548 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:37:18,669 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 10:37:18,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:37:18,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [523999145] [2025-02-06 10:37:18,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [523999145] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:37:18,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [830080903] [2025-02-06 10:37:18,669 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:37:18,669 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:37:18,669 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:37:18,671 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-06 10:37:18,673 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-06 10:37:18,736 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-02-06 10:37:18,757 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-02-06 10:37:18,757 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:37:18,757 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:37:18,761 INFO L256 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-02-06 10:37:18,762 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:37:18,837 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 10:37:18,837 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:37:18,864 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 10:37:18,864 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 19 treesize of output 23 [2025-02-06 10:37:18,963 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 10:37:18,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [830080903] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 10:37:18,963 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 10:37:18,964 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 13 [2025-02-06 10:37:18,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1157171539] [2025-02-06 10:37:18,964 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 10:37:18,964 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-02-06 10:37:18,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:37:18,964 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-02-06 10:37:18,964 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2025-02-06 10:37:18,964 INFO L87 Difference]: Start difference. First operand 151 states and 162 transitions. Second operand has 14 states, 13 states have (on average 3.6153846153846154) internal successors, (47), 12 states have internal predecessors, (47), 4 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2025-02-06 10:37:19,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:37:19,147 INFO L93 Difference]: Finished difference Result 158 states and 171 transitions. [2025-02-06 10:37:19,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 10:37:19,147 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 3.6153846153846154) internal successors, (47), 12 states have internal predecessors, (47), 4 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) Word has length 29 [2025-02-06 10:37:19,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:37:19,148 INFO L225 Difference]: With dead ends: 158 [2025-02-06 10:37:19,149 INFO L226 Difference]: Without dead ends: 158 [2025-02-06 10:37:19,149 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 48 SyntacticMatches, 3 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2025-02-06 10:37:19,149 INFO L435 NwaCegarLoop]: 146 mSDtfsCounter, 9 mSDsluCounter, 1098 mSDsCounter, 0 mSdLazyCounter, 312 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 1244 SdHoareTripleChecker+Invalid, 313 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 312 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 10:37:19,149 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 1244 Invalid, 313 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 312 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 10:37:19,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2025-02-06 10:37:19,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 154. [2025-02-06 10:37:19,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 86 states have (on average 1.8372093023255813) internal successors, (158), 148 states have internal predecessors, (158), 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-06 10:37:19,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 166 transitions. [2025-02-06 10:37:19,152 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 166 transitions. Word has length 29 [2025-02-06 10:37:19,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:37:19,153 INFO L471 AbstractCegarLoop]: Abstraction has 154 states and 166 transitions. [2025-02-06 10:37:19,153 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 3.6153846153846154) internal successors, (47), 12 states have internal predecessors, (47), 4 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2025-02-06 10:37:19,153 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 166 transitions. [2025-02-06 10:37:19,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-02-06 10:37:19,153 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:37:19,153 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:37:19,161 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-02-06 10:37:19,358 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-06 10:37:19,358 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr58REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 69 more)] === [2025-02-06 10:37:19,358 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:37:19,359 INFO L85 PathProgramCache]: Analyzing trace with hash -1753818494, now seen corresponding path program 1 times [2025-02-06 10:37:19,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:37:19,359 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [451869253] [2025-02-06 10:37:19,359 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:37:19,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:37:19,368 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-02-06 10:37:19,372 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-02-06 10:37:19,372 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:37:19,372 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:37:19,425 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-06 10:37:19,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:37:19,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [451869253] [2025-02-06 10:37:19,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [451869253] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:37:19,426 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:37:19,426 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 10:37:19,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [996482930] [2025-02-06 10:37:19,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:37:19,426 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 10:37:19,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:37:19,427 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 10:37:19,427 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-06 10:37:19,427 INFO L87 Difference]: Start difference. First operand 154 states and 166 transitions. Second operand has 7 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 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-06 10:37:19,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:37:19,731 INFO L93 Difference]: Finished difference Result 153 states and 165 transitions. [2025-02-06 10:37:19,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 10:37:19,732 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 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 30 [2025-02-06 10:37:19,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:37:19,733 INFO L225 Difference]: With dead ends: 153 [2025-02-06 10:37:19,733 INFO L226 Difference]: Without dead ends: 153 [2025-02-06 10:37:19,733 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-06 10:37:19,734 INFO L435 NwaCegarLoop]: 143 mSDtfsCounter, 7 mSDsluCounter, 381 mSDsCounter, 0 mSdLazyCounter, 396 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 524 SdHoareTripleChecker+Invalid, 397 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 396 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 10:37:19,734 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 524 Invalid, 397 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 396 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 10:37:19,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2025-02-06 10:37:19,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 153. [2025-02-06 10:37:19,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 86 states have (on average 1.8255813953488371) internal successors, (157), 147 states have internal predecessors, (157), 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-06 10:37:19,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 165 transitions. [2025-02-06 10:37:19,739 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 165 transitions. Word has length 30 [2025-02-06 10:37:19,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:37:19,739 INFO L471 AbstractCegarLoop]: Abstraction has 153 states and 165 transitions. [2025-02-06 10:37:19,739 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 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-06 10:37:19,739 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 165 transitions. [2025-02-06 10:37:19,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-02-06 10:37:19,741 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:37:19,741 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:37:19,741 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-06 10:37:19,741 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr59REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 69 more)] === [2025-02-06 10:37:19,742 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:37:19,742 INFO L85 PathProgramCache]: Analyzing trace with hash -1753818493, now seen corresponding path program 1 times [2025-02-06 10:37:19,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:37:19,742 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [751088861] [2025-02-06 10:37:19,742 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:37:19,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:37:19,752 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-02-06 10:37:19,757 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-02-06 10:37:19,757 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:37:19,757 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:37:19,938 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 10:37:19,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:37:19,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [751088861] [2025-02-06 10:37:19,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [751088861] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:37:19,938 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:37:19,938 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 10:37:19,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [831322796] [2025-02-06 10:37:19,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:37:19,938 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 10:37:19,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:37:19,939 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 10:37:19,939 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-06 10:37:19,939 INFO L87 Difference]: Start difference. First operand 153 states and 165 transitions. Second operand has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 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-06 10:37:20,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:37:20,111 INFO L93 Difference]: Finished difference Result 152 states and 164 transitions. [2025-02-06 10:37:20,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 10:37:20,112 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 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 30 [2025-02-06 10:37:20,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:37:20,112 INFO L225 Difference]: With dead ends: 152 [2025-02-06 10:37:20,112 INFO L226 Difference]: Without dead ends: 152 [2025-02-06 10:37:20,113 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-06 10:37:20,113 INFO L435 NwaCegarLoop]: 142 mSDtfsCounter, 6 mSDsluCounter, 407 mSDsCounter, 0 mSdLazyCounter, 365 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 549 SdHoareTripleChecker+Invalid, 365 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 365 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 10:37:20,113 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 549 Invalid, 365 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 365 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 10:37:20,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2025-02-06 10:37:20,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 152. [2025-02-06 10:37:20,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 86 states have (on average 1.813953488372093) internal successors, (156), 146 states have internal predecessors, (156), 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-06 10:37:20,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 164 transitions. [2025-02-06 10:37:20,115 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 164 transitions. Word has length 30 [2025-02-06 10:37:20,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:37:20,115 INFO L471 AbstractCegarLoop]: Abstraction has 152 states and 164 transitions. [2025-02-06 10:37:20,115 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 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-06 10:37:20,115 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 164 transitions. [2025-02-06 10:37:20,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-02-06 10:37:20,116 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:37:20,116 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:37:20,116 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-06 10:37:20,116 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr62REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 69 more)] === [2025-02-06 10:37:20,116 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:37:20,116 INFO L85 PathProgramCache]: Analyzing trace with hash -2135329813, now seen corresponding path program 1 times [2025-02-06 10:37:20,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:37:20,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1376917645] [2025-02-06 10:37:20,116 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:37:20,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:37:20,126 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-02-06 10:37:20,130 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-02-06 10:37:20,130 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:37:20,130 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:37:20,177 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-02-06 10:37:20,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:37:20,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1376917645] [2025-02-06 10:37:20,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1376917645] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:37:20,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1513651511] [2025-02-06 10:37:20,177 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:37:20,177 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:37:20,177 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:37:20,179 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-06 10:37:20,180 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-06 10:37:20,267 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-02-06 10:37:20,296 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-02-06 10:37:20,296 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:37:20,296 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:37:20,297 INFO L256 TraceCheckSpWp]: Trace formula consists of 369 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-06 10:37:20,299 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:37:20,323 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-02-06 10:37:20,323 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 10:37:20,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1513651511] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:37:20,323 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 10:37:20,323 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2025-02-06 10:37:20,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2120071863] [2025-02-06 10:37:20,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:37:20,323 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 10:37:20,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:37:20,323 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 10:37:20,324 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 10:37:20,324 INFO L87 Difference]: Start difference. First operand 152 states and 164 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 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-06 10:37:20,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:37:20,332 INFO L93 Difference]: Finished difference Result 141 states and 149 transitions. [2025-02-06 10:37:20,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 10:37:20,332 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 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 41 [2025-02-06 10:37:20,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:37:20,333 INFO L225 Difference]: With dead ends: 141 [2025-02-06 10:37:20,333 INFO L226 Difference]: Without dead ends: 141 [2025-02-06 10:37:20,333 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 10:37:20,333 INFO L435 NwaCegarLoop]: 146 mSDtfsCounter, 0 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 288 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-06 10:37:20,334 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 288 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 10:37:20,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2025-02-06 10:37:20,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 141. [2025-02-06 10:37:20,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 79 states have (on average 1.8101265822784811) internal successors, (143), 136 states have internal predecessors, (143), 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-06 10:37:20,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 149 transitions. [2025-02-06 10:37:20,336 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 149 transitions. Word has length 41 [2025-02-06 10:37:20,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:37:20,336 INFO L471 AbstractCegarLoop]: Abstraction has 141 states and 149 transitions. [2025-02-06 10:37:20,336 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 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-06 10:37:20,336 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 149 transitions. [2025-02-06 10:37:20,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-02-06 10:37:20,336 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:37:20,336 INFO L218 NwaCegarLoop]: trace histogram [3, 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] [2025-02-06 10:37:20,342 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-06 10:37:20,536 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,SelfDestructingSolverStorable12 [2025-02-06 10:37:20,537 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr56REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 69 more)] === [2025-02-06 10:37:20,537 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:37:20,537 INFO L85 PathProgramCache]: Analyzing trace with hash 514471662, now seen corresponding path program 1 times [2025-02-06 10:37:20,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:37:20,537 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [427468609] [2025-02-06 10:37:20,537 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:37:20,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:37:20,550 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-02-06 10:37:20,573 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-02-06 10:37:20,574 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:37:20,574 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:37:20,912 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-06 10:37:20,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:37:20,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [427468609] [2025-02-06 10:37:20,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [427468609] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:37:20,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [483694663] [2025-02-06 10:37:20,913 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:37:20,913 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:37:20,913 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:37:20,916 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-06 10:37:20,917 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-06 10:37:21,010 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-02-06 10:37:21,054 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-02-06 10:37:21,054 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:37:21,054 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:37:21,060 INFO L256 TraceCheckSpWp]: Trace formula consists of 412 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-02-06 10:37:21,062 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:37:21,066 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-06 10:37:21,074 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-06 10:37:21,085 WARN L873 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| (select |c_#valid| |node_create_~temp~0#1.base|))))) is different from true [2025-02-06 10:37:21,119 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 10:37:21,119 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-06 10:37:21,127 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-06 10:37:21,146 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2025-02-06 10:37:21,147 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-06 10:37:21,188 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2025-02-06 10:37:21,188 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-06 10:37:21,198 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 14 not checked. [2025-02-06 10:37:21,199 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:37:21,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [483694663] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:37:21,440 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-06 10:37:21,440 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 7] total 14 [2025-02-06 10:37:21,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [84380925] [2025-02-06 10:37:21,440 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-06 10:37:21,440 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-02-06 10:37:21,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:37:21,441 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-02-06 10:37:21,441 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=167, Unknown=2, NotChecked=54, Total=272 [2025-02-06 10:37:21,441 INFO L87 Difference]: Start difference. First operand 141 states and 149 transitions. Second operand has 15 states, 14 states have (on average 3.7857142857142856) internal successors, (53), 14 states have internal predecessors, (53), 3 states have call successors, (4), 1 states have call predecessors, (4), 5 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-02-06 10:37:21,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:37:21,864 INFO L93 Difference]: Finished difference Result 150 states and 159 transitions. [2025-02-06 10:37:21,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 10:37:21,864 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 3.7857142857142856) internal successors, (53), 14 states have internal predecessors, (53), 3 states have call successors, (4), 1 states have call predecessors, (4), 5 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 43 [2025-02-06 10:37:21,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:37:21,865 INFO L225 Difference]: With dead ends: 150 [2025-02-06 10:37:21,865 INFO L226 Difference]: Without dead ends: 150 [2025-02-06 10:37:21,865 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 69 SyntacticMatches, 7 SemanticMatches, 18 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=72, Invalid=240, Unknown=2, NotChecked=66, Total=380 [2025-02-06 10:37:21,866 INFO L435 NwaCegarLoop]: 66 mSDtfsCounter, 168 mSDsluCounter, 474 mSDsCounter, 0 mSdLazyCounter, 677 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 540 SdHoareTripleChecker+Invalid, 993 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 677 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 304 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-06 10:37:21,866 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [168 Valid, 540 Invalid, 993 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 677 Invalid, 0 Unknown, 304 Unchecked, 0.4s Time] [2025-02-06 10:37:21,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2025-02-06 10:37:21,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 131. [2025-02-06 10:37:21,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 79 states have (on average 1.6835443037974684) internal successors, (133), 126 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-06 10:37:21,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 139 transitions. [2025-02-06 10:37:21,868 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 139 transitions. Word has length 43 [2025-02-06 10:37:21,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:37:21,868 INFO L471 AbstractCegarLoop]: Abstraction has 131 states and 139 transitions. [2025-02-06 10:37:21,868 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 3.7857142857142856) internal successors, (53), 14 states have internal predecessors, (53), 3 states have call successors, (4), 1 states have call predecessors, (4), 5 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-02-06 10:37:21,868 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 139 transitions. [2025-02-06 10:37:21,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-02-06 10:37:21,869 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:37:21,869 INFO L218 NwaCegarLoop]: trace histogram [3, 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] [2025-02-06 10:37:21,876 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-02-06 10:37:22,073 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:37:22,073 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr57REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 69 more)] === [2025-02-06 10:37:22,073 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:37:22,073 INFO L85 PathProgramCache]: Analyzing trace with hash 514471663, now seen corresponding path program 1 times [2025-02-06 10:37:22,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:37:22,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2127885109] [2025-02-06 10:37:22,073 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:37:22,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:37:22,086 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-02-06 10:37:22,110 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-02-06 10:37:22,110 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:37:22,110 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:37:22,583 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-02-06 10:37:22,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:37:22,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2127885109] [2025-02-06 10:37:22,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2127885109] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:37:22,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1439120565] [2025-02-06 10:37:22,584 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:37:22,584 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:37:22,584 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:37:22,586 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-06 10:37:22,587 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-06 10:37:22,681 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-02-06 10:37:22,716 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-02-06 10:37:22,717 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:37:22,717 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:37:22,718 INFO L256 TraceCheckSpWp]: Trace formula consists of 412 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-02-06 10:37:22,720 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:37:22,724 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-06 10:37:22,743 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-06 10:37:22,749 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-06 10:37:22,774 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 10:37:22,774 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-06 10:37:22,789 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-06 10:37:22,816 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 10:37:22,816 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-06 10:37:22,872 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-06 10:37:22,899 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 10:37:22,900 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-06 10:37:22,914 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-02-06 10:37:22,915 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 10:37:22,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1439120565] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:37:22,915 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 10:37:22,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [11] total 15 [2025-02-06 10:37:22,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1634063404] [2025-02-06 10:37:22,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:37:22,915 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 10:37:22,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:37:22,915 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 10:37:22,915 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=169, Unknown=1, NotChecked=26, Total=240 [2025-02-06 10:37:22,916 INFO L87 Difference]: Start difference. First operand 131 states and 139 transitions. Second operand has 7 states, 5 states have (on average 4.6) internal successors, (23), 6 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-06 10:37:23,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:37:23,050 INFO L93 Difference]: Finished difference Result 125 states and 133 transitions. [2025-02-06 10:37:23,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 10:37:23,051 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 4.6) internal successors, (23), 6 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 43 [2025-02-06 10:37:23,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:37:23,052 INFO L225 Difference]: With dead ends: 125 [2025-02-06 10:37:23,052 INFO L226 Difference]: Without dead ends: 125 [2025-02-06 10:37:23,052 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=194, Unknown=1, NotChecked=28, Total=272 [2025-02-06 10:37:23,052 INFO L435 NwaCegarLoop]: 91 mSDtfsCounter, 52 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 193 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 285 SdHoareTripleChecker+Invalid, 364 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 165 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:37:23,052 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 285 Invalid, 364 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 193 Invalid, 0 Unknown, 165 Unchecked, 0.1s Time] [2025-02-06 10:37:23,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2025-02-06 10:37:23,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 124. [2025-02-06 10:37:23,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 79 states have (on average 1.5949367088607596) internal successors, (126), 119 states have internal predecessors, (126), 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-06 10:37:23,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 132 transitions. [2025-02-06 10:37:23,055 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 132 transitions. Word has length 43 [2025-02-06 10:37:23,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:37:23,055 INFO L471 AbstractCegarLoop]: Abstraction has 124 states and 132 transitions. [2025-02-06 10:37:23,055 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 4.6) internal successors, (23), 6 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-06 10:37:23,055 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 132 transitions. [2025-02-06 10:37:23,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-02-06 10:37:23,056 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:37:23,056 INFO L218 NwaCegarLoop]: trace histogram [3, 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-06 10:37:23,062 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-06 10:37:23,256 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-02-06 10:37:23,257 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr54REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 69 more)] === [2025-02-06 10:37:23,257 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:37:23,257 INFO L85 PathProgramCache]: Analyzing trace with hash -2112900528, now seen corresponding path program 1 times [2025-02-06 10:37:23,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:37:23,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278989041] [2025-02-06 10:37:23,257 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:37:23,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:37:23,270 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-02-06 10:37:23,279 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-02-06 10:37:23,279 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:37:23,279 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:37:23,538 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 20 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 10:37:23,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:37:23,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1278989041] [2025-02-06 10:37:23,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1278989041] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:37:23,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [391058328] [2025-02-06 10:37:23,539 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:37:23,539 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:37:23,539 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:37:23,542 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-06 10:37:23,543 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-06 10:37:23,639 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-02-06 10:37:23,863 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-02-06 10:37:23,863 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:37:23,863 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:37:23,865 INFO L256 TraceCheckSpWp]: Trace formula consists of 429 conjuncts, 36 conjuncts are in the unsatisfiable core [2025-02-06 10:37:23,867 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:37:23,958 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-06 10:37:23,962 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-06 10:37:23,978 INFO L349 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2025-02-06 10:37:23,979 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 16 treesize of output 18 [2025-02-06 10:37:24,001 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-06 10:37:24,005 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-02-06 10:37:24,005 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 10:37:24,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [391058328] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:37:24,005 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 10:37:24,006 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [14] total 20 [2025-02-06 10:37:24,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [249312552] [2025-02-06 10:37:24,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:37:24,006 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-06 10:37:24,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:37:24,006 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-06 10:37:24,007 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=332, Unknown=1, NotChecked=36, Total=420 [2025-02-06 10:37:24,007 INFO L87 Difference]: Start difference. First operand 124 states and 132 transitions. Second operand has 11 states, 10 states have (on average 3.3) internal successors, (33), 10 states have internal predecessors, (33), 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-06 10:37:24,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:37:24,195 INFO L93 Difference]: Finished difference Result 168 states and 181 transitions. [2025-02-06 10:37:24,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-06 10:37:24,196 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.3) internal successors, (33), 10 states have internal predecessors, (33), 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 46 [2025-02-06 10:37:24,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:37:24,196 INFO L225 Difference]: With dead ends: 168 [2025-02-06 10:37:24,197 INFO L226 Difference]: Without dead ends: 168 [2025-02-06 10:37:24,197 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 40 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=443, Unknown=1, NotChecked=42, Total=552 [2025-02-06 10:37:24,197 INFO L435 NwaCegarLoop]: 89 mSDtfsCounter, 140 mSDsluCounter, 303 mSDsCounter, 0 mSdLazyCounter, 317 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 392 SdHoareTripleChecker+Invalid, 567 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 317 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 247 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 10:37:24,197 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 392 Invalid, 567 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 317 Invalid, 0 Unknown, 247 Unchecked, 0.2s Time] [2025-02-06 10:37:24,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2025-02-06 10:37:24,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 131. [2025-02-06 10:37:24,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 86 states have (on average 1.6627906976744187) internal successors, (143), 126 states have internal predecessors, (143), 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-06 10:37:24,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 149 transitions. [2025-02-06 10:37:24,202 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 149 transitions. Word has length 46 [2025-02-06 10:37:24,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:37:24,202 INFO L471 AbstractCegarLoop]: Abstraction has 131 states and 149 transitions. [2025-02-06 10:37:24,202 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.3) internal successors, (33), 10 states have internal predecessors, (33), 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-06 10:37:24,202 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 149 transitions. [2025-02-06 10:37:24,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-02-06 10:37:24,203 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:37:24,203 INFO L218 NwaCegarLoop]: trace histogram [3, 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-06 10:37:24,217 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-06 10:37:24,403 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:37:24,403 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr55REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 69 more)] === [2025-02-06 10:37:24,404 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:37:24,404 INFO L85 PathProgramCache]: Analyzing trace with hash -2112900527, now seen corresponding path program 1 times [2025-02-06 10:37:24,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:37:24,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1170141758] [2025-02-06 10:37:24,405 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:37:24,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:37:24,437 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-02-06 10:37:24,454 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-02-06 10:37:24,454 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:37:24,455 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:37:24,934 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 17 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 10:37:24,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:37:24,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1170141758] [2025-02-06 10:37:24,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1170141758] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:37:24,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1042531066] [2025-02-06 10:37:24,934 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:37:24,935 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:37:24,935 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:37:24,937 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-06 10:37:24,938 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-06 10:37:25,042 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-02-06 10:37:25,200 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-02-06 10:37:25,200 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:37:25,200 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:37:25,202 INFO L256 TraceCheckSpWp]: Trace formula consists of 429 conjuncts, 56 conjuncts are in the unsatisfiable core [2025-02-06 10:37:25,204 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:37:25,223 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-06 10:37:25,438 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-06 10:37:25,440 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-06 10:37:25,476 WARN L873 $PredicateComparison]: unable to prove that (and (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|)))) (exists ((|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_5| Int)) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_5|) 0) 0))) is different from true [2025-02-06 10:37:25,511 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2025-02-06 10:37:25,511 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-06 10:37:25,514 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-06 10:37:25,556 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-06 10:37:25,612 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 7 not checked. [2025-02-06 10:37:25,612 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:37:25,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1042531066] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:37:25,775 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-06 10:37:25,775 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 29 [2025-02-06 10:37:25,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [968534943] [2025-02-06 10:37:25,775 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-06 10:37:25,775 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-02-06 10:37:25,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:37:25,775 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-02-06 10:37:25,776 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=966, Unknown=1, NotChecked=62, Total=1122 [2025-02-06 10:37:25,776 INFO L87 Difference]: Start difference. First operand 131 states and 149 transitions. Second operand has 30 states, 27 states have (on average 2.6666666666666665) internal successors, (72), 26 states have internal predecessors, (72), 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-06 10:37:26,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:37:26,984 INFO L93 Difference]: Finished difference Result 176 states and 186 transitions. [2025-02-06 10:37:26,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-02-06 10:37:26,985 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 27 states have (on average 2.6666666666666665) internal successors, (72), 26 states have internal predecessors, (72), 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 46 [2025-02-06 10:37:26,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:37:26,986 INFO L225 Difference]: With dead ends: 176 [2025-02-06 10:37:26,986 INFO L226 Difference]: Without dead ends: 176 [2025-02-06 10:37:26,986 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 294 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=183, Invalid=1890, Unknown=1, NotChecked=88, Total=2162 [2025-02-06 10:37:26,987 INFO L435 NwaCegarLoop]: 82 mSDtfsCounter, 355 mSDsluCounter, 1348 mSDsCounter, 0 mSdLazyCounter, 1877 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 355 SdHoareTripleChecker+Valid, 1430 SdHoareTripleChecker+Invalid, 2062 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1877 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 179 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-02-06 10:37:26,987 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [355 Valid, 1430 Invalid, 2062 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1877 Invalid, 0 Unknown, 179 Unchecked, 0.9s Time] [2025-02-06 10:37:26,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2025-02-06 10:37:26,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 139. [2025-02-06 10:37:26,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 93 states have (on average 1.5913978494623655) internal successors, (148), 133 states have internal predecessors, (148), 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-06 10:37:26,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 154 transitions. [2025-02-06 10:37:26,991 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 154 transitions. Word has length 46 [2025-02-06 10:37:26,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:37:26,992 INFO L471 AbstractCegarLoop]: Abstraction has 139 states and 154 transitions. [2025-02-06 10:37:26,992 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 27 states have (on average 2.6666666666666665) internal successors, (72), 26 states have internal predecessors, (72), 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-06 10:37:26,993 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 154 transitions. [2025-02-06 10:37:26,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-02-06 10:37:26,993 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:37:26,993 INFO L218 NwaCegarLoop]: trace histogram [3, 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] [2025-02-06 10:37:27,004 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-02-06 10:37:27,194 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,SelfDestructingSolverStorable16 [2025-02-06 10:37:27,194 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 69 more)] === [2025-02-06 10:37:27,194 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:37:27,194 INFO L85 PathProgramCache]: Analyzing trace with hash -1075406016, now seen corresponding path program 1 times [2025-02-06 10:37:27,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:37:27,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1805927951] [2025-02-06 10:37:27,195 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:37:27,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:37:27,212 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-02-06 10:37:27,223 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-02-06 10:37:27,223 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:37:27,223 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:37:27,257 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-02-06 10:37:27,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:37:27,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1805927951] [2025-02-06 10:37:27,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1805927951] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:37:27,258 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:37:27,258 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 10:37:27,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1420918288] [2025-02-06 10:37:27,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:37:27,258 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 10:37:27,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:37:27,258 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 10:37:27,258 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 10:37:27,258 INFO L87 Difference]: Start difference. First operand 139 states and 154 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 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-06 10:37:27,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:37:27,268 INFO L93 Difference]: Finished difference Result 135 states and 143 transitions. [2025-02-06 10:37:27,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 10:37:27,268 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 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 47 [2025-02-06 10:37:27,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:37:27,269 INFO L225 Difference]: With dead ends: 135 [2025-02-06 10:37:27,269 INFO L226 Difference]: Without dead ends: 135 [2025-02-06 10:37:27,269 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 10:37:27,270 INFO L435 NwaCegarLoop]: 131 mSDtfsCounter, 0 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 251 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 10:37:27,270 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 251 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 10:37:27,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2025-02-06 10:37:27,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2025-02-06 10:37:27,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 89 states have (on average 1.5393258426966292) internal successors, (137), 129 states have internal predecessors, (137), 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-06 10:37:27,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 143 transitions. [2025-02-06 10:37:27,273 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 143 transitions. Word has length 47 [2025-02-06 10:37:27,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:37:27,273 INFO L471 AbstractCegarLoop]: Abstraction has 135 states and 143 transitions. [2025-02-06 10:37:27,273 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 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-06 10:37:27,274 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 143 transitions. [2025-02-06 10:37:27,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-02-06 10:37:27,274 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:37:27,274 INFO L218 NwaCegarLoop]: trace histogram [3, 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, 1, 1, 1, 1, 1] [2025-02-06 10:37:27,274 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-06 10:37:27,274 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr54REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 69 more)] === [2025-02-06 10:37:27,274 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:37:27,274 INFO L85 PathProgramCache]: Analyzing trace with hash 1621151016, now seen corresponding path program 1 times [2025-02-06 10:37:27,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:37:27,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [391912945] [2025-02-06 10:37:27,274 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:37:27,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:37:27,286 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-02-06 10:37:27,293 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-02-06 10:37:27,293 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:37:27,293 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:37:27,372 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-02-06 10:37:27,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:37:27,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [391912945] [2025-02-06 10:37:27,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [391912945] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:37:27,372 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:37:27,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 10:37:27,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1868553094] [2025-02-06 10:37:27,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:37:27,373 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 10:37:27,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:37:27,373 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 10:37:27,373 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-06 10:37:27,373 INFO L87 Difference]: Start difference. First operand 135 states and 143 transitions. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 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-06 10:37:27,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:37:27,393 INFO L93 Difference]: Finished difference Result 136 states and 142 transitions. [2025-02-06 10:37:27,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 10:37:27,394 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 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 49 [2025-02-06 10:37:27,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:37:27,395 INFO L225 Difference]: With dead ends: 136 [2025-02-06 10:37:27,395 INFO L226 Difference]: Without dead ends: 136 [2025-02-06 10:37:27,395 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-06 10:37:27,396 INFO L435 NwaCegarLoop]: 124 mSDtfsCounter, 73 mSDsluCounter, 283 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 407 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 10:37:27,396 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 407 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 10:37:27,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2025-02-06 10:37:27,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 132. [2025-02-06 10:37:27,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 88 states have (on average 1.5113636363636365) internal successors, (133), 126 states have internal predecessors, (133), 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-06 10:37:27,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 139 transitions. [2025-02-06 10:37:27,398 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 139 transitions. Word has length 49 [2025-02-06 10:37:27,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:37:27,398 INFO L471 AbstractCegarLoop]: Abstraction has 132 states and 139 transitions. [2025-02-06 10:37:27,398 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 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-06 10:37:27,398 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 139 transitions. [2025-02-06 10:37:27,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-02-06 10:37:27,399 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:37:27,399 INFO L218 NwaCegarLoop]: trace histogram [3, 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] [2025-02-06 10:37:27,399 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-06 10:37:27,399 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr50REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 69 more)] === [2025-02-06 10:37:27,399 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:37:27,399 INFO L85 PathProgramCache]: Analyzing trace with hash 1622009830, now seen corresponding path program 1 times [2025-02-06 10:37:27,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:37:27,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [421280987] [2025-02-06 10:37:27,399 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:37:27,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:37:27,411 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-02-06 10:37:27,416 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-02-06 10:37:27,416 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:37:27,416 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:37:27,471 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-02-06 10:37:27,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:37:27,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [421280987] [2025-02-06 10:37:27,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [421280987] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:37:27,471 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:37:27,471 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 10:37:27,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2034796282] [2025-02-06 10:37:27,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:37:27,471 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 10:37:27,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:37:27,472 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 10:37:27,472 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 10:37:27,472 INFO L87 Difference]: Start difference. First operand 132 states and 139 transitions. Second operand has 6 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 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-06 10:37:27,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:37:27,590 INFO L93 Difference]: Finished difference Result 126 states and 133 transitions. [2025-02-06 10:37:27,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 10:37:27,590 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 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 49 [2025-02-06 10:37:27,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:37:27,591 INFO L225 Difference]: With dead ends: 126 [2025-02-06 10:37:27,591 INFO L226 Difference]: Without dead ends: 126 [2025-02-06 10:37:27,591 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-06 10:37:27,593 INFO L435 NwaCegarLoop]: 90 mSDtfsCounter, 31 mSDsluCounter, 231 mSDsCounter, 0 mSdLazyCounter, 254 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 321 SdHoareTripleChecker+Invalid, 260 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 254 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:37:27,593 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 321 Invalid, 260 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 254 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 10:37:27,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2025-02-06 10:37:27,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 126. [2025-02-06 10:37:27,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 88 states have (on average 1.4431818181818181) internal successors, (127), 120 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-06 10:37:27,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 133 transitions. [2025-02-06 10:37:27,595 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 133 transitions. Word has length 49 [2025-02-06 10:37:27,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:37:27,595 INFO L471 AbstractCegarLoop]: Abstraction has 126 states and 133 transitions. [2025-02-06 10:37:27,595 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 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-06 10:37:27,595 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 133 transitions. [2025-02-06 10:37:27,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-02-06 10:37:27,595 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:37:27,595 INFO L218 NwaCegarLoop]: trace histogram [3, 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] [2025-02-06 10:37:27,597 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-06 10:37:27,597 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr51REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 69 more)] === [2025-02-06 10:37:27,597 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:37:27,597 INFO L85 PathProgramCache]: Analyzing trace with hash 1622009831, now seen corresponding path program 1 times [2025-02-06 10:37:27,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:37:27,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1447172969] [2025-02-06 10:37:27,597 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:37:27,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:37:27,609 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-02-06 10:37:27,613 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-02-06 10:37:27,613 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:37:27,613 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:37:27,732 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 8 proven. 7 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-02-06 10:37:27,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:37:27,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1447172969] [2025-02-06 10:37:27,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1447172969] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:37:27,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1303616367] [2025-02-06 10:37:27,733 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:37:27,733 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:37:27,733 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:37:27,738 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-06 10:37:27,739 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-06 10:37:27,857 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-02-06 10:37:27,891 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-02-06 10:37:27,891 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:37:27,891 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:37:27,893 INFO L256 TraceCheckSpWp]: Trace formula consists of 441 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-06 10:37:27,895 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:37:27,956 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-02-06 10:37:27,956 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 10:37:27,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1303616367] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:37:27,956 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 10:37:27,957 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [10] total 12 [2025-02-06 10:37:27,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [409345444] [2025-02-06 10:37:27,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:37:27,957 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 10:37:27,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:37:27,957 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 10:37:27,957 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-02-06 10:37:27,958 INFO L87 Difference]: Start difference. First operand 126 states and 133 transitions. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 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-06 10:37:27,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:37:27,972 INFO L93 Difference]: Finished difference Result 129 states and 134 transitions. [2025-02-06 10:37:27,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 10:37:27,973 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 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 49 [2025-02-06 10:37:27,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:37:27,973 INFO L225 Difference]: With dead ends: 129 [2025-02-06 10:37:27,973 INFO L226 Difference]: Without dead ends: 129 [2025-02-06 10:37:27,974 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2025-02-06 10:37:27,974 INFO L435 NwaCegarLoop]: 119 mSDtfsCounter, 69 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 274 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 10:37:27,974 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 274 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 10:37:27,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2025-02-06 10:37:27,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 125. [2025-02-06 10:37:27,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 87 states have (on average 1.4367816091954022) internal successors, (125), 119 states have internal predecessors, (125), 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-06 10:37:27,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 131 transitions. [2025-02-06 10:37:27,977 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 131 transitions. Word has length 49 [2025-02-06 10:37:27,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:37:27,977 INFO L471 AbstractCegarLoop]: Abstraction has 125 states and 131 transitions. [2025-02-06 10:37:27,977 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 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-06 10:37:27,977 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 131 transitions. [2025-02-06 10:37:27,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-02-06 10:37:27,977 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:37:27,978 INFO L218 NwaCegarLoop]: trace histogram [3, 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] [2025-02-06 10:37:27,984 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-02-06 10:37:28,182 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,SelfDestructingSolverStorable20 [2025-02-06 10:37:28,182 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 69 more)] === [2025-02-06 10:37:28,183 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:37:28,183 INFO L85 PathProgramCache]: Analyzing trace with hash -1283925144, now seen corresponding path program 1 times [2025-02-06 10:37:28,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:37:28,183 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [579382316] [2025-02-06 10:37:28,183 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:37:28,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:37:28,195 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-02-06 10:37:28,200 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-02-06 10:37:28,201 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:37:28,201 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:37:28,230 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-02-06 10:37:28,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:37:28,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [579382316] [2025-02-06 10:37:28,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [579382316] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:37:28,231 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:37:28,231 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 10:37:28,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [843409422] [2025-02-06 10:37:28,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:37:28,231 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 10:37:28,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:37:28,232 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 10:37:28,232 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 10:37:28,232 INFO L87 Difference]: Start difference. First operand 125 states and 131 transitions. Second operand has 4 states, 3 states have (on average 10.0) internal successors, (30), 4 states have internal predecessors, (30), 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-06 10:37:28,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:37:28,300 INFO L93 Difference]: Finished difference Result 124 states and 130 transitions. [2025-02-06 10:37:28,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 10:37:28,301 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 10.0) internal successors, (30), 4 states have internal predecessors, (30), 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 50 [2025-02-06 10:37:28,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:37:28,301 INFO L225 Difference]: With dead ends: 124 [2025-02-06 10:37:28,301 INFO L226 Difference]: Without dead ends: 124 [2025-02-06 10:37:28,302 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-06 10:37:28,304 INFO L435 NwaCegarLoop]: 117 mSDtfsCounter, 2 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 247 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:37:28,304 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 247 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 10:37:28,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2025-02-06 10:37:28,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 124. [2025-02-06 10:37:28,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 87 states have (on average 1.4252873563218391) internal successors, (124), 118 states have internal predecessors, (124), 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-06 10:37:28,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 130 transitions. [2025-02-06 10:37:28,307 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 130 transitions. Word has length 50 [2025-02-06 10:37:28,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:37:28,307 INFO L471 AbstractCegarLoop]: Abstraction has 124 states and 130 transitions. [2025-02-06 10:37:28,307 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 10.0) internal successors, (30), 4 states have internal predecessors, (30), 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-06 10:37:28,307 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 130 transitions. [2025-02-06 10:37:28,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-02-06 10:37:28,307 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:37:28,307 INFO L218 NwaCegarLoop]: trace histogram [3, 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] [2025-02-06 10:37:28,308 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-02-06 10:37:28,308 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 69 more)] === [2025-02-06 10:37:28,308 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:37:28,308 INFO L85 PathProgramCache]: Analyzing trace with hash -1283925143, now seen corresponding path program 1 times [2025-02-06 10:37:28,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:37:28,308 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1096519584] [2025-02-06 10:37:28,308 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:37:28,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:37:28,323 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-02-06 10:37:28,331 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-02-06 10:37:28,331 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:37:28,331 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:37:28,385 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-02-06 10:37:28,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:37:28,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1096519584] [2025-02-06 10:37:28,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1096519584] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:37:28,385 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:37:28,385 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 10:37:28,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1643785765] [2025-02-06 10:37:28,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:37:28,385 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 10:37:28,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:37:28,386 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 10:37:28,386 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 10:37:28,386 INFO L87 Difference]: Start difference. First operand 124 states and 130 transitions. Second operand has 4 states, 3 states have (on average 10.0) internal successors, (30), 4 states have internal predecessors, (30), 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-06 10:37:28,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:37:28,462 INFO L93 Difference]: Finished difference Result 123 states and 129 transitions. [2025-02-06 10:37:28,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 10:37:28,462 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 10.0) internal successors, (30), 4 states have internal predecessors, (30), 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 50 [2025-02-06 10:37:28,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:37:28,463 INFO L225 Difference]: With dead ends: 123 [2025-02-06 10:37:28,463 INFO L226 Difference]: Without dead ends: 123 [2025-02-06 10:37:28,463 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-06 10:37:28,463 INFO L435 NwaCegarLoop]: 116 mSDtfsCounter, 2 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 241 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:37:28,464 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 241 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 10:37:28,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2025-02-06 10:37:28,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2025-02-06 10:37:28,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 87 states have (on average 1.4137931034482758) internal successors, (123), 117 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-06 10:37:28,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 129 transitions. [2025-02-06 10:37:28,467 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 129 transitions. Word has length 50 [2025-02-06 10:37:28,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:37:28,467 INFO L471 AbstractCegarLoop]: Abstraction has 123 states and 129 transitions. [2025-02-06 10:37:28,467 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 10.0) internal successors, (30), 4 states have internal predecessors, (30), 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-06 10:37:28,467 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 129 transitions. [2025-02-06 10:37:28,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-02-06 10:37:28,467 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:37:28,468 INFO L218 NwaCegarLoop]: trace histogram [3, 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-06 10:37:28,468 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-02-06 10:37:28,468 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 69 more)] === [2025-02-06 10:37:28,468 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:37:28,468 INFO L85 PathProgramCache]: Analyzing trace with hash -1146973758, now seen corresponding path program 1 times [2025-02-06 10:37:28,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:37:28,468 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1284752441] [2025-02-06 10:37:28,468 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:37:28,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:37:28,484 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-02-06 10:37:28,491 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-02-06 10:37:28,491 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:37:28,491 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:37:28,603 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-06 10:37:28,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:37:28,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1284752441] [2025-02-06 10:37:28,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1284752441] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:37:28,603 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:37:28,603 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 10:37:28,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [975287384] [2025-02-06 10:37:28,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:37:28,603 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 10:37:28,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:37:28,604 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 10:37:28,604 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 10:37:28,604 INFO L87 Difference]: Start difference. First operand 123 states and 129 transitions. Second operand has 6 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 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-06 10:37:28,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:37:28,708 INFO L93 Difference]: Finished difference Result 117 states and 123 transitions. [2025-02-06 10:37:28,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 10:37:28,708 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 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 51 [2025-02-06 10:37:28,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:37:28,710 INFO L225 Difference]: With dead ends: 117 [2025-02-06 10:37:28,710 INFO L226 Difference]: Without dead ends: 117 [2025-02-06 10:37:28,710 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-06 10:37:28,711 INFO L435 NwaCegarLoop]: 89 mSDtfsCounter, 26 mSDsluCounter, 240 mSDsCounter, 0 mSdLazyCounter, 208 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 329 SdHoareTripleChecker+Invalid, 213 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 208 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:37:28,711 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 329 Invalid, 213 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 208 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 10:37:28,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2025-02-06 10:37:28,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2025-02-06 10:37:28,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 87 states have (on average 1.3448275862068966) 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-06 10:37:28,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 123 transitions. [2025-02-06 10:37:28,713 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 123 transitions. Word has length 51 [2025-02-06 10:37:28,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:37:28,713 INFO L471 AbstractCegarLoop]: Abstraction has 117 states and 123 transitions. [2025-02-06 10:37:28,713 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 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-06 10:37:28,713 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 123 transitions. [2025-02-06 10:37:28,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-02-06 10:37:28,713 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:37:28,714 INFO L218 NwaCegarLoop]: trace histogram [3, 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] [2025-02-06 10:37:28,714 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-02-06 10:37:28,715 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 69 more)] === [2025-02-06 10:37:28,715 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:37:28,715 INFO L85 PathProgramCache]: Analyzing trace with hash 1564813886, now seen corresponding path program 1 times [2025-02-06 10:37:28,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:37:28,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [416776741] [2025-02-06 10:37:28,715 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:37:28,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:37:28,734 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-02-06 10:37:28,749 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-02-06 10:37:28,749 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:37:28,749 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:37:29,563 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 15 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:37:29,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:37:29,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [416776741] [2025-02-06 10:37:29,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [416776741] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:37:29,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [948361024] [2025-02-06 10:37:29,563 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:37:29,563 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:37:29,563 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:37:29,565 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-06 10:37:29,567 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-06 10:37:29,740 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-02-06 10:37:30,055 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-02-06 10:37:30,055 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:37:30,055 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:37:30,060 INFO L256 TraceCheckSpWp]: Trace formula consists of 493 conjuncts, 112 conjuncts are in the unsatisfiable core [2025-02-06 10:37:30,063 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:37:30,085 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-06 10:37:30,270 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-06 10:37:30,270 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-06 10:37:30,335 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-06 10:37:30,402 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-02-06 10:37:30,405 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 41 treesize of output 38 [2025-02-06 10:37:30,506 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-02-06 10:37:30,506 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-06 10:37:30,547 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 17 [2025-02-06 10:37:30,670 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 30 treesize of output 14 [2025-02-06 10:37:30,673 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-06 10:37:30,873 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 10:37:30,873 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 38 treesize of output 27 [2025-02-06 10:37:30,891 INFO L349 Elim1Store]: treesize reduction 76, result has 36.1 percent of original size [2025-02-06 10:37:30,891 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-06 10:37:30,997 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 38 [2025-02-06 10:37:31,099 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 33 treesize of output 17 [2025-02-06 10:37:31,289 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 3 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:37:31,289 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:37:31,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [948361024] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:37:31,593 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-06 10:37:31,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 29] total 52 [2025-02-06 10:37:31,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [370687795] [2025-02-06 10:37:31,593 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-06 10:37:31,593 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2025-02-06 10:37:31,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:37:31,594 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2025-02-06 10:37:31,596 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=3347, Unknown=0, NotChecked=0, Total=3540 [2025-02-06 10:37:31,596 INFO L87 Difference]: Start difference. First operand 117 states and 123 transitions. Second operand has 53 states, 49 states have (on average 1.8571428571428572) internal successors, (91), 45 states have internal predecessors, (91), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-06 10:37:33,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:37:33,341 INFO L93 Difference]: Finished difference Result 118 states and 124 transitions. [2025-02-06 10:37:33,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2025-02-06 10:37:33,341 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 49 states have (on average 1.8571428571428572) internal successors, (91), 45 states have internal predecessors, (91), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 53 [2025-02-06 10:37:33,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:37:33,342 INFO L225 Difference]: With dead ends: 118 [2025-02-06 10:37:33,342 INFO L226 Difference]: Without dead ends: 118 [2025-02-06 10:37:33,343 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1563 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=430, Invalid=6212, Unknown=0, NotChecked=0, Total=6642 [2025-02-06 10:37:33,343 INFO L435 NwaCegarLoop]: 68 mSDtfsCounter, 191 mSDsluCounter, 1587 mSDsCounter, 0 mSdLazyCounter, 2241 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 191 SdHoareTripleChecker+Valid, 1655 SdHoareTripleChecker+Invalid, 2269 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 2241 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-02-06 10:37:33,344 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [191 Valid, 1655 Invalid, 2269 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 2241 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-02-06 10:37:33,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2025-02-06 10:37:33,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 116. [2025-02-06 10:37:33,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 87 states have (on average 1.3333333333333333) 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-06 10:37:33,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 122 transitions. [2025-02-06 10:37:33,348 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 122 transitions. Word has length 53 [2025-02-06 10:37:33,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:37:33,348 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 122 transitions. [2025-02-06 10:37:33,348 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 49 states have (on average 1.8571428571428572) internal successors, (91), 45 states have internal predecessors, (91), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-06 10:37:33,348 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 122 transitions. [2025-02-06 10:37:33,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-02-06 10:37:33,348 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:37:33,348 INFO L218 NwaCegarLoop]: trace histogram [3, 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] [2025-02-06 10:37:33,360 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-06 10:37:33,548 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-06 10:37:33,549 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 69 more)] === [2025-02-06 10:37:33,550 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:37:33,550 INFO L85 PathProgramCache]: Analyzing trace with hash 1564813887, now seen corresponding path program 1 times [2025-02-06 10:37:33,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:37:33,550 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [470797469] [2025-02-06 10:37:33,550 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:37:33,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:37:33,564 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-02-06 10:37:33,580 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-02-06 10:37:33,580 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:37:33,580 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:37:34,907 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 3 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:37:34,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:37:34,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [470797469] [2025-02-06 10:37:34,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [470797469] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:37:34,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [900217614] [2025-02-06 10:37:34,910 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:37:34,910 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:37:34,910 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:37:34,912 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-06 10:37:34,913 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-06 10:37:35,091 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-02-06 10:37:35,459 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-02-06 10:37:35,459 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:37:35,459 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:37:35,469 INFO L256 TraceCheckSpWp]: Trace formula consists of 493 conjuncts, 157 conjuncts are in the unsatisfiable core [2025-02-06 10:37:35,473 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:37:35,504 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-06 10:37:35,511 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-06 10:37:35,527 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-06 10:37:35,571 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 23 treesize of output 11 [2025-02-06 10:37:35,933 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-02-06 10:37:35,934 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 15 [2025-02-06 10:37:35,948 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2025-02-06 10:37:35,948 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-06 10:37:35,963 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-06 10:37:35,963 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-06 10:37:36,079 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 19 treesize of output 18 [2025-02-06 10:37:36,097 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-06 10:37:36,182 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-06 10:37:36,189 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 0 case distinctions, treesize of input 26 treesize of output 21 [2025-02-06 10:37:36,337 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-02-06 10:37:36,337 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 61 treesize of output 54 [2025-02-06 10:37:36,342 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 0 case distinctions, treesize of input 35 treesize of output 16 [2025-02-06 10:37:36,401 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 23 treesize of output 11 [2025-02-06 10:37:36,404 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 17 [2025-02-06 10:37:36,536 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 30 treesize of output 14 [2025-02-06 10:37:36,539 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-06 10:37:36,542 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-06 10:37:36,547 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-06 10:37:36,862 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2025-02-06 10:37:36,862 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 35 [2025-02-06 10:37:36,877 INFO L349 Elim1Store]: treesize reduction 46, result has 27.0 percent of original size [2025-02-06 10:37:36,877 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 23 treesize of output 28 [2025-02-06 10:37:36,882 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 18 treesize of output 14 [2025-02-06 10:37:36,900 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2025-02-06 10:37:36,900 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 23 [2025-02-06 10:37:36,911 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2025-02-06 10:37:36,912 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-06 10:37:37,072 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 65 treesize of output 37 [2025-02-06 10:37:37,241 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 25 treesize of output 13 [2025-02-06 10:37:37,246 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 7 treesize of output 3 [2025-02-06 10:37:37,483 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 10 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:37:37,483 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:37:37,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [900217614] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:37:37,902 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-06 10:37:37,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 30] total 56 [2025-02-06 10:37:37,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [819340145] [2025-02-06 10:37:37,902 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-06 10:37:37,902 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 57 states [2025-02-06 10:37:37,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:37:37,903 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2025-02-06 10:37:37,903 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=3696, Unknown=0, NotChecked=0, Total=3906 [2025-02-06 10:37:37,904 INFO L87 Difference]: Start difference. First operand 116 states and 122 transitions. Second operand has 57 states, 53 states have (on average 1.7547169811320755) internal successors, (93), 48 states have internal predecessors, (93), 6 states have call successors, (6), 5 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-06 10:37:40,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:37:40,408 INFO L93 Difference]: Finished difference Result 116 states and 122 transitions. [2025-02-06 10:37:40,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2025-02-06 10:37:40,409 INFO L78 Accepts]: Start accepts. Automaton has has 57 states, 53 states have (on average 1.7547169811320755) internal successors, (93), 48 states have internal predecessors, (93), 6 states have call successors, (6), 5 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 53 [2025-02-06 10:37:40,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:37:40,409 INFO L225 Difference]: With dead ends: 116 [2025-02-06 10:37:40,409 INFO L226 Difference]: Without dead ends: 116 [2025-02-06 10:37:40,411 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1733 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=426, Invalid=6884, Unknown=0, NotChecked=0, Total=7310 [2025-02-06 10:37:40,411 INFO L435 NwaCegarLoop]: 68 mSDtfsCounter, 119 mSDsluCounter, 1657 mSDsCounter, 0 mSdLazyCounter, 2636 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 1725 SdHoareTripleChecker+Invalid, 2642 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 2636 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-02-06 10:37:40,411 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 1725 Invalid, 2642 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 2636 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-02-06 10:37:40,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2025-02-06 10:37:40,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 115. [2025-02-06 10:37:40,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 87 states have (on average 1.3218390804597702) internal successors, (115), 109 states have internal predecessors, (115), 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-06 10:37:40,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 121 transitions. [2025-02-06 10:37:40,413 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 121 transitions. Word has length 53 [2025-02-06 10:37:40,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:37:40,414 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 121 transitions. [2025-02-06 10:37:40,414 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 57 states, 53 states have (on average 1.7547169811320755) internal successors, (93), 48 states have internal predecessors, (93), 6 states have call successors, (6), 5 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-06 10:37:40,414 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 121 transitions. [2025-02-06 10:37:40,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-02-06 10:37:40,414 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:37:40,414 INFO L218 NwaCegarLoop]: trace histogram [3, 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] [2025-02-06 10:37:40,423 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2025-02-06 10:37:40,615 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,14 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:37:40,615 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 69 more)] === [2025-02-06 10:37:40,615 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:37:40,615 INFO L85 PathProgramCache]: Analyzing trace with hash 547591932, now seen corresponding path program 1 times [2025-02-06 10:37:40,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:37:40,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956304509] [2025-02-06 10:37:40,615 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:37:40,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:37:40,637 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-02-06 10:37:40,647 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-02-06 10:37:40,647 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:37:40,648 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:37:40,734 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-02-06 10:37:40,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:37:40,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1956304509] [2025-02-06 10:37:40,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1956304509] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:37:40,734 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:37:40,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 10:37:40,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [218353711] [2025-02-06 10:37:40,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:37:40,735 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 10:37:40,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:37:40,735 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 10:37:40,735 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-02-06 10:37:40,736 INFO L87 Difference]: Start difference. First operand 115 states and 121 transitions. Second operand has 6 states, 4 states have (on average 8.75) internal successors, (35), 6 states have internal predecessors, (35), 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-06 10:37:40,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:37:40,805 INFO L93 Difference]: Finished difference Result 113 states and 119 transitions. [2025-02-06 10:37:40,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 10:37:40,806 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 8.75) internal successors, (35), 6 states have internal predecessors, (35), 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 55 [2025-02-06 10:37:40,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:37:40,807 INFO L225 Difference]: With dead ends: 113 [2025-02-06 10:37:40,807 INFO L226 Difference]: Without dead ends: 113 [2025-02-06 10:37:40,807 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-06 10:37:40,808 INFO L435 NwaCegarLoop]: 83 mSDtfsCounter, 110 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 203 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:37:40,808 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 203 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 10:37:40,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2025-02-06 10:37:40,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 112. [2025-02-06 10:37:40,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 87 states have (on average 1.2873563218390804) internal successors, (112), 106 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-06 10:37:40,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 118 transitions. [2025-02-06 10:37:40,810 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 118 transitions. Word has length 55 [2025-02-06 10:37:40,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:37:40,811 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 118 transitions. [2025-02-06 10:37:40,811 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 8.75) internal successors, (35), 6 states have internal predecessors, (35), 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-06 10:37:40,811 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 118 transitions. [2025-02-06 10:37:40,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-02-06 10:37:40,811 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:37:40,811 INFO L218 NwaCegarLoop]: trace histogram [3, 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] [2025-02-06 10:37:40,812 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-02-06 10:37:40,812 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 69 more)] === [2025-02-06 10:37:40,812 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:37:40,812 INFO L85 PathProgramCache]: Analyzing trace with hash 1025455936, now seen corresponding path program 1 times [2025-02-06 10:37:40,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:37:40,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [412072420] [2025-02-06 10:37:40,812 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:37:40,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:37:40,827 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-02-06 10:37:40,833 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-02-06 10:37:40,833 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:37:40,833 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:37:40,944 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-02-06 10:37:40,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:37:40,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [412072420] [2025-02-06 10:37:40,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [412072420] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:37:40,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [226250107] [2025-02-06 10:37:40,944 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:37:40,944 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:37:40,945 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:37:40,946 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 10:37:40,949 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-02-06 10:37:41,112 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-02-06 10:37:41,154 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-02-06 10:37:41,154 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:37:41,154 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:37:41,162 INFO L256 TraceCheckSpWp]: Trace formula consists of 525 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-02-06 10:37:41,164 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:37:41,168 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-06 10:37:41,230 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-06 10:37:41,278 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2025-02-06 10:37:41,278 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-06 10:37:41,340 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-06 10:37:41,344 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 17 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-06 10:37:41,344 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:37:41,556 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-06 10:37:41,580 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 17 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-06 10:37:41,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [226250107] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 10:37:41,581 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 10:37:41,581 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 15, 15] total 23 [2025-02-06 10:37:41,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [546477618] [2025-02-06 10:37:41,581 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 10:37:41,581 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-02-06 10:37:41,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:37:41,582 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-02-06 10:37:41,582 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=492, Unknown=0, NotChecked=0, Total=552 [2025-02-06 10:37:41,582 INFO L87 Difference]: Start difference. First operand 112 states and 118 transitions. Second operand has 24 states, 23 states have (on average 3.869565217391304) internal successors, (89), 19 states have internal predecessors, (89), 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-06 10:37:42,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:37:42,015 INFO L93 Difference]: Finished difference Result 140 states and 147 transitions. [2025-02-06 10:37:42,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-02-06 10:37:42,016 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 3.869565217391304) internal successors, (89), 19 states have internal predecessors, (89), 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 58 [2025-02-06 10:37:42,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:37:42,016 INFO L225 Difference]: With dead ends: 140 [2025-02-06 10:37:42,016 INFO L226 Difference]: Without dead ends: 140 [2025-02-06 10:37:42,017 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 98 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=118, Invalid=812, Unknown=0, NotChecked=0, Total=930 [2025-02-06 10:37:42,018 INFO L435 NwaCegarLoop]: 65 mSDtfsCounter, 204 mSDsluCounter, 720 mSDsCounter, 0 mSdLazyCounter, 846 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 204 SdHoareTripleChecker+Valid, 785 SdHoareTripleChecker+Invalid, 866 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 846 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 10:37:42,018 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [204 Valid, 785 Invalid, 866 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 846 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 10:37:42,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2025-02-06 10:37:42,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 116. [2025-02-06 10:37:42,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 92 states have (on average 1.2717391304347827) internal successors, (117), 110 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-06 10:37:42,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 123 transitions. [2025-02-06 10:37:42,021 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 123 transitions. Word has length 58 [2025-02-06 10:37:42,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:37:42,021 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 123 transitions. [2025-02-06 10:37:42,021 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 3.869565217391304) internal successors, (89), 19 states have internal predecessors, (89), 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-06 10:37:42,021 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 123 transitions. [2025-02-06 10:37:42,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-02-06 10:37:42,021 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:37:42,021 INFO L218 NwaCegarLoop]: trace histogram [3, 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] [2025-02-06 10:37:42,030 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2025-02-06 10:37:42,222 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2025-02-06 10:37:42,222 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 69 more)] === [2025-02-06 10:37:42,223 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:37:42,223 INFO L85 PathProgramCache]: Analyzing trace with hash 1025455937, now seen corresponding path program 1 times [2025-02-06 10:37:42,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:37:42,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [200972959] [2025-02-06 10:37:42,224 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:37:42,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:37:42,238 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-02-06 10:37:42,247 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-02-06 10:37:42,247 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:37:42,247 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:37:42,758 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 17 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 10:37:42,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:37:42,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [200972959] [2025-02-06 10:37:42,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [200972959] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:37:42,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1440607982] [2025-02-06 10:37:42,758 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:37:42,759 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:37:42,759 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:37:42,760 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 10:37:42,762 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-02-06 10:37:42,939 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-02-06 10:37:42,981 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-02-06 10:37:42,981 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:37:42,981 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:37:42,983 INFO L256 TraceCheckSpWp]: Trace formula consists of 525 conjuncts, 53 conjuncts are in the unsatisfiable core [2025-02-06 10:37:42,985 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:37:42,988 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-06 10:37:42,992 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-06 10:37:43,164 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-06 10:37:43,167 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-06 10:37:43,264 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2025-02-06 10:37:43,264 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-06 10:37:43,273 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-06 10:37:43,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-06 10:37:43,377 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 17 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-06 10:37:43,377 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:37:43,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1440607982] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:37:43,565 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-06 10:37:43,565 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 15] total 30 [2025-02-06 10:37:43,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1041139297] [2025-02-06 10:37:43,565 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-06 10:37:43,565 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2025-02-06 10:37:43,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:37:43,565 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-02-06 10:37:43,566 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=1088, Unknown=0, NotChecked=0, Total=1190 [2025-02-06 10:37:43,566 INFO L87 Difference]: Start difference. First operand 116 states and 123 transitions. Second operand has 31 states, 28 states have (on average 3.0714285714285716) internal successors, (86), 26 states have internal predecessors, (86), 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-06 10:37:44,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:37:44,394 INFO L93 Difference]: Finished difference Result 138 states and 146 transitions. [2025-02-06 10:37:44,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-02-06 10:37:44,394 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 28 states have (on average 3.0714285714285716) internal successors, (86), 26 states have internal predecessors, (86), 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 58 [2025-02-06 10:37:44,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:37:44,395 INFO L225 Difference]: With dead ends: 138 [2025-02-06 10:37:44,395 INFO L226 Difference]: Without dead ends: 138 [2025-02-06 10:37:44,396 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 61 SyntacticMatches, 1 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 309 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=181, Invalid=1889, Unknown=0, NotChecked=0, Total=2070 [2025-02-06 10:37:44,398 INFO L435 NwaCegarLoop]: 63 mSDtfsCounter, 95 mSDsluCounter, 860 mSDsCounter, 0 mSdLazyCounter, 1381 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 923 SdHoareTripleChecker+Invalid, 1386 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1381 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-06 10:37:44,398 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 923 Invalid, 1386 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1381 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-06 10:37:44,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2025-02-06 10:37:44,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 118. [2025-02-06 10:37:44,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 94 states have (on average 1.2659574468085106) internal successors, (119), 112 states have internal predecessors, (119), 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-06 10:37:44,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 125 transitions. [2025-02-06 10:37:44,400 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 125 transitions. Word has length 58 [2025-02-06 10:37:44,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:37:44,400 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 125 transitions. [2025-02-06 10:37:44,400 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 28 states have (on average 3.0714285714285716) internal successors, (86), 26 states have internal predecessors, (86), 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-06 10:37:44,400 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 125 transitions. [2025-02-06 10:37:44,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2025-02-06 10:37:44,401 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:37:44,401 INFO L218 NwaCegarLoop]: trace histogram [3, 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] [2025-02-06 10:37:44,408 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2025-02-06 10:37:44,601 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2025-02-06 10:37:44,601 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 69 more)] === [2025-02-06 10:37:44,602 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:37:44,602 INFO L85 PathProgramCache]: Analyzing trace with hash -1810125008, now seen corresponding path program 1 times [2025-02-06 10:37:44,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:37:44,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [806995388] [2025-02-06 10:37:44,602 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:37:44,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:37:44,623 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-02-06 10:37:44,636 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-02-06 10:37:44,636 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:37:44,636 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:37:44,833 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 8 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-02-06 10:37:44,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:37:44,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [806995388] [2025-02-06 10:37:44,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [806995388] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:37:44,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [228438295] [2025-02-06 10:37:44,833 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:37:44,833 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:37:44,833 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:37:44,836 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 10:37:44,837 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2025-02-06 10:37:45,019 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-02-06 10:37:45,061 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-02-06 10:37:45,061 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:37:45,061 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:37:45,063 INFO L256 TraceCheckSpWp]: Trace formula consists of 524 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-02-06 10:37:45,065 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:37:45,235 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-06 10:37:45,237 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 10:37:45,237 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 16 treesize of output 11 [2025-02-06 10:37:45,278 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 17 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 10:37:45,278 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:37:45,317 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 10:37:45,317 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 17 treesize of output 17 [2025-02-06 10:37:45,445 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 8 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-02-06 10:37:45,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [228438295] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 10:37:45,446 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 10:37:45,446 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14, 13] total 27 [2025-02-06 10:37:45,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [122759576] [2025-02-06 10:37:45,446 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 10:37:45,446 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-02-06 10:37:45,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:37:45,447 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-02-06 10:37:45,447 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=629, Unknown=0, NotChecked=0, Total=702 [2025-02-06 10:37:45,447 INFO L87 Difference]: Start difference. First operand 118 states and 125 transitions. Second operand has 27 states, 27 states have (on average 3.185185185185185) internal successors, (86), 24 states have internal predecessors, (86), 5 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (8), 8 states have call predecessors, (8), 5 states have call successors, (8) [2025-02-06 10:37:49,483 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-02-06 10:37:53,496 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-02-06 10:37:57,507 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-02-06 10:38:01,541 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-02-06 10:38:05,554 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-02-06 10:38:09,574 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-02-06 10:38:13,583 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-02-06 10:38:13,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:38:13,867 INFO L93 Difference]: Finished difference Result 94 states and 99 transitions. [2025-02-06 10:38:13,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-02-06 10:38:13,867 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 3.185185185185185) internal successors, (86), 24 states have internal predecessors, (86), 5 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (8), 8 states have call predecessors, (8), 5 states have call successors, (8) Word has length 59 [2025-02-06 10:38:13,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:38:13,868 INFO L225 Difference]: With dead ends: 94 [2025-02-06 10:38:13,868 INFO L226 Difference]: Without dead ends: 94 [2025-02-06 10:38:13,868 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 102 SyntacticMatches, 2 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 169 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=141, Invalid=1049, Unknown=0, NotChecked=0, Total=1190 [2025-02-06 10:38:13,869 INFO L435 NwaCegarLoop]: 65 mSDtfsCounter, 119 mSDsluCounter, 1045 mSDsCounter, 0 mSdLazyCounter, 525 mSolverCounterSat, 1 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 28.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 1110 SdHoareTripleChecker+Invalid, 533 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 525 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 28.3s IncrementalHoareTripleChecker+Time [2025-02-06 10:38:13,869 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 1110 Invalid, 533 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 525 Invalid, 7 Unknown, 0 Unchecked, 28.3s Time] [2025-02-06 10:38:13,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2025-02-06 10:38:13,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2025-02-06 10:38:13,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 74 states have (on average 1.2567567567567568) internal successors, (93), 88 states have internal predecessors, (93), 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-06 10:38:13,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 99 transitions. [2025-02-06 10:38:13,871 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 99 transitions. Word has length 59 [2025-02-06 10:38:13,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:38:13,871 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 99 transitions. [2025-02-06 10:38:13,871 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 3.185185185185185) internal successors, (86), 24 states have internal predecessors, (86), 5 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (8), 8 states have call predecessors, (8), 5 states have call successors, (8) [2025-02-06 10:38:13,871 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 99 transitions. [2025-02-06 10:38:13,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-02-06 10:38:13,871 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:38:13,871 INFO L218 NwaCegarLoop]: trace histogram [3, 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-06 10:38:13,880 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2025-02-06 10:38:14,072 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,17 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:38:14,073 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 69 more)] === [2025-02-06 10:38:14,073 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:38:14,073 INFO L85 PathProgramCache]: Analyzing trace with hash -1606698447, now seen corresponding path program 1 times [2025-02-06 10:38:14,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:38:14,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1587678223] [2025-02-06 10:38:14,073 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:38:14,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:38:14,087 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-02-06 10:38:14,110 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-02-06 10:38:14,110 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:38:14,110 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:38:16,074 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 10 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:38:16,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:38:16,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1587678223] [2025-02-06 10:38:16,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1587678223] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:38:16,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [608770627] [2025-02-06 10:38:16,074 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:38:16,074 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:38:16,075 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:38:16,076 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 10:38:16,077 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2025-02-06 10:38:16,258 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-02-06 10:38:16,481 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-02-06 10:38:16,481 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:38:16,481 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:38:16,485 INFO L256 TraceCheckSpWp]: Trace formula consists of 534 conjuncts, 143 conjuncts are in the unsatisfiable core [2025-02-06 10:38:16,488 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:38:16,528 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-06 10:38:16,658 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-06 10:38:16,738 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-06 10:38:16,738 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-06 10:38:16,845 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 23 treesize of output 11 [2025-02-06 10:38:16,851 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-06 10:38:16,935 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-02-06 10:38:16,936 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 48 treesize of output 43 [2025-02-06 10:38:16,940 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-06 10:38:17,080 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-02-06 10:38:17,081 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 41 treesize of output 38 [2025-02-06 10:38:17,084 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-06 10:38:17,141 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 12 [2025-02-06 10:38:17,145 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 23 treesize of output 11 [2025-02-06 10:38:17,267 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-06 10:38:17,270 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-06 10:38:17,296 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 16 treesize of output 8 [2025-02-06 10:38:17,594 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2025-02-06 10:38:17,595 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 23 [2025-02-06 10:38:17,614 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2025-02-06 10:38:17,615 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 28 [2025-02-06 10:38:17,619 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 10 treesize of output 8 [2025-02-06 10:38:17,634 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2025-02-06 10:38:17,635 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-06 10:38:18,073 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 28 treesize of output 12 [2025-02-06 10:38:18,274 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 39 treesize of output 15 [2025-02-06 10:38:18,359 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-06 10:38:18,431 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-06 10:38:18,509 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 20 treesize of output 15 [2025-02-06 10:38:18,587 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-02-06 10:38:18,706 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 3 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:38:18,706 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:38:18,982 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3806 (Array Int Int)) (v_ArrVal_3809 (Array Int Int)) (v_ArrVal_3810 (Array Int Int))) (or (not (= (store (select |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base|) |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.offset| (select v_ArrVal_3806 |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.offset|)) v_ArrVal_3806)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_3806) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_3809) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_3810) (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ 8 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))))) is different from false [2025-02-06 10:38:18,998 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3806 (Array Int Int)) (v_ArrVal_3809 (Array Int Int)) (v_ArrVal_3810 (Array Int Int))) (or (not (= (store (select |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base|) |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.offset| (select v_ArrVal_3806 |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.offset|)) v_ArrVal_3806)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_3806) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_3809) |c_ULTIMATE.start_dll_circular_insert_#t~mem11#1.base| v_ArrVal_3810) (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ 8 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))))) is different from false [2025-02-06 10:38:19,006 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3806 (Array Int Int)) (v_ArrVal_3809 (Array Int Int)) (v_ArrVal_3810 (Array Int Int))) (or (not (= (store (select |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base|) |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.offset| (select v_ArrVal_3806 |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.offset|)) v_ArrVal_3806)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_3806) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_3809) (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.offset|) v_ArrVal_3810) (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ 8 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))))) is different from false [2025-02-06 10:38:19,013 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3806 (Array Int Int)) (v_ArrVal_3809 (Array Int Int)) (v_ArrVal_3810 (Array Int Int))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_3806) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_3809) (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.offset|) v_ArrVal_3810) (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ 8 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (not (= (store (select |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.offset| (select v_ArrVal_3806 |c_ULTIMATE.start_dll_circular_insert_~last~1#1.offset|)) v_ArrVal_3806)))) is different from false [2025-02-06 10:38:19,021 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3806 (Array Int Int)) (v_ArrVal_3809 (Array Int Int)) (v_ArrVal_3810 (Array Int Int))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_#t~mem10#1.base| v_ArrVal_3806) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_3809) (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_insert_#t~mem10#1.base|) |c_ULTIMATE.start_dll_circular_insert_#t~mem10#1.offset|) v_ArrVal_3810) (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ 8 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (not (= (store (select |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_#t~mem10#1.base|) |c_ULTIMATE.start_dll_circular_insert_#t~mem10#1.offset| (select v_ArrVal_3806 |c_ULTIMATE.start_dll_circular_insert_#t~mem10#1.offset|)) v_ArrVal_3806)))) is different from false [2025-02-06 10:38:19,030 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3806 (Array Int Int)) (v_ArrVal_3809 (Array Int Int)) (v_ArrVal_3810 (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_insert_~head#1.base|) |c_ULTIMATE.start_dll_circular_insert_~head#1.offset|)) (.cse1 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_insert_~head#1.base|) |c_ULTIMATE.start_dll_circular_insert_~head#1.offset|))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store (store |c_#memory_int#1| .cse0 v_ArrVal_3806) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_3809) (select (select |c_#memory_$Pointer$#1.base| .cse0) .cse1) v_ArrVal_3810) (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ 8 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (not (= v_ArrVal_3806 (store (select |c_#memory_int#1| .cse0) .cse1 (select v_ArrVal_3806 .cse1))))))) is different from false [2025-02-06 10:38:19,038 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3806 (Array Int Int)) (v_ArrVal_3809 (Array Int Int)) (v_ArrVal_3810 (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_insert_~head#1.base|) |c_ULTIMATE.start_dll_circular_insert_~head#1.offset|)) (.cse1 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_insert_~head#1.base|) |c_ULTIMATE.start_dll_circular_insert_~head#1.offset|))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store (store |c_#memory_int#1| .cse0 v_ArrVal_3806) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_3809) (select (select |c_#memory_$Pointer$#1.base| .cse0) .cse1) v_ArrVal_3810) (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ 8 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (not (= v_ArrVal_3806 (store (select |c_#memory_int#1| .cse0) .cse1 (select v_ArrVal_3806 .cse1))))))) is different from false [2025-02-06 10:38:19,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [608770627] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:38:19,202 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-06 10:38:19,202 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 37] total 71 [2025-02-06 10:38:19,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2090573780] [2025-02-06 10:38:19,202 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-06 10:38:19,202 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 71 states [2025-02-06 10:38:19,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:38:19,203 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2025-02-06 10:38:19,204 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=323, Invalid=5527, Unknown=30, NotChecked=1092, Total=6972 [2025-02-06 10:38:19,204 INFO L87 Difference]: Start difference. First operand 94 states and 99 transitions. Second operand has 71 states, 67 states have (on average 1.5671641791044777) internal successors, (105), 62 states have internal predecessors, (105), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-06 10:38:20,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:38:20,995 INFO L93 Difference]: Finished difference Result 98 states and 101 transitions. [2025-02-06 10:38:20,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2025-02-06 10:38:20,995 INFO L78 Accepts]: Start accepts. Automaton has has 71 states, 67 states have (on average 1.5671641791044777) internal successors, (105), 62 states have internal predecessors, (105), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 62 [2025-02-06 10:38:20,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:38:20,996 INFO L225 Difference]: With dead ends: 98 [2025-02-06 10:38:20,996 INFO L226 Difference]: Without dead ends: 98 [2025-02-06 10:38:20,999 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 106 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 2675 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=554, Invalid=9544, Unknown=30, NotChecked=1428, Total=11556 [2025-02-06 10:38:20,999 INFO L435 NwaCegarLoop]: 50 mSDtfsCounter, 56 mSDsluCounter, 1353 mSDsCounter, 0 mSdLazyCounter, 1707 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 1403 SdHoareTripleChecker+Invalid, 1729 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 1707 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-02-06 10:38:20,999 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 1403 Invalid, 1729 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 1707 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-02-06 10:38:21,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2025-02-06 10:38:21,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 94. [2025-02-06 10:38:21,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 74 states have (on average 1.2432432432432432) internal successors, (92), 88 states have internal predecessors, (92), 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-06 10:38:21,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 98 transitions. [2025-02-06 10:38:21,002 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 98 transitions. Word has length 62 [2025-02-06 10:38:21,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:38:21,003 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 98 transitions. [2025-02-06 10:38:21,003 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 71 states, 67 states have (on average 1.5671641791044777) internal successors, (105), 62 states have internal predecessors, (105), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-06 10:38:21,003 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 98 transitions. [2025-02-06 10:38:21,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-02-06 10:38:21,003 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:38:21,003 INFO L218 NwaCegarLoop]: trace histogram [3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:38:21,014 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2025-02-06 10:38:21,204 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,18 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:38:21,204 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 69 more)] === [2025-02-06 10:38:21,206 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:38:21,206 INFO L85 PathProgramCache]: Analyzing trace with hash 32927634, now seen corresponding path program 1 times [2025-02-06 10:38:21,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:38:21,206 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121852164] [2025-02-06 10:38:21,206 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:38:21,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:38:21,222 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-02-06 10:38:21,235 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-02-06 10:38:21,235 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:38:21,235 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:38:22,331 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 22 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-06 10:38:22,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:38:22,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1121852164] [2025-02-06 10:38:22,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1121852164] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:38:22,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1207770537] [2025-02-06 10:38:22,331 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:38:22,332 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:38:22,332 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:38:22,334 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 10:38:22,336 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2025-02-06 10:38:22,557 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-02-06 10:38:22,611 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-02-06 10:38:22,611 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:38:22,611 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:38:22,614 INFO L256 TraceCheckSpWp]: Trace formula consists of 557 conjuncts, 80 conjuncts are in the unsatisfiable core [2025-02-06 10:38:22,616 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:38:22,621 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-06 10:38:22,694 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-06 10:38:22,695 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-06 10:38:22,745 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-06 10:38:22,786 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-06 10:38:22,893 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-02-06 10:38:22,893 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-06 10:38:22,923 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 17 [2025-02-06 10:38:22,989 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-06 10:38:22,992 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-06 10:38:23,136 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 10:38:23,137 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-06 10:38:23,163 INFO L349 Elim1Store]: treesize reduction 88, result has 36.7 percent of original size [2025-02-06 10:38:23,163 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-06 10:38:23,359 INFO L349 Elim1Store]: treesize reduction 33, result has 48.4 percent of original size [2025-02-06 10:38:23,359 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-06 10:38:23,512 INFO L349 Elim1Store]: treesize reduction 25, result has 26.5 percent of original size [2025-02-06 10:38:23,513 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-06 10:38:23,541 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-06 10:38:23,637 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 97 treesize of output 74 [2025-02-06 10:38:23,685 INFO L349 Elim1Store]: treesize reduction 41, result has 44.6 percent of original size [2025-02-06 10:38:23,685 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 126 treesize of output 92 [2025-02-06 10:38:23,919 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 240 treesize of output 180 [2025-02-06 10:38:23,923 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 179 treesize of output 147 [2025-02-06 10:38:24,348 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 10:38:24,349 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 151 treesize of output 117 [2025-02-06 10:38:24,678 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 10 proven. 17 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 10:38:24,678 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:38:46,840 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4053 (Array Int Int)) (|ULTIMATE.start_dll_circular_insert_~last~1#1.offset| Int) (|ULTIMATE.start_dll_circular_insert_~last~1#1.base| Int)) (= (select |c_#valid| (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_4053))) (store .cse0 |ULTIMATE.start_dll_circular_insert_~last~1#1.base| (store (select .cse0 |ULTIMATE.start_dll_circular_insert_~last~1#1.base|) (+ |ULTIMATE.start_dll_circular_insert_~last~1#1.offset| 4) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|))) (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) 1)) is different from false [2025-02-06 10:38:47,321 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4053 (Array Int Int)) (|v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_38| Int) (|ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.offset| Int) (|ULTIMATE.start_dll_circular_insert_~last~1#1.offset| Int) (|ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| Int) (v_ArrVal_4062 (Array Int Int)) (|ULTIMATE.start_dll_circular_insert_~last~1#1.base| Int)) (or (= (select (store |c_#valid| |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_38| 1) (select (select (let ((.cse0 (store (store |c_#memory_$Pointer$#1.base| |ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| (store (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_38| v_ArrVal_4062) |ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base|) |ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.offset| |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_38|)) |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_38| v_ArrVal_4053))) (store .cse0 |ULTIMATE.start_dll_circular_insert_~last~1#1.base| (store (select .cse0 |ULTIMATE.start_dll_circular_insert_~last~1#1.base|) (+ |ULTIMATE.start_dll_circular_insert_~last~1#1.offset| 4) |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_38|))) (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) 1) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_38|) 0)))) is different from false [2025-02-06 10:38:47,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1207770537] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:38:47,323 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-06 10:38:47,323 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 29] total 49 [2025-02-06 10:38:47,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1706810385] [2025-02-06 10:38:47,323 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-06 10:38:47,324 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2025-02-06 10:38:47,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:38:47,325 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2025-02-06 10:38:47,330 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=2704, Unknown=9, NotChecked=210, Total=3080 [2025-02-06 10:38:47,330 INFO L87 Difference]: Start difference. First operand 94 states and 98 transitions. Second operand has 50 states, 47 states have (on average 2.297872340425532) internal successors, (108), 43 states have internal predecessors, (108), 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)