./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/list-simple/dll2c_remove_all_reverse.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_remove_all_reverse.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 a81d76a671fec08918102c7898e8919d02b265d05707efa1508363dab4714d44 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 10:37:47,120 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 10:37:47,172 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:47,178 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 10:37:47,178 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 10:37:47,200 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 10:37:47,200 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 10:37:47,202 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 10:37:47,202 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 10:37:47,202 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 10:37:47,202 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 10:37:47,202 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 10:37:47,203 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 10:37:47,203 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 10:37:47,203 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 10:37:47,203 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 10:37:47,203 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 10:37:47,204 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 10:37:47,204 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 10:37:47,204 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 10:37:47,204 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-02-06 10:37:47,204 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-02-06 10:37:47,204 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-02-06 10:37:47,204 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 10:37:47,204 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-06 10:37:47,205 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-06 10:37:47,205 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 10:37:47,205 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 10:37:47,205 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 10:37:47,205 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 10:37:47,205 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 10:37:47,205 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 10:37:47,205 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 10:37:47,205 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 10:37:47,205 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 10:37:47,206 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 10:37:47,206 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 10:37:47,206 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 10:37:47,206 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 10:37:47,206 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 10:37:47,206 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 10:37:47,206 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 10:37:47,206 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 -> a81d76a671fec08918102c7898e8919d02b265d05707efa1508363dab4714d44 [2025-02-06 10:37:47,430 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 10:37:47,438 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 10:37:47,440 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 10:37:47,442 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 10:37:47,442 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 10:37:47,443 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-simple/dll2c_remove_all_reverse.i [2025-02-06 10:37:48,598 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8e8333f7d/a6ba38b3f8ef46b8b7d7f751b50e8f28/FLAG08f59602b [2025-02-06 10:37:48,854 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 10:37:48,855 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/list-simple/dll2c_remove_all_reverse.i [2025-02-06 10:37:48,863 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8e8333f7d/a6ba38b3f8ef46b8b7d7f751b50e8f28/FLAG08f59602b [2025-02-06 10:37:49,172 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8e8333f7d/a6ba38b3f8ef46b8b7d7f751b50e8f28 [2025-02-06 10:37:49,174 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 10:37:49,175 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 10:37:49,175 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 10:37:49,175 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 10:37:49,178 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 10:37:49,179 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 10:37:49" (1/1) ... [2025-02-06 10:37:49,180 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2217ad44 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:37:49, skipping insertion in model container [2025-02-06 10:37:49,180 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 10:37:49" (1/1) ... [2025-02-06 10:37:49,202 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 10:37:49,415 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 10:37:49,422 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 10:37:49,458 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 10:37:49,479 INFO L204 MainTranslator]: Completed translation [2025-02-06 10:37:49,480 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:37:49 WrapperNode [2025-02-06 10:37:49,480 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 10:37:49,481 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 10:37:49,481 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 10:37:49,481 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 10:37:49,487 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:49" (1/1) ... [2025-02-06 10:37:49,495 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:49" (1/1) ... [2025-02-06 10:37:49,512 INFO L138 Inliner]: procedures = 126, calls = 38, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 108 [2025-02-06 10:37:49,512 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 10:37:49,512 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 10:37:49,512 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 10:37:49,513 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 10:37:49,519 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:49" (1/1) ... [2025-02-06 10:37:49,519 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:49" (1/1) ... [2025-02-06 10:37:49,521 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:49" (1/1) ... [2025-02-06 10:37:49,533 INFO L175 MemorySlicer]: Split 21 memory accesses to 3 slices as follows [2, 8, 11]. 52 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 1, 0]. The 10 writes are split as follows [0, 1, 9]. [2025-02-06 10:37:49,534 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:49" (1/1) ... [2025-02-06 10:37:49,534 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:49" (1/1) ... [2025-02-06 10:37:49,540 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:49" (1/1) ... [2025-02-06 10:37:49,541 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:49" (1/1) ... [2025-02-06 10:37:49,545 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:49" (1/1) ... [2025-02-06 10:37:49,546 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:49" (1/1) ... [2025-02-06 10:37:49,548 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 10:37:49,548 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 10:37:49,549 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 10:37:49,549 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 10:37:49,549 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:37:49" (1/1) ... [2025-02-06 10:37:49,553 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 10:37:49,561 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:37:49,572 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:49,574 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:49,593 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-06 10:37:49,593 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-06 10:37:49,593 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-06 10:37:49,593 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2025-02-06 10:37:49,593 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2025-02-06 10:37:49,593 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-06 10:37:49,593 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 10:37:49,593 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-06 10:37:49,593 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-02-06 10:37:49,593 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-02-06 10:37:49,593 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-02-06 10:37:49,593 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-02-06 10:37:49,593 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-02-06 10:37:49,594 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-02-06 10:37:49,594 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-06 10:37:49,594 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-02-06 10:37:49,594 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-02-06 10:37:49,594 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-02-06 10:37:49,594 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 10:37:49,594 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-06 10:37:49,594 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-06 10:37:49,594 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 10:37:49,594 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 10:37:49,688 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 10:37:49,689 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 10:37:49,857 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L616: 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:49,880 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:49,897 INFO L? ?]: Removed 107 outVars from TransFormulas that were not future-live. [2025-02-06 10:37:49,897 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 10:37:49,906 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 10:37:49,906 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 10:37:49,906 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 10:37:49 BoogieIcfgContainer [2025-02-06 10:37:49,906 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 10:37:49,911 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 10:37:49,911 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 10:37:49,914 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 10:37:49,915 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 10:37:49" (1/3) ... [2025-02-06 10:37:49,915 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24f82557 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 10:37:49, skipping insertion in model container [2025-02-06 10:37:49,915 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:37:49" (2/3) ... [2025-02-06 10:37:49,915 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24f82557 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 10:37:49, skipping insertion in model container [2025-02-06 10:37:49,915 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 10:37:49" (3/3) ... [2025-02-06 10:37:49,916 INFO L128 eAbstractionObserver]: Analyzing ICFG dll2c_remove_all_reverse.i [2025-02-06 10:37:49,926 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 10:37:49,927 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG dll2c_remove_all_reverse.i that has 2 procedures, 100 locations, 1 initial locations, 2 loop locations, and 44 error locations. [2025-02-06 10:37:49,958 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 10:37:49,967 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;@1d69c1fb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 10:37:49,968 INFO L334 AbstractCegarLoop]: Starting to check reachability of 44 error locations. [2025-02-06 10:37:49,971 INFO L276 IsEmpty]: Start isEmpty. Operand has 100 states, 52 states have (on average 1.9807692307692308) internal successors, (103), 96 states have internal predecessors, (103), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-06 10:37:49,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-02-06 10:37:49,975 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:37:49,976 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-02-06 10:37:49,977 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting node_createErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2025-02-06 10:37:49,981 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:37:49,981 INFO L85 PathProgramCache]: Analyzing trace with hash -597317354, now seen corresponding path program 1 times [2025-02-06 10:37:49,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:37:49,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [105886697] [2025-02-06 10:37:49,986 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:37:49,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:37:50,047 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-06 10:37:50,063 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-06 10:37:50,064 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:37:50,064 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:37:50,167 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:50,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:37:50,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [105886697] [2025-02-06 10:37:50,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [105886697] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:37:50,168 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:37:50,169 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 10:37:50,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1941283362] [2025-02-06 10:37:50,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:37:50,172 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 10:37:50,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:37:50,187 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 10:37:50,188 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 10:37:50,189 INFO L87 Difference]: Start difference. First operand has 100 states, 52 states have (on average 1.9807692307692308) internal successors, (103), 96 states have internal predecessors, (103), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:37:50,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:37:50,275 INFO L93 Difference]: Finished difference Result 96 states and 101 transitions. [2025-02-06 10:37:50,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 10:37:50,278 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:50,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:37:50,282 INFO L225 Difference]: With dead ends: 96 [2025-02-06 10:37:50,283 INFO L226 Difference]: Without dead ends: 93 [2025-02-06 10:37:50,284 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:50,287 INFO L435 NwaCegarLoop]: 92 mSDtfsCounter, 3 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:37:50,288 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 144 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 10:37:50,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2025-02-06 10:37:50,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2025-02-06 10:37:50,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 49 states have (on average 1.8979591836734695) internal successors, (93), 89 states have internal predecessors, (93), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-06 10:37:50,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 97 transitions. [2025-02-06 10:37:50,333 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 97 transitions. Word has length 6 [2025-02-06 10:37:50,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:37:50,334 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 97 transitions. [2025-02-06 10:37:50,334 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:50,334 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 97 transitions. [2025-02-06 10:37:50,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-02-06 10:37:50,334 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:37:50,334 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-02-06 10:37:50,334 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 10:37:50,334 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting node_createErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2025-02-06 10:37:50,335 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:37:50,335 INFO L85 PathProgramCache]: Analyzing trace with hash -597317353, now seen corresponding path program 1 times [2025-02-06 10:37:50,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:37:50,335 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [781487548] [2025-02-06 10:37:50,335 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:37:50,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:37:50,343 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-06 10:37:50,355 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-06 10:37:50,358 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:37:50,358 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:37:50,444 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:50,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:37:50,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [781487548] [2025-02-06 10:37:50,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [781487548] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:37:50,445 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:37:50,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 10:37:50,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2107044968] [2025-02-06 10:37:50,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:37:50,446 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 10:37:50,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:37:50,447 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 10:37:50,447 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 10:37:50,447 INFO L87 Difference]: Start difference. First operand 93 states and 97 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:50,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:37:50,499 INFO L93 Difference]: Finished difference Result 90 states and 94 transitions. [2025-02-06 10:37:50,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 10:37:50,500 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:50,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:37:50,500 INFO L225 Difference]: With dead ends: 90 [2025-02-06 10:37:50,501 INFO L226 Difference]: Without dead ends: 90 [2025-02-06 10:37:50,501 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:50,502 INFO L435 NwaCegarLoop]: 89 mSDtfsCounter, 3 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 10:37:50,503 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 145 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 10:37:50,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2025-02-06 10:37:50,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2025-02-06 10:37:50,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 49 states have (on average 1.836734693877551) internal successors, (90), 86 states have internal predecessors, (90), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-06 10:37:50,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 94 transitions. [2025-02-06 10:37:50,508 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 94 transitions. Word has length 6 [2025-02-06 10:37:50,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:37:50,508 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 94 transitions. [2025-02-06 10:37:50,508 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:50,508 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 94 transitions. [2025-02-06 10:37:50,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-02-06 10:37:50,508 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:37:50,508 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:37:50,510 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 10:37:50,510 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2025-02-06 10:37:50,511 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:37:50,511 INFO L85 PathProgramCache]: Analyzing trace with hash -433449030, now seen corresponding path program 1 times [2025-02-06 10:37:50,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:37:50,512 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869140436] [2025-02-06 10:37:50,512 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:37:50,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:37:50,523 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-02-06 10:37:50,531 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-02-06 10:37:50,532 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:37:50,532 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:37:50,577 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:50,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:37:50,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [869140436] [2025-02-06 10:37:50,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [869140436] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:37:50,577 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:37:50,577 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 10:37:50,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663531498] [2025-02-06 10:37:50,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:37:50,577 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 10:37:50,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:37:50,578 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 10:37:50,578 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 10:37:50,578 INFO L87 Difference]: Start difference. First operand 90 states and 94 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:50,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:37:50,591 INFO L93 Difference]: Finished difference Result 101 states and 107 transitions. [2025-02-06 10:37:50,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 10:37:50,593 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:50,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:37:50,594 INFO L225 Difference]: With dead ends: 101 [2025-02-06 10:37:50,595 INFO L226 Difference]: Without dead ends: 101 [2025-02-06 10:37:50,596 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:50,596 INFO L435 NwaCegarLoop]: 92 mSDtfsCounter, 10 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 179 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:50,596 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 179 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:50,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2025-02-06 10:37:50,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 91. [2025-02-06 10:37:50,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 50 states have (on average 1.82) internal successors, (91), 87 states have internal predecessors, (91), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-06 10:37:50,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 95 transitions. [2025-02-06 10:37:50,602 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 95 transitions. Word has length 14 [2025-02-06 10:37:50,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:37:50,603 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 95 transitions. [2025-02-06 10:37:50,603 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:50,603 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 95 transitions. [2025-02-06 10:37:50,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-02-06 10:37:50,603 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:37:50,603 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:50,604 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 10:37:50,606 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2025-02-06 10:37:50,606 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:37:50,606 INFO L85 PathProgramCache]: Analyzing trace with hash 1368734428, now seen corresponding path program 1 times [2025-02-06 10:37:50,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:37:50,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1149378096] [2025-02-06 10:37:50,606 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:37:50,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:37:50,622 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-02-06 10:37:50,634 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-02-06 10:37:50,635 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:37:50,635 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:37:50,751 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:50,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:37:50,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1149378096] [2025-02-06 10:37:50,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1149378096] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:37:50,752 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:37:50,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 10:37:50,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [450969124] [2025-02-06 10:37:50,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:37:50,753 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 10:37:50,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:37:50,753 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 10:37:50,754 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 10:37:50,754 INFO L87 Difference]: Start difference. First operand 91 states and 95 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:50,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:37:50,887 INFO L93 Difference]: Finished difference Result 90 states and 94 transitions. [2025-02-06 10:37:50,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 10:37:50,887 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:50,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:37:50,888 INFO L225 Difference]: With dead ends: 90 [2025-02-06 10:37:50,888 INFO L226 Difference]: Without dead ends: 90 [2025-02-06 10:37:50,888 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:50,889 INFO L435 NwaCegarLoop]: 82 mSDtfsCounter, 7 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 194 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 256 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:37:50,889 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 256 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 194 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 10:37:50,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2025-02-06 10:37:50,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2025-02-06 10:37:50,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 50 states have (on average 1.8) internal successors, (90), 86 states have internal predecessors, (90), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-06 10:37:50,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 94 transitions. [2025-02-06 10:37:50,897 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 94 transitions. Word has length 24 [2025-02-06 10:37:50,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:37:50,897 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 94 transitions. [2025-02-06 10:37:50,897 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:50,897 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 94 transitions. [2025-02-06 10:37:50,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-02-06 10:37:50,899 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:37:50,899 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:50,899 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 10:37:50,899 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr37REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2025-02-06 10:37:50,899 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:37:50,899 INFO L85 PathProgramCache]: Analyzing trace with hash 1368734429, now seen corresponding path program 1 times [2025-02-06 10:37:50,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:37:50,899 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [74735963] [2025-02-06 10:37:50,900 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:37:50,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:37:50,914 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-02-06 10:37:50,924 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-02-06 10:37:50,924 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:37:50,924 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:37:51,097 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:51,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:37:51,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [74735963] [2025-02-06 10:37:51,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [74735963] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:37:51,097 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:37:51,097 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 10:37:51,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [481560194] [2025-02-06 10:37:51,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:37:51,098 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 10:37:51,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:37:51,098 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 10:37:51,098 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-06 10:37:51,099 INFO L87 Difference]: Start difference. First operand 90 states and 94 transitions. Second operand has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 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:51,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:37:51,202 INFO L93 Difference]: Finished difference Result 89 states and 93 transitions. [2025-02-06 10:37:51,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 10:37:51,202 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 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:51,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:37:51,203 INFO L225 Difference]: With dead ends: 89 [2025-02-06 10:37:51,203 INFO L226 Difference]: Without dead ends: 89 [2025-02-06 10:37:51,203 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-06 10:37:51,204 INFO L435 NwaCegarLoop]: 82 mSDtfsCounter, 9 mSDsluCounter, 279 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 361 SdHoareTripleChecker+Invalid, 172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:37:51,204 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 361 Invalid, 172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 10:37:51,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2025-02-06 10:37:51,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2025-02-06 10:37:51,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 50 states have (on average 1.78) internal successors, (89), 85 states have internal predecessors, (89), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-06 10:37:51,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 93 transitions. [2025-02-06 10:37:51,207 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 93 transitions. Word has length 24 [2025-02-06 10:37:51,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:37:51,207 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 93 transitions. [2025-02-06 10:37:51,207 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 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:51,207 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 93 transitions. [2025-02-06 10:37:51,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-02-06 10:37:51,208 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:37:51,208 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:51,208 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 10:37:51,208 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2025-02-06 10:37:51,208 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:37:51,209 INFO L85 PathProgramCache]: Analyzing trace with hash 1093794425, now seen corresponding path program 1 times [2025-02-06 10:37:51,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:37:51,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1372185404] [2025-02-06 10:37:51,209 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:37:51,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:37:51,221 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-02-06 10:37:51,229 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-02-06 10:37:51,230 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:37:51,230 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:37:51,398 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:51,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:37:51,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1372185404] [2025-02-06 10:37:51,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1372185404] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:37:51,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [104199791] [2025-02-06 10:37:51,398 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:37:51,398 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:37:51,399 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:37:51,400 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:51,402 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:51,458 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-02-06 10:37:51,482 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-02-06 10:37:51,482 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:37:51,482 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:37:51,484 INFO L256 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-02-06 10:37:51,488 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:37:51,516 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:51,577 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-02-06 10:37:51,577 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:51,620 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:51,620 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:37:51,923 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:51,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [104199791] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 10:37:51,924 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 10:37:51,924 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 10] total 17 [2025-02-06 10:37:51,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936300342] [2025-02-06 10:37:51,924 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 10:37:51,924 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-02-06 10:37:51,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:37:51,924 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-02-06 10:37:51,925 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=248, Unknown=0, NotChecked=0, Total=306 [2025-02-06 10:37:51,925 INFO L87 Difference]: Start difference. First operand 89 states and 93 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:52,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:37:52,254 INFO L93 Difference]: Finished difference Result 94 states and 101 transitions. [2025-02-06 10:37:52,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 10:37:52,255 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:52,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:37:52,256 INFO L225 Difference]: With dead ends: 94 [2025-02-06 10:37:52,256 INFO L226 Difference]: Without dead ends: 94 [2025-02-06 10:37:52,256 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:52,256 INFO L435 NwaCegarLoop]: 78 mSDtfsCounter, 2 mSDsluCounter, 429 mSDsCounter, 0 mSdLazyCounter, 549 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 507 SdHoareTripleChecker+Invalid, 558 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 549 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 10:37:52,257 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 507 Invalid, 558 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 549 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 10:37:52,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2025-02-06 10:37:52,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2025-02-06 10:37:52,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 54 states have (on average 1.7592592592592593) internal successors, (95), 89 states have internal predecessors, (95), 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:52,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 101 transitions. [2025-02-06 10:37:52,261 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 101 transitions. Word has length 26 [2025-02-06 10:37:52,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:37:52,261 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 101 transitions. [2025-02-06 10:37:52,261 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:52,261 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 101 transitions. [2025-02-06 10:37:52,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-02-06 10:37:52,262 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:37:52,262 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:52,268 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:52,462 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:52,463 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2025-02-06 10:37:52,463 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:37:52,463 INFO L85 PathProgramCache]: Analyzing trace with hash 1093794426, now seen corresponding path program 1 times [2025-02-06 10:37:52,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:37:52,463 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1895212234] [2025-02-06 10:37:52,463 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:37:52,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:37:52,473 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-02-06 10:37:52,480 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-02-06 10:37:52,480 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:37:52,480 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:37:52,807 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:52,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:37:52,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1895212234] [2025-02-06 10:37:52,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1895212234] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:37:52,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1772840354] [2025-02-06 10:37:52,808 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:37:52,808 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:37:52,808 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:37:52,810 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:52,811 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:52,874 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-02-06 10:37:52,902 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-02-06 10:37:52,902 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:37:52,903 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:37:52,904 INFO L256 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-02-06 10:37:52,906 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:37:52,918 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:53,069 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-02-06 10:37:53,070 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:53,108 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:53,108 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:37:53,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1772840354] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:37:53,245 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-06 10:37:53,245 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7] total 14 [2025-02-06 10:37:53,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2060929106] [2025-02-06 10:37:53,245 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-06 10:37:53,245 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-02-06 10:37:53,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:37:53,246 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-02-06 10:37:53,246 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=228, Unknown=0, NotChecked=0, Total=272 [2025-02-06 10:37:53,246 INFO L87 Difference]: Start difference. First operand 94 states and 101 transitions. Second operand has 15 states, 14 states have (on average 2.5714285714285716) internal successors, (36), 11 states have internal predecessors, (36), 3 states have call successors, (3), 3 states have call predecessors, (3), 4 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-02-06 10:37:53,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:37:53,623 INFO L93 Difference]: Finished difference Result 95 states and 101 transitions. [2025-02-06 10:37:53,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 10:37:53,624 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 2.5714285714285716) internal successors, (36), 11 states have internal predecessors, (36), 3 states have call successors, (3), 3 states have call predecessors, (3), 4 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 26 [2025-02-06 10:37:53,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:37:53,625 INFO L225 Difference]: With dead ends: 95 [2025-02-06 10:37:53,625 INFO L226 Difference]: Without dead ends: 95 [2025-02-06 10:37:53,625 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=63, Invalid=317, Unknown=0, NotChecked=0, Total=380 [2025-02-06 10:37:53,626 INFO L435 NwaCegarLoop]: 80 mSDtfsCounter, 1 mSDsluCounter, 368 mSDsCounter, 0 mSdLazyCounter, 458 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 448 SdHoareTripleChecker+Invalid, 466 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 458 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 10:37:53,626 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 448 Invalid, 466 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 458 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 10:37:53,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2025-02-06 10:37:53,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 94. [2025-02-06 10:37:53,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 54 states have (on average 1.7407407407407407) internal successors, (94), 89 states have internal predecessors, (94), 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:53,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 100 transitions. [2025-02-06 10:37:53,629 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 100 transitions. Word has length 26 [2025-02-06 10:37:53,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:37:53,629 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 100 transitions. [2025-02-06 10:37:53,630 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 2.5714285714285716) internal successors, (36), 11 states have internal predecessors, (36), 3 states have call successors, (3), 3 states have call predecessors, (3), 4 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-02-06 10:37:53,630 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 100 transitions. [2025-02-06 10:37:53,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-02-06 10:37:53,630 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:37:53,630 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:53,637 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:53,830 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:53,831 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2025-02-06 10:37:53,831 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:37:53,831 INFO L85 PathProgramCache]: Analyzing trace with hash -1130514328, now seen corresponding path program 1 times [2025-02-06 10:37:53,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:37:53,832 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481400594] [2025-02-06 10:37:53,832 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:37:53,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:37:53,842 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-02-06 10:37:53,848 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-02-06 10:37:53,848 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:37:53,848 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:37:53,900 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:53,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:37:53,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1481400594] [2025-02-06 10:37:53,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1481400594] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:37:53,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1103371305] [2025-02-06 10:37:53,901 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:37:53,901 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:37:53,901 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:37:53,903 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:53,904 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:53,967 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-02-06 10:37:53,991 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-02-06 10:37:53,992 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:37:53,992 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:37:53,993 INFO L256 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-02-06 10:37:53,994 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:37:54,031 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:54,031 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:37:54,067 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:54,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1103371305] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 10:37:54,067 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 10:37:54,067 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 6 [2025-02-06 10:37:54,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [105338790] [2025-02-06 10:37:54,067 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 10:37:54,067 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 10:37:54,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:37:54,068 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 10:37:54,068 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 10:37:54,068 INFO L87 Difference]: Start difference. First operand 94 states and 100 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:54,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:37:54,105 INFO L93 Difference]: Finished difference Result 94 states and 99 transitions. [2025-02-06 10:37:54,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 10:37:54,106 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:54,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:37:54,106 INFO L225 Difference]: With dead ends: 94 [2025-02-06 10:37:54,107 INFO L226 Difference]: Without dead ends: 94 [2025-02-06 10:37:54,107 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:54,107 INFO L435 NwaCegarLoop]: 83 mSDtfsCounter, 1 mSDsluCounter, 316 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 399 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:54,107 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 399 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:54,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2025-02-06 10:37:54,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2025-02-06 10:37:54,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 54 states have (on average 1.7222222222222223) internal successors, (93), 89 states have internal predecessors, (93), 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:54,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 99 transitions. [2025-02-06 10:37:54,111 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 99 transitions. Word has length 28 [2025-02-06 10:37:54,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:37:54,111 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 99 transitions. [2025-02-06 10:37:54,111 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:54,111 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 99 transitions. [2025-02-06 10:37:54,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-02-06 10:37:54,112 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:37:54,112 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:54,118 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:54,312 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:54,313 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2025-02-06 10:37:54,313 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:37:54,313 INFO L85 PathProgramCache]: Analyzing trace with hash -687110551, now seen corresponding path program 1 times [2025-02-06 10:37:54,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:37:54,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731928131] [2025-02-06 10:37:54,313 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:37:54,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:37:54,327 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-02-06 10:37:54,335 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-02-06 10:37:54,335 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:37:54,335 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:37:54,390 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:54,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:37:54,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [731928131] [2025-02-06 10:37:54,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [731928131] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:37:54,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1092433333] [2025-02-06 10:37:54,390 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:37:54,391 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:37:54,391 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:37:54,392 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:54,394 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:54,458 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-02-06 10:37:54,486 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-02-06 10:37:54,487 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:37:54,487 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:37:54,488 INFO L256 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-02-06 10:37:54,491 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:37:54,512 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:54,550 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:54,591 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-02-06 10:37:54,591 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:54,598 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:54,599 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:37:54,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1092433333] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:37:54,636 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-06 10:37:54,636 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 7] total 9 [2025-02-06 10:37:54,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1411546357] [2025-02-06 10:37:54,636 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-06 10:37:54,636 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-06 10:37:54,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:37:54,637 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-06 10:37:54,637 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=72, Unknown=1, NotChecked=16, Total=110 [2025-02-06 10:37:54,637 INFO L87 Difference]: Start difference. First operand 94 states and 99 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:54,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:37:54,823 INFO L93 Difference]: Finished difference Result 93 states and 98 transitions. [2025-02-06 10:37:54,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 10:37:54,823 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:54,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:37:54,824 INFO L225 Difference]: With dead ends: 93 [2025-02-06 10:37:54,824 INFO L226 Difference]: Without dead ends: 93 [2025-02-06 10:37:54,824 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:54,824 INFO L435 NwaCegarLoop]: 75 mSDtfsCounter, 9 mSDsluCounter, 241 mSDsCounter, 0 mSdLazyCounter, 295 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 316 SdHoareTripleChecker+Invalid, 388 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 295 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 91 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:37:54,824 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 316 Invalid, 388 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 295 Invalid, 0 Unknown, 91 Unchecked, 0.1s Time] [2025-02-06 10:37:54,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2025-02-06 10:37:54,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2025-02-06 10:37:54,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 54 states have (on average 1.7037037037037037) internal successors, (92), 88 states have internal predecessors, (92), 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:54,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 98 transitions. [2025-02-06 10:37:54,827 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 98 transitions. Word has length 29 [2025-02-06 10:37:54,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:37:54,830 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 98 transitions. [2025-02-06 10:37:54,831 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:54,831 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 98 transitions. [2025-02-06 10:37:54,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-02-06 10:37:54,831 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:37:54,831 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:54,838 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-02-06 10:37:55,032 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:55,033 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2025-02-06 10:37:55,033 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:37:55,033 INFO L85 PathProgramCache]: Analyzing trace with hash -687110550, now seen corresponding path program 1 times [2025-02-06 10:37:55,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:37:55,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1111709569] [2025-02-06 10:37:55,033 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:37:55,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:37:55,043 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-02-06 10:37:55,053 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-02-06 10:37:55,053 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:37:55,053 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:37:55,163 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:55,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:37:55,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1111709569] [2025-02-06 10:37:55,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1111709569] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:37:55,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [448570883] [2025-02-06 10:37:55,163 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:37:55,163 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:37:55,164 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:37:55,165 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:55,166 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:55,232 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-02-06 10:37:55,255 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-02-06 10:37:55,256 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:37:55,256 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:37:55,257 INFO L256 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-02-06 10:37:55,258 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:37:55,334 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:55,335 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:37:55,360 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 10:37:55,360 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:55,457 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:55,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [448570883] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 10:37:55,458 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 10:37:55,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 13 [2025-02-06 10:37:55,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1963123948] [2025-02-06 10:37:55,458 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 10:37:55,458 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-02-06 10:37:55,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:37:55,459 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-02-06 10:37:55,459 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2025-02-06 10:37:55,459 INFO L87 Difference]: Start difference. First operand 93 states and 98 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:55,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:37:55,595 INFO L93 Difference]: Finished difference Result 100 states and 107 transitions. [2025-02-06 10:37:55,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 10:37:55,596 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:55,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:37:55,597 INFO L225 Difference]: With dead ends: 100 [2025-02-06 10:37:55,597 INFO L226 Difference]: Without dead ends: 100 [2025-02-06 10:37:55,597 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:55,598 INFO L435 NwaCegarLoop]: 82 mSDtfsCounter, 9 mSDsluCounter, 687 mSDsCounter, 0 mSdLazyCounter, 236 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 769 SdHoareTripleChecker+Invalid, 237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 236 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:37:55,598 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 769 Invalid, 237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 236 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 10:37:55,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2025-02-06 10:37:55,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 96. [2025-02-06 10:37:55,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 57 states have (on average 1.6842105263157894) internal successors, (96), 91 states have internal predecessors, (96), 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:55,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 102 transitions. [2025-02-06 10:37:55,608 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 102 transitions. Word has length 29 [2025-02-06 10:37:55,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:37:55,609 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 102 transitions. [2025-02-06 10:37:55,609 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:55,609 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 102 transitions. [2025-02-06 10:37:55,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-02-06 10:37:55,609 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:37:55,609 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:55,615 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-02-06 10:37:55,809 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:55,810 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2025-02-06 10:37:55,810 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:37:55,810 INFO L85 PathProgramCache]: Analyzing trace with hash 174409442, now seen corresponding path program 1 times [2025-02-06 10:37:55,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:37:55,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [8826070] [2025-02-06 10:37:55,810 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:37:55,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:37:55,819 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-02-06 10:37:55,824 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-02-06 10:37:55,824 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:37:55,824 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:37:55,891 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:55,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:37:55,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [8826070] [2025-02-06 10:37:55,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [8826070] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:37:55,892 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:37:55,892 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 10:37:55,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [84283365] [2025-02-06 10:37:55,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:37:55,894 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 10:37:55,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:37:55,894 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 10:37:55,894 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-06 10:37:55,894 INFO L87 Difference]: Start difference. First operand 96 states and 102 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:56,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:37:56,022 INFO L93 Difference]: Finished difference Result 95 states and 101 transitions. [2025-02-06 10:37:56,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 10:37:56,022 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:56,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:37:56,023 INFO L225 Difference]: With dead ends: 95 [2025-02-06 10:37:56,023 INFO L226 Difference]: Without dead ends: 95 [2025-02-06 10:37:56,023 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:56,023 INFO L435 NwaCegarLoop]: 79 mSDtfsCounter, 7 mSDsluCounter, 206 mSDsCounter, 0 mSdLazyCounter, 251 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 285 SdHoareTripleChecker+Invalid, 252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 251 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:37:56,024 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 285 Invalid, 252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 251 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 10:37:56,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2025-02-06 10:37:56,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2025-02-06 10:37:56,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 57 states have (on average 1.6666666666666667) internal successors, (95), 90 states have internal predecessors, (95), 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:56,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 101 transitions. [2025-02-06 10:37:56,026 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 101 transitions. Word has length 30 [2025-02-06 10:37:56,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:37:56,026 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 101 transitions. [2025-02-06 10:37:56,026 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:56,026 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 101 transitions. [2025-02-06 10:37:56,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-02-06 10:37:56,026 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:37:56,026 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:56,027 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-06 10:37:56,027 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2025-02-06 10:37:56,027 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:37:56,027 INFO L85 PathProgramCache]: Analyzing trace with hash 174409443, now seen corresponding path program 1 times [2025-02-06 10:37:56,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:37:56,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671499279] [2025-02-06 10:37:56,027 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:37:56,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:37:56,036 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-02-06 10:37:56,044 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-02-06 10:37:56,045 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:37:56,045 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:37:56,157 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:56,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:37:56,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [671499279] [2025-02-06 10:37:56,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [671499279] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:37:56,158 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:37:56,158 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 10:37:56,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1549871659] [2025-02-06 10:37:56,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:37:56,158 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 10:37:56,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:37:56,158 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 10:37:56,159 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-06 10:37:56,159 INFO L87 Difference]: Start difference. First operand 95 states and 101 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:56,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:37:56,277 INFO L93 Difference]: Finished difference Result 94 states and 100 transitions. [2025-02-06 10:37:56,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 10:37:56,278 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:56,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:37:56,278 INFO L225 Difference]: With dead ends: 94 [2025-02-06 10:37:56,278 INFO L226 Difference]: Without dead ends: 94 [2025-02-06 10:37:56,278 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:56,279 INFO L435 NwaCegarLoop]: 78 mSDtfsCounter, 6 mSDsluCounter, 232 mSDsCounter, 0 mSdLazyCounter, 220 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 310 SdHoareTripleChecker+Invalid, 220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 220 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:37:56,279 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 310 Invalid, 220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 220 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 10:37:56,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2025-02-06 10:37:56,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2025-02-06 10:37:56,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 57 states have (on average 1.6491228070175439) internal successors, (94), 89 states have internal predecessors, (94), 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:56,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 100 transitions. [2025-02-06 10:37:56,281 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 100 transitions. Word has length 30 [2025-02-06 10:37:56,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:37:56,281 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 100 transitions. [2025-02-06 10:37:56,281 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:56,281 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 100 transitions. [2025-02-06 10:37:56,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-02-06 10:37:56,281 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:37:56,281 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, 1, 1, 1, 1] [2025-02-06 10:37:56,281 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-06 10:37:56,286 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2025-02-06 10:37:56,286 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:37:56,286 INFO L85 PathProgramCache]: Analyzing trace with hash 920041565, now seen corresponding path program 1 times [2025-02-06 10:37:56,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:37:56,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [124585032] [2025-02-06 10:37:56,286 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:37:56,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:37:56,297 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-02-06 10:37:56,304 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-02-06 10:37:56,304 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:37:56,304 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:37:56,487 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-06 10:37:56,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:37:56,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [124585032] [2025-02-06 10:37:56,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [124585032] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:37:56,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [509785143] [2025-02-06 10:37:56,488 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:37:56,488 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:37:56,488 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:37:56,490 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:56,491 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:56,564 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-02-06 10:37:56,590 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-02-06 10:37:56,591 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:37:56,591 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:37:56,592 INFO L256 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-02-06 10:37:56,594 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:37:56,597 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:56,613 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:56,683 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-02-06 10:37:56,683 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:56,716 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-02-06 10:37:56,717 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:56,757 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 7 not checked. [2025-02-06 10:37:56,757 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:37:56,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [509785143] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:37:56,935 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-06 10:37:56,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 13 [2025-02-06 10:37:56,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2039528367] [2025-02-06 10:37:56,935 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-06 10:37:56,935 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-02-06 10:37:56,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:37:56,936 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-02-06 10:37:56,936 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=274, Unknown=1, NotChecked=34, Total=380 [2025-02-06 10:37:56,936 INFO L87 Difference]: Start difference. First operand 94 states and 100 transitions. Second operand has 14 states, 13 states have (on average 3.3846153846153846) internal successors, (44), 12 states have internal predecessors, (44), 1 states have call successors, (2), 1 states have call predecessors, (2), 4 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2025-02-06 10:37:57,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:37:57,184 INFO L93 Difference]: Finished difference Result 120 states and 129 transitions. [2025-02-06 10:37:57,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 10:37:57,184 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 3.3846153846153846) internal successors, (44), 12 states have internal predecessors, (44), 1 states have call successors, (2), 1 states have call predecessors, (2), 4 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 34 [2025-02-06 10:37:57,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:37:57,185 INFO L225 Difference]: With dead ends: 120 [2025-02-06 10:37:57,185 INFO L226 Difference]: Without dead ends: 120 [2025-02-06 10:37:57,185 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 50 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=98, Invalid=367, Unknown=1, NotChecked=40, Total=506 [2025-02-06 10:37:57,185 INFO L435 NwaCegarLoop]: 50 mSDtfsCounter, 88 mSDsluCounter, 235 mSDsCounter, 0 mSdLazyCounter, 369 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 285 SdHoareTripleChecker+Invalid, 491 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 369 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 111 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 10:37:57,186 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 285 Invalid, 491 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 369 Invalid, 0 Unknown, 111 Unchecked, 0.2s Time] [2025-02-06 10:37:57,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2025-02-06 10:37:57,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 94. [2025-02-06 10:37:57,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 60 states have (on average 1.6166666666666667) internal successors, (97), 89 states have internal predecessors, (97), 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:57,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 103 transitions. [2025-02-06 10:37:57,188 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 103 transitions. Word has length 34 [2025-02-06 10:37:57,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:37:57,188 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 103 transitions. [2025-02-06 10:37:57,188 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 3.3846153846153846) internal successors, (44), 12 states have internal predecessors, (44), 1 states have call successors, (2), 1 states have call predecessors, (2), 4 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2025-02-06 10:37:57,189 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 103 transitions. [2025-02-06 10:37:57,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-02-06 10:37:57,189 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:37:57,189 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, 1, 1, 1, 1] [2025-02-06 10:37:57,196 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-02-06 10:37:57,393 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:57,393 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2025-02-06 10:37:57,393 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:37:57,393 INFO L85 PathProgramCache]: Analyzing trace with hash 920041566, now seen corresponding path program 1 times [2025-02-06 10:37:57,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:37:57,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [166232221] [2025-02-06 10:37:57,394 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:37:57,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:37:57,409 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-02-06 10:37:57,418 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-02-06 10:37:57,419 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:37:57,419 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:37:57,701 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:37:57,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:37:57,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [166232221] [2025-02-06 10:37:57,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [166232221] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:37:57,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [83631151] [2025-02-06 10:37:57,702 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:37:57,702 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:37:57,702 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:37:57,704 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:57,705 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:57,780 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-02-06 10:37:57,807 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-02-06 10:37:57,808 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:37:57,808 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:37:57,809 INFO L256 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-02-06 10:37:57,811 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:37:57,817 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:57,826 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:57,832 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:57,872 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 10:37:57,873 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:57,891 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:57,933 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 10:37:57,933 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:57,962 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:57,962 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:37:58,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [83631151] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:37:58,066 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-06 10:37:58,066 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 6] total 12 [2025-02-06 10:37:58,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [306514291] [2025-02-06 10:37:58,066 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-06 10:37:58,066 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-06 10:37:58,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:37:58,066 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-06 10:37:58,066 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=167, Unknown=1, NotChecked=26, Total=240 [2025-02-06 10:37:58,067 INFO L87 Difference]: Start difference. First operand 94 states and 103 transitions. Second operand has 13 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 11 states have internal predecessors, (38), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-02-06 10:37:58,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:37:58,260 INFO L93 Difference]: Finished difference Result 87 states and 94 transitions. [2025-02-06 10:37:58,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 10:37:58,261 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 11 states have internal predecessors, (38), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 34 [2025-02-06 10:37:58,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:37:58,261 INFO L225 Difference]: With dead ends: 87 [2025-02-06 10:37:58,261 INFO L226 Difference]: Without dead ends: 87 [2025-02-06 10:37:58,262 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=67, Invalid=242, Unknown=1, NotChecked=32, Total=342 [2025-02-06 10:37:58,262 INFO L435 NwaCegarLoop]: 40 mSDtfsCounter, 86 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 220 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 300 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 220 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 72 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:37:58,262 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 165 Invalid, 300 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 220 Invalid, 0 Unknown, 72 Unchecked, 0.1s Time] [2025-02-06 10:37:58,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2025-02-06 10:37:58,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2025-02-06 10:37:58,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 60 states have (on average 1.4666666666666666) internal successors, (88), 82 states have internal predecessors, (88), 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:58,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 94 transitions. [2025-02-06 10:37:58,264 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 94 transitions. Word has length 34 [2025-02-06 10:37:58,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:37:58,264 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 94 transitions. [2025-02-06 10:37:58,264 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 11 states have internal predecessors, (38), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-02-06 10:37:58,264 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 94 transitions. [2025-02-06 10:37:58,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-02-06 10:37:58,265 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:37:58,265 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, 1, 1, 1, 1, 1] [2025-02-06 10:37:58,271 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:58,465 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:58,466 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2025-02-06 10:37:58,466 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:37:58,466 INFO L85 PathProgramCache]: Analyzing trace with hash -1543482524, now seen corresponding path program 1 times [2025-02-06 10:37:58,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:37:58,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1234171236] [2025-02-06 10:37:58,466 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:37:58,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:37:58,487 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-02-06 10:37:58,492 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-02-06 10:37:58,492 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:37:58,493 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:37:58,708 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:58,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:37:58,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1234171236] [2025-02-06 10:37:58,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1234171236] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:37:58,709 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:37:58,709 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-06 10:37:58,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448794330] [2025-02-06 10:37:58,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:37:58,709 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-06 10:37:58,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:37:58,710 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-06 10:37:58,710 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-02-06 10:37:58,710 INFO L87 Difference]: Start difference. First operand 87 states and 94 transitions. Second operand has 11 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 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:58,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:37:58,936 INFO L93 Difference]: Finished difference Result 127 states and 137 transitions. [2025-02-06 10:37:58,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-06 10:37:58,936 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 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 35 [2025-02-06 10:37:58,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:37:58,937 INFO L225 Difference]: With dead ends: 127 [2025-02-06 10:37:58,937 INFO L226 Difference]: Without dead ends: 127 [2025-02-06 10:37:58,937 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2025-02-06 10:37:58,937 INFO L435 NwaCegarLoop]: 50 mSDtfsCounter, 74 mSDsluCounter, 363 mSDsCounter, 0 mSdLazyCounter, 411 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 413 SdHoareTripleChecker+Invalid, 411 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 411 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 10:37:58,938 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 413 Invalid, 411 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 411 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 10:37:58,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2025-02-06 10:37:58,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 105. [2025-02-06 10:37:58,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 78 states have (on average 1.5384615384615385) internal successors, (120), 100 states have internal predecessors, (120), 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:58,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 126 transitions. [2025-02-06 10:37:58,940 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 126 transitions. Word has length 35 [2025-02-06 10:37:58,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:37:58,940 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 126 transitions. [2025-02-06 10:37:58,940 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 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:58,940 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 126 transitions. [2025-02-06 10:37:58,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-02-06 10:37:58,941 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:37:58,941 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, 1, 1, 1, 1, 1] [2025-02-06 10:37:58,941 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-06 10:37:58,941 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2025-02-06 10:37:58,941 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:37:58,941 INFO L85 PathProgramCache]: Analyzing trace with hash -1543482525, now seen corresponding path program 1 times [2025-02-06 10:37:58,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:37:58,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [58011615] [2025-02-06 10:37:58,941 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:37:58,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:37:58,950 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-02-06 10:37:58,954 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-02-06 10:37:58,954 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:37:58,954 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:37:59,060 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:59,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:37:59,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [58011615] [2025-02-06 10:37:59,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [58011615] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:37:59,060 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:37:59,060 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-06 10:37:59,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1404410376] [2025-02-06 10:37:59,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:37:59,061 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-06 10:37:59,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:37:59,061 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-06 10:37:59,061 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-02-06 10:37:59,061 INFO L87 Difference]: Start difference. First operand 105 states and 126 transitions. Second operand has 11 states, 10 states have (on average 2.9) internal successors, (29), 10 states have internal predecessors, (29), 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:59,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:37:59,259 INFO L93 Difference]: Finished difference Result 126 states and 148 transitions. [2025-02-06 10:37:59,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-06 10:37:59,260 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.9) internal successors, (29), 10 states have internal predecessors, (29), 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 35 [2025-02-06 10:37:59,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:37:59,260 INFO L225 Difference]: With dead ends: 126 [2025-02-06 10:37:59,260 INFO L226 Difference]: Without dead ends: 126 [2025-02-06 10:37:59,261 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2025-02-06 10:37:59,261 INFO L435 NwaCegarLoop]: 56 mSDtfsCounter, 50 mSDsluCounter, 300 mSDsCounter, 0 mSdLazyCounter, 440 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 356 SdHoareTripleChecker+Invalid, 441 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 440 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 10:37:59,262 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 356 Invalid, 441 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 440 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 10:37:59,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2025-02-06 10:37:59,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 106. [2025-02-06 10:37:59,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 79 states have (on average 1.5316455696202531) internal successors, (121), 101 states have internal predecessors, (121), 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:59,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 127 transitions. [2025-02-06 10:37:59,265 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 127 transitions. Word has length 35 [2025-02-06 10:37:59,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:37:59,265 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 127 transitions. [2025-02-06 10:37:59,265 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.9) internal successors, (29), 10 states have internal predecessors, (29), 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:59,265 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 127 transitions. [2025-02-06 10:37:59,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-02-06 10:37:59,266 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:37:59,266 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, 1, 1, 1, 1, 1, 1] [2025-02-06 10:37:59,267 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-06 10:37:59,267 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2025-02-06 10:37:59,267 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:37:59,267 INFO L85 PathProgramCache]: Analyzing trace with hash -603336804, now seen corresponding path program 1 times [2025-02-06 10:37:59,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:37:59,267 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804582156] [2025-02-06 10:37:59,267 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:37:59,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:37:59,280 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-02-06 10:37:59,285 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-02-06 10:37:59,285 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:37:59,285 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:37:59,323 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-02-06 10:37:59,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:37:59,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1804582156] [2025-02-06 10:37:59,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1804582156] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:37:59,324 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:37:59,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 10:37:59,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1953194906] [2025-02-06 10:37:59,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:37:59,324 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 10:37:59,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:37:59,325 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 10:37:59,325 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-06 10:37:59,325 INFO L87 Difference]: Start difference. First operand 106 states and 127 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 10:37:59,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:37:59,337 INFO L93 Difference]: Finished difference Result 140 states and 161 transitions. [2025-02-06 10:37:59,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 10:37:59,337 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 36 [2025-02-06 10:37:59,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:37:59,338 INFO L225 Difference]: With dead ends: 140 [2025-02-06 10:37:59,338 INFO L226 Difference]: Without dead ends: 140 [2025-02-06 10:37:59,338 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-06 10:37:59,338 INFO L435 NwaCegarLoop]: 76 mSDtfsCounter, 83 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 166 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:59,339 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 166 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:59,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2025-02-06 10:37:59,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 105. [2025-02-06 10:37:59,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 78 states have (on average 1.5256410256410255) internal successors, (119), 100 states have internal predecessors, (119), 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:59,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 125 transitions. [2025-02-06 10:37:59,343 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 125 transitions. Word has length 36 [2025-02-06 10:37:59,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:37:59,344 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 125 transitions. [2025-02-06 10:37:59,344 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 10:37:59,344 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 125 transitions. [2025-02-06 10:37:59,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-02-06 10:37:59,344 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:37:59,344 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:37:59,344 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-06 10:37:59,345 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2025-02-06 10:37:59,345 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:37:59,345 INFO L85 PathProgramCache]: Analyzing trace with hash 991981021, now seen corresponding path program 1 times [2025-02-06 10:37:59,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:37:59,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2106920700] [2025-02-06 10:37:59,345 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:37:59,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:37:59,356 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-02-06 10:37:59,390 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-02-06 10:37:59,390 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:37:59,390 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:37:59,752 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:59,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:37:59,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2106920700] [2025-02-06 10:37:59,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2106920700] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:37:59,753 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:37:59,753 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-02-06 10:37:59,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [566732871] [2025-02-06 10:37:59,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:37:59,753 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-02-06 10:37:59,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:37:59,754 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-02-06 10:37:59,754 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2025-02-06 10:37:59,754 INFO L87 Difference]: Start difference. First operand 105 states and 125 transitions. Second operand has 15 states, 14 states have (on average 2.5) internal successors, (35), 14 states have internal predecessors, (35), 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:38:00,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:38:00,070 INFO L93 Difference]: Finished difference Result 122 states and 142 transitions. [2025-02-06 10:38:00,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-02-06 10:38:00,070 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 2.5) internal successors, (35), 14 states have internal predecessors, (35), 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 39 [2025-02-06 10:38:00,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:38:00,071 INFO L225 Difference]: With dead ends: 122 [2025-02-06 10:38:00,071 INFO L226 Difference]: Without dead ends: 122 [2025-02-06 10:38:00,072 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=361, Unknown=0, NotChecked=0, Total=420 [2025-02-06 10:38:00,072 INFO L435 NwaCegarLoop]: 51 mSDtfsCounter, 57 mSDsluCounter, 480 mSDsCounter, 0 mSdLazyCounter, 619 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 531 SdHoareTripleChecker+Invalid, 622 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 619 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 10:38:00,072 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 531 Invalid, 622 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 619 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 10:38:00,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2025-02-06 10:38:00,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 108. [2025-02-06 10:38:00,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 82 states have (on average 1.5) internal successors, (123), 103 states have internal predecessors, (123), 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:38:00,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 129 transitions. [2025-02-06 10:38:00,074 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 129 transitions. Word has length 39 [2025-02-06 10:38:00,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:38:00,074 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 129 transitions. [2025-02-06 10:38:00,074 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 2.5) internal successors, (35), 14 states have internal predecessors, (35), 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:38:00,075 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 129 transitions. [2025-02-06 10:38:00,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-02-06 10:38:00,075 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:38:00,075 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:38:00,075 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-06 10:38:00,075 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2025-02-06 10:38:00,076 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:38:00,076 INFO L85 PathProgramCache]: Analyzing trace with hash 991981022, now seen corresponding path program 1 times [2025-02-06 10:38:00,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:38:00,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [886465658] [2025-02-06 10:38:00,076 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:38:00,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:38:00,086 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-02-06 10:38:00,096 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-02-06 10:38:00,096 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:38:00,096 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:38:00,588 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:38:00,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:38:00,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [886465658] [2025-02-06 10:38:00,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [886465658] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:38:00,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1988802272] [2025-02-06 10:38:00,588 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:38:00,588 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:38:00,588 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:38:00,590 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:38:00,591 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:38:00,674 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-02-06 10:38:00,806 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-02-06 10:38:00,806 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:38:00,806 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:38:00,808 INFO L256 TraceCheckSpWp]: Trace formula consists of 344 conjuncts, 62 conjuncts are in the unsatisfiable core [2025-02-06 10:38:00,810 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:38:01,061 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-02-06 10:38:01,066 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-02-06 10:38:01,213 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 42 treesize of output 26 [2025-02-06 10:38:01,249 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 23 treesize of output 15 [2025-02-06 10:38:01,251 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 26 treesize of output 14 [2025-02-06 10:38:01,303 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 10:38:01,303 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:38:01,472 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 64 treesize of output 48 [2025-02-06 10:38:01,474 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 52 treesize of output 36 [2025-02-06 10:38:01,587 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 10:38:01,588 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 21 treesize of output 25 [2025-02-06 10:38:01,734 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:38:01,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1988802272] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 10:38:01,734 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 10:38:01,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 19, 13] total 44 [2025-02-06 10:38:01,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1367269339] [2025-02-06 10:38:01,734 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 10:38:01,734 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2025-02-06 10:38:01,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:38:01,735 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2025-02-06 10:38:01,735 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=1849, Unknown=0, NotChecked=0, Total=1980 [2025-02-06 10:38:01,735 INFO L87 Difference]: Start difference. First operand 108 states and 129 transitions. Second operand has 45 states, 43 states have (on average 2.046511627906977) internal successors, (88), 40 states have internal predecessors, (88), 5 states have call successors, (5), 1 states have call predecessors, (5), 4 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2025-02-06 10:38:02,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:38:02,682 INFO L93 Difference]: Finished difference Result 138 states and 161 transitions. [2025-02-06 10:38:02,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-02-06 10:38:02,682 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 43 states have (on average 2.046511627906977) internal successors, (88), 40 states have internal predecessors, (88), 5 states have call successors, (5), 1 states have call predecessors, (5), 4 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 39 [2025-02-06 10:38:02,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:38:02,683 INFO L225 Difference]: With dead ends: 138 [2025-02-06 10:38:02,683 INFO L226 Difference]: Without dead ends: 138 [2025-02-06 10:38:02,683 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 411 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=248, Invalid=3174, Unknown=0, NotChecked=0, Total=3422 [2025-02-06 10:38:02,684 INFO L435 NwaCegarLoop]: 48 mSDtfsCounter, 164 mSDsluCounter, 1074 mSDsCounter, 0 mSdLazyCounter, 1270 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 1122 SdHoareTripleChecker+Invalid, 1274 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1270 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-06 10:38:02,684 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [165 Valid, 1122 Invalid, 1274 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1270 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-06 10:38:02,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2025-02-06 10:38:02,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 120. [2025-02-06 10:38:02,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 94 states have (on average 1.446808510638298) internal successors, (136), 115 states have internal predecessors, (136), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-06 10:38:02,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 142 transitions. [2025-02-06 10:38:02,687 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 142 transitions. Word has length 39 [2025-02-06 10:38:02,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:38:02,687 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 142 transitions. [2025-02-06 10:38:02,687 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 43 states have (on average 2.046511627906977) internal successors, (88), 40 states have internal predecessors, (88), 5 states have call successors, (5), 1 states have call predecessors, (5), 4 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2025-02-06 10:38:02,687 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 142 transitions. [2025-02-06 10:38:02,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-02-06 10:38:02,687 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:38:02,688 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:38:02,695 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-02-06 10:38:02,888 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:38:02,888 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2025-02-06 10:38:02,888 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:38:02,888 INFO L85 PathProgramCache]: Analyzing trace with hash 1089460904, now seen corresponding path program 1 times [2025-02-06 10:38:02,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:38:02,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1446256412] [2025-02-06 10:38:02,889 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:38:02,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:38:02,900 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-02-06 10:38:02,909 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-02-06 10:38:02,909 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:38:02,909 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:38:02,956 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:38:02,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:38:02,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1446256412] [2025-02-06 10:38:02,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1446256412] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:38:02,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [329577176] [2025-02-06 10:38:02,957 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:38:02,957 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:38:02,957 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:38:02,959 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:38:02,960 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:38:03,055 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-02-06 10:38:03,086 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-02-06 10:38:03,087 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:38:03,087 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:38:03,088 INFO L256 TraceCheckSpWp]: Trace formula consists of 369 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-06 10:38:03,090 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:38:03,107 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:38:03,108 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 10:38:03,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [329577176] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:38:03,108 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 10:38:03,108 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2025-02-06 10:38:03,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [769105766] [2025-02-06 10:38:03,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:38:03,108 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 10:38:03,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:38:03,109 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 10:38:03,109 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 10:38:03,109 INFO L87 Difference]: Start difference. First operand 120 states and 142 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:38:03,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:38:03,119 INFO L93 Difference]: Finished difference Result 99 states and 115 transitions. [2025-02-06 10:38:03,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 10:38:03,123 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:38:03,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:38:03,123 INFO L225 Difference]: With dead ends: 99 [2025-02-06 10:38:03,123 INFO L226 Difference]: Without dead ends: 99 [2025-02-06 10:38:03,124 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:38:03,124 INFO L435 NwaCegarLoop]: 71 mSDtfsCounter, 0 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 10:38:03,124 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 200 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 10:38:03,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2025-02-06 10:38:03,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2025-02-06 10:38:03,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 77 states have (on average 1.4415584415584415) internal successors, (111), 95 states have internal predecessors, (111), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-06 10:38:03,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 115 transitions. [2025-02-06 10:38:03,126 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 115 transitions. Word has length 41 [2025-02-06 10:38:03,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:38:03,126 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 115 transitions. [2025-02-06 10:38:03,126 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:38:03,126 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 115 transitions. [2025-02-06 10:38:03,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-02-06 10:38:03,126 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:38:03,126 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:38:03,133 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:38:03,327 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:38:03,328 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2025-02-06 10:38:03,328 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:38:03,328 INFO L85 PathProgramCache]: Analyzing trace with hash 686615776, now seen corresponding path program 1 times [2025-02-06 10:38:03,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:38:03,328 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [114132104] [2025-02-06 10:38:03,328 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:38:03,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:38:03,338 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-02-06 10:38:03,344 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-02-06 10:38:03,344 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:38:03,344 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:38:03,454 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:38:03,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:38:03,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [114132104] [2025-02-06 10:38:03,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [114132104] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:38:03,455 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:38:03,455 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-06 10:38:03,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [456577577] [2025-02-06 10:38:03,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:38:03,455 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-06 10:38:03,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:38:03,456 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-06 10:38:03,456 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-02-06 10:38:03,456 INFO L87 Difference]: Start difference. First operand 99 states and 115 transitions. Second operand has 11 states, 10 states have (on average 3.6) internal successors, (36), 10 states have internal predecessors, (36), 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:38:03,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:38:03,588 INFO L93 Difference]: Finished difference Result 98 states and 114 transitions. [2025-02-06 10:38:03,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-06 10:38:03,589 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.6) internal successors, (36), 10 states have internal predecessors, (36), 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 40 [2025-02-06 10:38:03,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:38:03,589 INFO L225 Difference]: With dead ends: 98 [2025-02-06 10:38:03,589 INFO L226 Difference]: Without dead ends: 98 [2025-02-06 10:38:03,590 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2025-02-06 10:38:03,590 INFO L435 NwaCegarLoop]: 47 mSDtfsCounter, 62 mSDsluCounter, 355 mSDsCounter, 0 mSdLazyCounter, 240 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 402 SdHoareTripleChecker+Invalid, 241 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 240 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:38:03,590 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 402 Invalid, 241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 240 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 10:38:03,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2025-02-06 10:38:03,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2025-02-06 10:38:03,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 77 states have (on average 1.4285714285714286) internal successors, (110), 94 states have internal predecessors, (110), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-06 10:38:03,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 114 transitions. [2025-02-06 10:38:03,593 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 114 transitions. Word has length 40 [2025-02-06 10:38:03,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:38:03,593 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 114 transitions. [2025-02-06 10:38:03,593 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.6) internal successors, (36), 10 states have internal predecessors, (36), 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:38:03,593 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 114 transitions. [2025-02-06 10:38:03,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-02-06 10:38:03,593 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:38:03,593 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:38:03,593 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-02-06 10:38:03,594 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2025-02-06 10:38:03,594 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:38:03,594 INFO L85 PathProgramCache]: Analyzing trace with hash -189747429, now seen corresponding path program 1 times [2025-02-06 10:38:03,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:38:03,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15559731] [2025-02-06 10:38:03,594 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:38:03,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:38:03,605 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-02-06 10:38:03,611 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-02-06 10:38:03,611 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:38:03,611 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:38:03,742 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:38:03,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:38:03,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [15559731] [2025-02-06 10:38:03,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [15559731] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:38:03,743 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:38:03,743 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-06 10:38:03,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [478424528] [2025-02-06 10:38:03,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:38:03,743 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-06 10:38:03,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:38:03,744 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-06 10:38:03,744 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-02-06 10:38:03,744 INFO L87 Difference]: Start difference. First operand 98 states and 114 transitions. Second operand has 11 states, 10 states have (on average 3.7) internal successors, (37), 10 states have internal predecessors, (37), 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:38:03,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:38:03,910 INFO L93 Difference]: Finished difference Result 117 states and 123 transitions. [2025-02-06 10:38:03,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-06 10:38:03,910 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.7) internal successors, (37), 10 states have internal predecessors, (37), 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 41 [2025-02-06 10:38:03,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:38:03,911 INFO L225 Difference]: With dead ends: 117 [2025-02-06 10:38:03,911 INFO L226 Difference]: Without dead ends: 117 [2025-02-06 10:38:03,911 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2025-02-06 10:38:03,912 INFO L435 NwaCegarLoop]: 52 mSDtfsCounter, 59 mSDsluCounter, 392 mSDsCounter, 0 mSdLazyCounter, 346 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 444 SdHoareTripleChecker+Invalid, 347 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 346 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:38:03,912 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 444 Invalid, 347 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 346 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 10:38:03,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2025-02-06 10:38:03,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 101. [2025-02-06 10:38:03,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 80 states have (on average 1.4125) internal successors, (113), 97 states have internal predecessors, (113), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-06 10:38:03,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 117 transitions. [2025-02-06 10:38:03,916 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 117 transitions. Word has length 41 [2025-02-06 10:38:03,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:38:03,916 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 117 transitions. [2025-02-06 10:38:03,916 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.7) internal successors, (37), 10 states have internal predecessors, (37), 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:38:03,916 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 117 transitions. [2025-02-06 10:38:03,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-02-06 10:38:03,917 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:38:03,917 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:38:03,917 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-02-06 10:38:03,917 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2025-02-06 10:38:03,917 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:38:03,917 INFO L85 PathProgramCache]: Analyzing trace with hash -1587203010, now seen corresponding path program 1 times [2025-02-06 10:38:03,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:38:03,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [924120934] [2025-02-06 10:38:03,918 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:38:03,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:38:03,927 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-02-06 10:38:03,931 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-02-06 10:38:03,931 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:38:03,931 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:38:03,971 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-02-06 10:38:03,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:38:03,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [924120934] [2025-02-06 10:38:03,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [924120934] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:38:03,971 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:38:03,971 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 10:38:03,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [219164133] [2025-02-06 10:38:03,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:38:03,972 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 10:38:03,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:38:03,972 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 10:38:03,972 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 10:38:03,972 INFO L87 Difference]: Start difference. First operand 101 states and 117 transitions. Second operand has 5 states, 4 states have (on average 7.75) internal successors, (31), 5 states have internal predecessors, (31), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 10:38:04,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:38:04,031 INFO L93 Difference]: Finished difference Result 100 states and 116 transitions. [2025-02-06 10:38:04,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 10:38:04,032 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 7.75) internal successors, (31), 5 states have internal predecessors, (31), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 42 [2025-02-06 10:38:04,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:38:04,032 INFO L225 Difference]: With dead ends: 100 [2025-02-06 10:38:04,032 INFO L226 Difference]: Without dead ends: 100 [2025-02-06 10:38:04,032 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-06 10:38:04,033 INFO L435 NwaCegarLoop]: 61 mSDtfsCounter, 13 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:38:04,033 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 166 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 10:38:04,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2025-02-06 10:38:04,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2025-02-06 10:38:04,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 80 states have (on average 1.4) internal successors, (112), 96 states have internal predecessors, (112), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-06 10:38:04,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 116 transitions. [2025-02-06 10:38:04,037 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 116 transitions. Word has length 42 [2025-02-06 10:38:04,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:38:04,037 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 116 transitions. [2025-02-06 10:38:04,037 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 7.75) internal successors, (31), 5 states have internal predecessors, (31), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 10:38:04,037 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 116 transitions. [2025-02-06 10:38:04,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-02-06 10:38:04,037 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:38:04,037 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:38:04,037 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-02-06 10:38:04,037 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2025-02-06 10:38:04,038 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:38:04,038 INFO L85 PathProgramCache]: Analyzing trace with hash -1563344392, now seen corresponding path program 1 times [2025-02-06 10:38:04,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:38:04,038 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1849016643] [2025-02-06 10:38:04,038 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:38:04,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:38:04,048 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-02-06 10:38:04,065 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-02-06 10:38:04,065 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:38:04,065 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:38:04,485 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:38:04,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:38:04,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1849016643] [2025-02-06 10:38:04,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1849016643] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:38:04,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1775694857] [2025-02-06 10:38:04,485 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:38:04,485 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:38:04,485 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:38:04,487 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:38:04,488 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:38:04,587 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-02-06 10:38:04,663 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-02-06 10:38:04,663 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:38:04,663 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:38:04,665 INFO L256 TraceCheckSpWp]: Trace formula consists of 358 conjuncts, 56 conjuncts are in the unsatisfiable core [2025-02-06 10:38:04,666 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:38:04,807 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-02-06 10:38:04,892 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2025-02-06 10:38:04,920 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:38:04,969 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:38:04,969 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:38:05,075 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 26 treesize of output 18 [2025-02-06 10:38:05,077 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 22 treesize of output 14 [2025-02-06 10:38:05,172 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-06 10:38:05,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1775694857] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 10:38:05,172 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 10:38:05,172 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 19, 12] total 35 [2025-02-06 10:38:05,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [498460257] [2025-02-06 10:38:05,172 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 10:38:05,173 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2025-02-06 10:38:05,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:38:05,173 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2025-02-06 10:38:05,173 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=1152, Unknown=0, NotChecked=0, Total=1260 [2025-02-06 10:38:05,174 INFO L87 Difference]: Start difference. First operand 100 states and 116 transitions. Second operand has 36 states, 34 states have (on average 2.235294117647059) internal successors, (76), 32 states have internal predecessors, (76), 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:38:05,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:38:05,591 INFO L93 Difference]: Finished difference Result 113 states and 129 transitions. [2025-02-06 10:38:05,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-02-06 10:38:05,595 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 34 states have (on average 2.235294117647059) internal successors, (76), 32 states have internal predecessors, (76), 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 42 [2025-02-06 10:38:05,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:38:05,595 INFO L225 Difference]: With dead ends: 113 [2025-02-06 10:38:05,595 INFO L226 Difference]: Without dead ends: 113 [2025-02-06 10:38:05,596 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 54 SyntacticMatches, 12 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 404 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=167, Invalid=1639, Unknown=0, NotChecked=0, Total=1806 [2025-02-06 10:38:05,596 INFO L435 NwaCegarLoop]: 39 mSDtfsCounter, 127 mSDsluCounter, 702 mSDsCounter, 0 mSdLazyCounter, 888 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 741 SdHoareTripleChecker+Invalid, 889 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 888 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 10:38:05,596 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 741 Invalid, 889 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 888 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 10:38:05,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2025-02-06 10:38:05,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 101. [2025-02-06 10:38:05,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 81 states have (on average 1.3950617283950617) internal successors, (113), 97 states have internal predecessors, (113), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-06 10:38:05,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 117 transitions. [2025-02-06 10:38:05,598 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 117 transitions. Word has length 42 [2025-02-06 10:38:05,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:38:05,598 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 117 transitions. [2025-02-06 10:38:05,598 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 34 states have (on average 2.235294117647059) internal successors, (76), 32 states have internal predecessors, (76), 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:38:05,598 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 117 transitions. [2025-02-06 10:38:05,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-02-06 10:38:05,598 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:38:05,598 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:38:05,605 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:38:05,799 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,SelfDestructingSolverStorable23 [2025-02-06 10:38:05,799 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2025-02-06 10:38:05,799 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:38:05,799 INFO L85 PathProgramCache]: Analyzing trace with hash -1958653064, now seen corresponding path program 1 times [2025-02-06 10:38:05,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:38:05,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2062238112] [2025-02-06 10:38:05,799 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:38:05,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:38:05,810 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-02-06 10:38:05,814 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-02-06 10:38:05,815 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:38:05,815 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:38:05,982 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 10:38:05,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:38:05,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2062238112] [2025-02-06 10:38:05,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2062238112] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:38:05,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1754707899] [2025-02-06 10:38:05,982 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:38:05,982 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:38:05,982 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:38:05,984 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:38:05,984 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:38:06,092 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-02-06 10:38:06,120 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-02-06 10:38:06,120 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:38:06,120 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:38:06,121 INFO L256 TraceCheckSpWp]: Trace formula consists of 362 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-06 10:38:06,122 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:38:06,189 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 10:38:06,190 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:38:06,191 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-02-06 10:38:06,191 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 10:38:06,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1754707899] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:38:06,191 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 10:38:06,191 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [13] total 16 [2025-02-06 10:38:06,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [920871061] [2025-02-06 10:38:06,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:38:06,191 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 10:38:06,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:38:06,191 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 10:38:06,192 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=234, Unknown=0, NotChecked=0, Total=272 [2025-02-06 10:38:06,192 INFO L87 Difference]: Start difference. First operand 101 states and 117 transitions. Second operand has 7 states, 6 states have (on average 5.333333333333333) internal successors, (32), 7 states have internal predecessors, (32), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 10:38:06,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:38:06,268 INFO L93 Difference]: Finished difference Result 100 states and 116 transitions. [2025-02-06 10:38:06,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 10:38:06,268 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 5.333333333333333) internal successors, (32), 7 states have internal predecessors, (32), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 43 [2025-02-06 10:38:06,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:38:06,269 INFO L225 Difference]: With dead ends: 100 [2025-02-06 10:38:06,269 INFO L226 Difference]: Without dead ends: 100 [2025-02-06 10:38:06,269 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=321, Unknown=0, NotChecked=0, Total=380 [2025-02-06 10:38:06,269 INFO L435 NwaCegarLoop]: 46 mSDtfsCounter, 61 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:38:06,269 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 129 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 10:38:06,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2025-02-06 10:38:06,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2025-02-06 10:38:06,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 81 states have (on average 1.382716049382716) internal successors, (112), 96 states have internal predecessors, (112), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-06 10:38:06,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 116 transitions. [2025-02-06 10:38:06,271 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 116 transitions. Word has length 43 [2025-02-06 10:38:06,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:38:06,271 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 116 transitions. [2025-02-06 10:38:06,271 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 5.333333333333333) internal successors, (32), 7 states have internal predecessors, (32), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 10:38:06,271 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 116 transitions. [2025-02-06 10:38:06,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-02-06 10:38:06,272 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:38:06,272 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:38:06,278 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:38:06,472 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,SelfDestructingSolverStorable24 [2025-02-06 10:38:06,472 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2025-02-06 10:38:06,472 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:38:06,472 INFO L85 PathProgramCache]: Analyzing trace with hash 864593429, now seen corresponding path program 1 times [2025-02-06 10:38:06,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:38:06,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [310383464] [2025-02-06 10:38:06,473 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:38:06,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:38:06,488 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-02-06 10:38:06,494 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-02-06 10:38:06,494 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:38:06,494 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:38:06,567 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-02-06 10:38:06,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:38:06,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [310383464] [2025-02-06 10:38:06,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [310383464] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:38:06,568 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:38:06,568 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-06 10:38:06,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [500325482] [2025-02-06 10:38:06,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:38:06,568 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-06 10:38:06,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:38:06,569 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 10:38:06,569 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-02-06 10:38:06,569 INFO L87 Difference]: Start difference. First operand 100 states and 116 transitions. Second operand has 8 states, 7 states have (on average 4.714285714285714) internal successors, (33), 8 states have internal predecessors, (33), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 10:38:06,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:38:06,665 INFO L93 Difference]: Finished difference Result 99 states and 114 transitions. [2025-02-06 10:38:06,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 10:38:06,666 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.714285714285714) internal successors, (33), 8 states have internal predecessors, (33), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 44 [2025-02-06 10:38:06,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:38:06,666 INFO L225 Difference]: With dead ends: 99 [2025-02-06 10:38:06,666 INFO L226 Difference]: Without dead ends: 99 [2025-02-06 10:38:06,666 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-02-06 10:38:06,666 INFO L435 NwaCegarLoop]: 46 mSDtfsCounter, 90 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:38:06,666 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 146 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 10:38:06,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2025-02-06 10:38:06,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2025-02-06 10:38:06,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 81 states have (on average 1.3580246913580247) internal successors, (110), 95 states have internal predecessors, (110), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-06 10:38:06,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 114 transitions. [2025-02-06 10:38:06,668 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 114 transitions. Word has length 44 [2025-02-06 10:38:06,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:38:06,668 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 114 transitions. [2025-02-06 10:38:06,668 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.714285714285714) internal successors, (33), 8 states have internal predecessors, (33), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 10:38:06,668 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 114 transitions. [2025-02-06 10:38:06,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-02-06 10:38:06,669 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:38:06,669 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:38:06,669 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-02-06 10:38:06,669 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2025-02-06 10:38:06,669 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:38:06,669 INFO L85 PathProgramCache]: Analyzing trace with hash 1032592534, now seen corresponding path program 1 times [2025-02-06 10:38:06,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:38:06,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [298314084] [2025-02-06 10:38:06,669 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:38:06,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:38:06,680 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-02-06 10:38:06,691 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-02-06 10:38:06,691 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:38:06,692 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:38:06,990 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:38:06,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:38:06,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [298314084] [2025-02-06 10:38:06,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [298314084] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:38:06,990 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:38:06,991 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-02-06 10:38:06,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1592053777] [2025-02-06 10:38:06,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:38:06,991 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-02-06 10:38:06,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:38:06,991 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-02-06 10:38:06,991 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=207, Unknown=0, NotChecked=0, Total=240 [2025-02-06 10:38:06,992 INFO L87 Difference]: Start difference. First operand 99 states and 114 transitions. Second operand has 16 states, 15 states have (on average 2.7333333333333334) internal successors, (41), 15 states have internal predecessors, (41), 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:38:07,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:38:07,329 INFO L93 Difference]: Finished difference Result 109 states and 124 transitions. [2025-02-06 10:38:07,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-02-06 10:38:07,330 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 2.7333333333333334) internal successors, (41), 15 states have internal predecessors, (41), 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 45 [2025-02-06 10:38:07,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:38:07,330 INFO L225 Difference]: With dead ends: 109 [2025-02-06 10:38:07,330 INFO L226 Difference]: Without dead ends: 109 [2025-02-06 10:38:07,331 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=71, Invalid=349, Unknown=0, NotChecked=0, Total=420 [2025-02-06 10:38:07,331 INFO L435 NwaCegarLoop]: 41 mSDtfsCounter, 54 mSDsluCounter, 309 mSDsCounter, 0 mSdLazyCounter, 612 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 350 SdHoareTripleChecker+Invalid, 616 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 612 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 10:38:07,331 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 350 Invalid, 616 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 612 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 10:38:07,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2025-02-06 10:38:07,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 102. [2025-02-06 10:38:07,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 84 states have (on average 1.3571428571428572) internal successors, (114), 98 states have internal predecessors, (114), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-06 10:38:07,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 118 transitions. [2025-02-06 10:38:07,334 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 118 transitions. Word has length 45 [2025-02-06 10:38:07,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:38:07,334 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 118 transitions. [2025-02-06 10:38:07,334 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 2.7333333333333334) internal successors, (41), 15 states have internal predecessors, (41), 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:38:07,334 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 118 transitions. [2025-02-06 10:38:07,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-02-06 10:38:07,335 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:38:07,335 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:38:07,335 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-02-06 10:38:07,335 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2025-02-06 10:38:07,335 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:38:07,335 INFO L85 PathProgramCache]: Analyzing trace with hash 1032592535, now seen corresponding path program 1 times [2025-02-06 10:38:07,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:38:07,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1242344404] [2025-02-06 10:38:07,336 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:38:07,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:38:07,348 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-02-06 10:38:07,353 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-02-06 10:38:07,353 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:38:07,353 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:38:07,574 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:38:07,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:38:07,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1242344404] [2025-02-06 10:38:07,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1242344404] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:38:07,577 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:38:07,577 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-02-06 10:38:07,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1143321848] [2025-02-06 10:38:07,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:38:07,578 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-06 10:38:07,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:38:07,578 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-06 10:38:07,578 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2025-02-06 10:38:07,578 INFO L87 Difference]: Start difference. First operand 102 states and 118 transitions. Second operand has 12 states, 11 states have (on average 3.727272727272727) internal successors, (41), 11 states have internal predecessors, (41), 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:38:07,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:38:07,762 INFO L93 Difference]: Finished difference Result 114 states and 120 transitions. [2025-02-06 10:38:07,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-06 10:38:07,763 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.727272727272727) internal successors, (41), 11 states have internal predecessors, (41), 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 45 [2025-02-06 10:38:07,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:38:07,763 INFO L225 Difference]: With dead ends: 114 [2025-02-06 10:38:07,763 INFO L226 Difference]: Without dead ends: 114 [2025-02-06 10:38:07,764 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2025-02-06 10:38:07,764 INFO L435 NwaCegarLoop]: 51 mSDtfsCounter, 47 mSDsluCounter, 391 mSDsCounter, 0 mSdLazyCounter, 415 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 442 SdHoareTripleChecker+Invalid, 415 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 415 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 10:38:07,764 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 442 Invalid, 415 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 415 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 10:38:07,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2025-02-06 10:38:07,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 102. [2025-02-06 10:38:07,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 84 states have (on average 1.3333333333333333) internal successors, (112), 98 states have internal predecessors, (112), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-06 10:38:07,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 116 transitions. [2025-02-06 10:38:07,766 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 116 transitions. Word has length 45 [2025-02-06 10:38:07,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:38:07,766 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 116 transitions. [2025-02-06 10:38:07,766 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.727272727272727) internal successors, (41), 11 states have internal predecessors, (41), 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:38:07,766 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 116 transitions. [2025-02-06 10:38:07,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-02-06 10:38:07,766 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:38:07,766 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:38:07,766 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-02-06 10:38:07,766 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2025-02-06 10:38:07,767 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:38:07,767 INFO L85 PathProgramCache]: Analyzing trace with hash 1192244474, now seen corresponding path program 1 times [2025-02-06 10:38:07,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:38:07,767 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [727487237] [2025-02-06 10:38:07,767 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:38:07,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:38:07,779 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-02-06 10:38:07,783 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-02-06 10:38:07,783 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:38:07,783 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:38:07,822 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-02-06 10:38:07,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:38:07,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [727487237] [2025-02-06 10:38:07,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [727487237] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:38:07,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1393562298] [2025-02-06 10:38:07,822 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:38:07,823 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:38:07,823 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:38:07,824 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:38:07,826 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:38:07,955 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-02-06 10:38:07,987 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-02-06 10:38:07,987 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:38:07,987 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:38:07,993 INFO L256 TraceCheckSpWp]: Trace formula consists of 389 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-02-06 10:38:07,998 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:38:08,003 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:08,013 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:08,019 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:38:08,034 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2025-02-06 10:38:08,034 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:38:08,054 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:08,060 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:38:08,089 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 10:38:08,090 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:38:08,144 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 10:38:08,145 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:38:08,149 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 7 not checked. [2025-02-06 10:38:08,149 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:38:08,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1393562298] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:38:08,296 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-06 10:38:08,296 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 8] total 9 [2025-02-06 10:38:08,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [454697292] [2025-02-06 10:38:08,296 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-06 10:38:08,296 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-06 10:38:08,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:38:08,296 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-06 10:38:08,297 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=69, Unknown=2, NotChecked=34, Total=132 [2025-02-06 10:38:08,297 INFO L87 Difference]: Start difference. First operand 102 states and 116 transitions. Second operand has 10 states, 9 states have (on average 8.11111111111111) internal successors, (73), 9 states have internal predecessors, (73), 2 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-02-06 10:38:08,307 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((|node_create_~temp~0#1.base| Int)) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| 1))) (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:38:08,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:38:08,393 INFO L93 Difference]: Finished difference Result 133 states and 148 transitions. [2025-02-06 10:38:08,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-06 10:38:08,393 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 8.11111111111111) internal successors, (73), 9 states have internal predecessors, (73), 2 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 46 [2025-02-06 10:38:08,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:38:08,394 INFO L225 Difference]: With dead ends: 133 [2025-02-06 10:38:08,394 INFO L226 Difference]: Without dead ends: 133 [2025-02-06 10:38:08,394 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 62 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=112, Unknown=3, NotChecked=72, Total=240 [2025-02-06 10:38:08,394 INFO L435 NwaCegarLoop]: 34 mSDtfsCounter, 132 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 409 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 237 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:38:08,394 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 136 Invalid, 409 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 166 Invalid, 0 Unknown, 237 Unchecked, 0.1s Time] [2025-02-06 10:38:08,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2025-02-06 10:38:08,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 100. [2025-02-06 10:38:08,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 84 states have (on average 1.2976190476190477) internal successors, (109), 96 states have internal predecessors, (109), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-06 10:38:08,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 113 transitions. [2025-02-06 10:38:08,396 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 113 transitions. Word has length 46 [2025-02-06 10:38:08,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:38:08,396 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 113 transitions. [2025-02-06 10:38:08,396 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 8.11111111111111) internal successors, (73), 9 states have internal predecessors, (73), 2 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-02-06 10:38:08,396 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 113 transitions. [2025-02-06 10:38:08,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-02-06 10:38:08,397 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:38:08,397 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:38:08,403 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:38:08,601 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2025-02-06 10:38:08,601 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2025-02-06 10:38:08,601 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:38:08,601 INFO L85 PathProgramCache]: Analyzing trace with hash -1695126937, now seen corresponding path program 1 times [2025-02-06 10:38:08,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:38:08,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [317294909] [2025-02-06 10:38:08,601 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:38:08,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:38:08,615 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-02-06 10:38:08,631 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-02-06 10:38:08,631 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:38:08,631 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:38:09,130 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:38:09,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:38:09,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [317294909] [2025-02-06 10:38:09,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [317294909] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:38:09,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [492065772] [2025-02-06 10:38:09,131 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:38:09,131 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:38:09,131 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:38:09,132 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:38:09,134 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:38:09,255 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-02-06 10:38:09,300 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-02-06 10:38:09,300 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:38:09,300 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:38:09,302 INFO L256 TraceCheckSpWp]: Trace formula consists of 397 conjuncts, 73 conjuncts are in the unsatisfiable core [2025-02-06 10:38:09,304 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:38:09,313 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:09,347 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-06 10:38:09,347 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:09,365 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-02-06 10:38:09,433 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 10:38:09,434 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 34 treesize of output 24 [2025-02-06 10:38:09,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 16 treesize of output 8 [2025-02-06 10:38:09,543 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:38:09,543 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:38:09,633 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 8 treesize of output 4 [2025-02-06 10:38:09,652 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 25 treesize of output 13 [2025-02-06 10:38:09,656 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 11 [2025-02-06 10:38:09,658 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 20 treesize of output 18 [2025-02-06 10:38:09,880 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:38:09,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [492065772] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 10:38:09,880 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 10:38:09,880 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 22] total 40 [2025-02-06 10:38:09,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498880872] [2025-02-06 10:38:09,880 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 10:38:09,880 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2025-02-06 10:38:09,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:38:09,881 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2025-02-06 10:38:09,881 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=1438, Unknown=0, NotChecked=0, Total=1560 [2025-02-06 10:38:09,881 INFO L87 Difference]: Start difference. First operand 100 states and 113 transitions. Second operand has 40 states, 40 states have (on average 1.9) internal successors, (76), 35 states have internal predecessors, (76), 3 states have call successors, (3), 3 states have call predecessors, (3), 4 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-02-06 10:38:10,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:38:10,465 INFO L93 Difference]: Finished difference Result 102 states and 114 transitions. [2025-02-06 10:38:10,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-02-06 10:38:10,466 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 40 states have (on average 1.9) internal successors, (76), 35 states have internal predecessors, (76), 3 states have call successors, (3), 3 states have call predecessors, (3), 4 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 47 [2025-02-06 10:38:10,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:38:10,466 INFO L225 Difference]: With dead ends: 102 [2025-02-06 10:38:10,466 INFO L226 Difference]: Without dead ends: 100 [2025-02-06 10:38:10,467 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 78 SyntacticMatches, 1 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 310 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=220, Invalid=2330, Unknown=0, NotChecked=0, Total=2550 [2025-02-06 10:38:10,467 INFO L435 NwaCegarLoop]: 39 mSDtfsCounter, 48 mSDsluCounter, 871 mSDsCounter, 0 mSdLazyCounter, 951 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 910 SdHoareTripleChecker+Invalid, 956 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 951 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-06 10:38:10,468 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 910 Invalid, 956 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 951 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-06 10:38:10,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2025-02-06 10:38:10,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2025-02-06 10:38:10,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 84 states have (on average 1.2857142857142858) internal successors, (108), 96 states have internal predecessors, (108), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-06 10:38:10,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 112 transitions. [2025-02-06 10:38:10,470 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 112 transitions. Word has length 47 [2025-02-06 10:38:10,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:38:10,470 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 112 transitions. [2025-02-06 10:38:10,473 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 1.9) internal successors, (76), 35 states have internal predecessors, (76), 3 states have call successors, (3), 3 states have call predecessors, (3), 4 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-02-06 10:38:10,474 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 112 transitions. [2025-02-06 10:38:10,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-02-06 10:38:10,474 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:38:10,474 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:38:10,482 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2025-02-06 10:38:10,674 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,14 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:38:10,674 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2025-02-06 10:38:10,675 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:38:10,675 INFO L85 PathProgramCache]: Analyzing trace with hash 1408416273, now seen corresponding path program 1 times [2025-02-06 10:38:10,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:38:10,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1760485467] [2025-02-06 10:38:10,675 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:38:10,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:38:10,684 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-02-06 10:38:10,692 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-02-06 10:38:10,692 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:38:10,692 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:38:11,310 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:38:11,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:38:11,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1760485467] [2025-02-06 10:38:11,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1760485467] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:38:11,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1679930410] [2025-02-06 10:38:11,310 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:38:11,310 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:38:11,310 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:38:11,312 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:38:11,313 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:38:11,444 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-02-06 10:38:11,686 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-02-06 10:38:11,687 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:38:11,687 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:38:11,689 INFO L256 TraceCheckSpWp]: Trace formula consists of 396 conjuncts, 95 conjuncts are in the unsatisfiable core [2025-02-06 10:38:11,691 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:38:11,706 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:11,872 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-06 10:38:11,873 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:11,953 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:12,024 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 10:38:12,025 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 31 treesize of output 15 [2025-02-06 10:38:12,058 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2025-02-06 10:38:12,317 INFO L349 Elim1Store]: treesize reduction 29, result has 21.6 percent of original size [2025-02-06 10:38:12,317 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 53 treesize of output 30 [2025-02-06 10:38:12,409 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-02-06 10:38:12,413 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:38:12,413 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:38:12,418 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-02-06 10:38:12,418 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 12 treesize of output 11 [2025-02-06 10:38:12,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 34 treesize of output 22 [2025-02-06 10:38:12,561 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 26 treesize of output 18 [2025-02-06 10:38:12,779 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 104 treesize of output 100 [2025-02-06 10:38:12,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1679930410] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:38:12,978 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-06 10:38:12,978 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 26] total 47 [2025-02-06 10:38:12,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369999157] [2025-02-06 10:38:12,978 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-06 10:38:12,978 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2025-02-06 10:38:12,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:38:12,979 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2025-02-06 10:38:12,979 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=233, Invalid=3427, Unknown=0, NotChecked=0, Total=3660 [2025-02-06 10:38:12,980 INFO L87 Difference]: Start difference. First operand 100 states and 112 transitions. Second operand has 48 states, 46 states have (on average 1.6521739130434783) internal successors, (76), 43 states have internal predecessors, (76), 4 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-06 10:38:13,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:38:13,700 INFO L93 Difference]: Finished difference Result 103 states and 116 transitions. [2025-02-06 10:38:13,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-02-06 10:38:13,700 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 46 states have (on average 1.6521739130434783) internal successors, (76), 43 states have internal predecessors, (76), 4 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 48 [2025-02-06 10:38:13,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:38:13,700 INFO L225 Difference]: With dead ends: 103 [2025-02-06 10:38:13,700 INFO L226 Difference]: Without dead ends: 103 [2025-02-06 10:38:13,702 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1240 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=396, Invalid=5006, Unknown=0, NotChecked=0, Total=5402 [2025-02-06 10:38:13,702 INFO L435 NwaCegarLoop]: 34 mSDtfsCounter, 100 mSDsluCounter, 876 mSDsCounter, 0 mSdLazyCounter, 1163 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 910 SdHoareTripleChecker+Invalid, 1168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-06 10:38:13,702 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 910 Invalid, 1168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1163 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-06 10:38:13,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2025-02-06 10:38:13,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2025-02-06 10:38:13,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 87 states have (on average 1.2873563218390804) internal successors, (112), 99 states have internal predecessors, (112), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-06 10:38:13,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 116 transitions. [2025-02-06 10:38:13,704 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 116 transitions. Word has length 48 [2025-02-06 10:38:13,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:38:13,704 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 116 transitions. [2025-02-06 10:38:13,704 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 46 states have (on average 1.6521739130434783) internal successors, (76), 43 states have internal predecessors, (76), 4 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-06 10:38:13,704 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 116 transitions. [2025-02-06 10:38:13,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-02-06 10:38:13,704 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:38:13,704 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:38:13,716 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2025-02-06 10:38:13,905 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,SelfDestructingSolverStorable30 [2025-02-06 10:38:13,905 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2025-02-06 10:38:13,905 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:38:13,905 INFO L85 PathProgramCache]: Analyzing trace with hash 1408416274, now seen corresponding path program 1 times [2025-02-06 10:38:13,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:38:13,905 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [282342602] [2025-02-06 10:38:13,905 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:38:13,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:38:13,919 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-02-06 10:38:13,931 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-02-06 10:38:13,931 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:38:13,931 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:38:15,124 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:38:15,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:38:15,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [282342602] [2025-02-06 10:38:15,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [282342602] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:38:15,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [915026367] [2025-02-06 10:38:15,125 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:38:15,125 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:38:15,125 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:38:15,128 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:38:15,129 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:38:15,325 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-02-06 10:38:15,574 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-02-06 10:38:15,574 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:38:15,574 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:38:15,577 INFO L256 TraceCheckSpWp]: Trace formula consists of 396 conjuncts, 107 conjuncts are in the unsatisfiable core [2025-02-06 10:38:15,580 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:38:15,601 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:15,755 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:38:15,843 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-06 10:38:15,843 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:15,945 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:15,954 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,065 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 10:38:16,066 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:16,068 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 10:38:16,069 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 40 treesize of output 20 [2025-02-06 10:38:16,124 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2025-02-06 10:38:16,124 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:16,136 INFO L349 Elim1Store]: treesize reduction 33, result has 25.0 percent of original size [2025-02-06 10:38:16,137 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 56 treesize of output 28 [2025-02-06 10:38:16,534 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 7 treesize of output 3 [2025-02-06 10:38:16,618 INFO L349 Elim1Store]: treesize reduction 29, result has 21.6 percent of original size [2025-02-06 10:38:16,618 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 85 treesize of output 46 [2025-02-06 10:38:16,625 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 10:38:16,625 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 18 [2025-02-06 10:38:16,782 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:38:16,818 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:38:16,818 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:38:17,188 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 92 treesize of output 72 [2025-02-06 10:38:17,190 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 76 treesize of output 56 [2025-02-06 10:38:17,297 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 4 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (and (forall ((v_ArrVal_2875 (Array Int Int))) (or (< (+ (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_2875) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 4) 3) (select |c_#length| (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse0 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 4))) (not (= (select v_ArrVal_2875 .cse0) 0)))) (forall ((v_ArrVal_2875 (Array Int Int))) (or (< 0 (+ (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_2875) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 4) 1)) (not (= (select v_ArrVal_2875 .cse0) 0)))))) is different from false [2025-02-06 10:38:17,309 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|)) (.cse0 (+ 4 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (and (forall ((v_ArrVal_2875 (Array Int Int)) (v_ArrVal_2872 Int)) (or (not (= (select v_ArrVal_2875 .cse0) 0)) (< 0 (+ (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store .cse1 |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| v_ArrVal_2872)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_2875) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 4) 1)))) (forall ((v_ArrVal_2875 (Array Int Int)) (v_ArrVal_2872 Int) (v_ArrVal_2871 Int)) (or (< (+ (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store .cse1 |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| v_ArrVal_2872)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_2875) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 4) 3) (select |c_#length| (select (select (let ((.cse2 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| v_ArrVal_2871)))) (store .cse2 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store (select .cse2 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse0 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 4))) (not (= (select v_ArrVal_2875 .cse0) 0)))))) is different from false [2025-02-06 10:38:17,331 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4)) (.cse1 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|))) (and (forall ((v_ArrVal_2875 (Array Int Int)) (v_ArrVal_2872 Int) (v_ArrVal_2871 Int)) (or (not (= (select v_ArrVal_2875 .cse0) 0)) (< (+ (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store .cse1 |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| v_ArrVal_2872)) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_2875) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 4) 3) (select |c_#length| (select (select (let ((.cse2 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| v_ArrVal_2871)))) (store .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store (select .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 4))))) (forall ((v_ArrVal_2875 (Array Int Int)) (v_ArrVal_2872 Int)) (or (not (= (select v_ArrVal_2875 .cse0) 0)) (< 0 (+ (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store .cse1 |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| v_ArrVal_2872)) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_2875) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 4) 1)))))) is different from false [2025-02-06 10:38:17,364 INFO L349 Elim1Store]: treesize reduction 19, result has 62.0 percent of original size [2025-02-06 10:38:17,364 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 112 treesize of output 115 [2025-02-06 10:38:17,372 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 438 treesize of output 430 [2025-02-06 10:38:17,386 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 10:38:17,386 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 510 treesize of output 467 [2025-02-06 10:38:17,398 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 10:38:17,398 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 312 treesize of output 292 [2025-02-06 10:38:18,814 INFO L349 Elim1Store]: treesize reduction 31, result has 38.0 percent of original size [2025-02-06 10:38:18,814 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 40 treesize of output 31 [2025-02-06 10:38:18,825 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2025-02-06 10:38:18,826 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 36 treesize of output 30 [2025-02-06 10:38:18,841 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-02-06 10:38:18,841 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 18 treesize of output 15 [2025-02-06 10:38:19,202 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2025-02-06 10:38:19,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [915026367] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:38:19,256 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-06 10:38:19,256 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 26] total 52 [2025-02-06 10:38:19,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1208765153] [2025-02-06 10:38:19,256 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-06 10:38:19,256 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2025-02-06 10:38:19,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:38:19,257 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2025-02-06 10:38:19,257 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=206, Invalid=4225, Unknown=3, NotChecked=396, Total=4830 [2025-02-06 10:38:19,257 INFO L87 Difference]: Start difference. First operand 103 states and 116 transitions. Second operand has 53 states, 51 states have (on average 1.7058823529411764) internal successors, (87), 47 states have internal predecessors, (87), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-06 10:38:21,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:38:21,273 INFO L93 Difference]: Finished difference Result 103 states and 115 transitions. [2025-02-06 10:38:21,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-02-06 10:38:21,273 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 51 states have (on average 1.7058823529411764) internal successors, (87), 47 states have internal predecessors, (87), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 48 [2025-02-06 10:38:21,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:38:21,274 INFO L225 Difference]: With dead ends: 103 [2025-02-06 10:38:21,274 INFO L226 Difference]: Without dead ends: 103 [2025-02-06 10:38:21,277 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 1380 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=472, Invalid=7727, Unknown=3, NotChecked=540, Total=8742 [2025-02-06 10:38:21,277 INFO L435 NwaCegarLoop]: 35 mSDtfsCounter, 103 mSDsluCounter, 977 mSDsCounter, 0 mSdLazyCounter, 1692 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 1012 SdHoareTripleChecker+Invalid, 1702 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 1692 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-06 10:38:21,277 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 1012 Invalid, 1702 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 1692 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-06 10:38:21,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2025-02-06 10:38:21,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2025-02-06 10:38:21,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 87 states have (on average 1.2758620689655173) internal successors, (111), 99 states have internal predecessors, (111), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-06 10:38:21,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 115 transitions. [2025-02-06 10:38:21,282 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 115 transitions. Word has length 48 [2025-02-06 10:38:21,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:38:21,283 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 115 transitions. [2025-02-06 10:38:21,283 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 51 states have (on average 1.7058823529411764) internal successors, (87), 47 states have internal predecessors, (87), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-06 10:38:21,283 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 115 transitions. [2025-02-06 10:38:21,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-02-06 10:38:21,283 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:38:21,283 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:38:21,292 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:38:21,484 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,16 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:38:21,484 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2025-02-06 10:38:21,484 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:38:21,484 INFO L85 PathProgramCache]: Analyzing trace with hash -707149312, now seen corresponding path program 1 times [2025-02-06 10:38:21,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:38:21,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2043126497] [2025-02-06 10:38:21,484 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:38:21,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:38:21,495 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-02-06 10:38:21,499 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-02-06 10:38:21,499 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:38:21,499 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:38:21,583 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-02-06 10:38:21,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:38:21,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2043126497] [2025-02-06 10:38:21,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2043126497] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:38:21,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1467439385] [2025-02-06 10:38:21,584 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:38:21,584 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:38:21,584 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:38:21,586 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:38:21,587 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:38:21,724 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-02-06 10:38:21,990 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-02-06 10:38:21,990 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:38:21,990 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:38:21,993 INFO L256 TraceCheckSpWp]: Trace formula consists of 432 conjuncts, 51 conjuncts are in the unsatisfiable core [2025-02-06 10:38:21,995 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:38:22,002 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,131 INFO L349 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2025-02-06 10:38:22,131 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 26 [2025-02-06 10:38:22,276 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:38:22,289 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 10:38:22,290 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:38:22,398 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-02-06 10:38:22,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1467439385] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 10:38:22,398 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 10:38:22,398 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 16, 7] total 25 [2025-02-06 10:38:22,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448953128] [2025-02-06 10:38:22,398 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 10:38:22,399 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-02-06 10:38:22,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:38:22,399 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-02-06 10:38:22,399 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=538, Unknown=0, NotChecked=0, Total=650 [2025-02-06 10:38:22,399 INFO L87 Difference]: Start difference. First operand 103 states and 115 transitions. Second operand has 26 states, 25 states have (on average 3.92) internal successors, (98), 25 states have internal predecessors, (98), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2025-02-06 10:38:22,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:38:22,757 INFO L93 Difference]: Finished difference Result 160 states and 175 transitions. [2025-02-06 10:38:22,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-02-06 10:38:22,758 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 3.92) internal successors, (98), 25 states have internal predecessors, (98), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 53 [2025-02-06 10:38:22,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:38:22,758 INFO L225 Difference]: With dead ends: 160 [2025-02-06 10:38:22,758 INFO L226 Difference]: Without dead ends: 160 [2025-02-06 10:38:22,758 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=166, Invalid=704, Unknown=0, NotChecked=0, Total=870 [2025-02-06 10:38:22,759 INFO L435 NwaCegarLoop]: 44 mSDtfsCounter, 163 mSDsluCounter, 475 mSDsCounter, 0 mSdLazyCounter, 655 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 519 SdHoareTripleChecker+Invalid, 661 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 655 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 10:38:22,759 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 519 Invalid, 661 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 655 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 10:38:22,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2025-02-06 10:38:22,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 107. [2025-02-06 10:38:22,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 91 states have (on average 1.2747252747252746) internal successors, (116), 103 states have internal predecessors, (116), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-06 10:38:22,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 120 transitions. [2025-02-06 10:38:22,761 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 120 transitions. Word has length 53 [2025-02-06 10:38:22,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:38:22,761 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 120 transitions. [2025-02-06 10:38:22,761 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 3.92) internal successors, (98), 25 states have internal predecessors, (98), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2025-02-06 10:38:22,761 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 120 transitions. [2025-02-06 10:38:22,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-02-06 10:38:22,761 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:38:22,761 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, 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:22,774 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2025-02-06 10:38:22,961 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,17 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:38:22,962 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2025-02-06 10:38:22,962 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:38:22,962 INFO L85 PathProgramCache]: Analyzing trace with hash -446810977, now seen corresponding path program 1 times [2025-02-06 10:38:22,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:38:22,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1907479667] [2025-02-06 10:38:22,962 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:38:22,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:38:22,992 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-02-06 10:38:22,996 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-02-06 10:38:22,996 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:38:22,996 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:38:23,062 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-06 10:38:23,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:38:23,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1907479667] [2025-02-06 10:38:23,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1907479667] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:38:23,063 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:38:23,063 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-06 10:38:23,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1093209830] [2025-02-06 10:38:23,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:38:23,064 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-06 10:38:23,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:38:23,064 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-06 10:38:23,064 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-02-06 10:38:23,064 INFO L87 Difference]: Start difference. First operand 107 states and 120 transitions. Second operand has 10 states, 10 states have (on average 5.0) internal successors, (50), 9 states have internal predecessors, (50), 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:38:23,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:38:23,148 INFO L93 Difference]: Finished difference Result 118 states and 124 transitions. [2025-02-06 10:38:23,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-06 10:38:23,149 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 9 states have internal predecessors, (50), 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 54 [2025-02-06 10:38:23,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:38:23,149 INFO L225 Difference]: With dead ends: 118 [2025-02-06 10:38:23,149 INFO L226 Difference]: Without dead ends: 118 [2025-02-06 10:38:23,151 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-02-06 10:38:23,151 INFO L435 NwaCegarLoop]: 46 mSDtfsCounter, 12 mSDsluCounter, 353 mSDsCounter, 0 mSdLazyCounter, 195 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 399 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:38:23,151 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 399 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 195 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 10:38:23,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2025-02-06 10:38:23,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 109. [2025-02-06 10:38:23,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 93 states have (on average 1.2688172043010753) internal successors, (118), 105 states have internal predecessors, (118), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-06 10:38:23,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 122 transitions. [2025-02-06 10:38:23,153 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 122 transitions. Word has length 54 [2025-02-06 10:38:23,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:38:23,154 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 122 transitions. [2025-02-06 10:38:23,154 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 9 states have internal predecessors, (50), 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:38:23,154 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 122 transitions. [2025-02-06 10:38:23,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-02-06 10:38:23,154 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:38:23,154 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, 1, 1, 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:23,154 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-02-06 10:38:23,154 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2025-02-06 10:38:23,155 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:38:23,155 INFO L85 PathProgramCache]: Analyzing trace with hash 111329063, now seen corresponding path program 1 times [2025-02-06 10:38:23,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:38:23,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2146297081] [2025-02-06 10:38:23,155 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:38:23,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:38:23,167 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-02-06 10:38:23,172 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-02-06 10:38:23,173 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:38:23,173 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:38:23,206 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-02-06 10:38:23,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:38:23,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2146297081] [2025-02-06 10:38:23,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2146297081] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:38:23,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1770791336] [2025-02-06 10:38:23,207 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:38:23,207 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:38:23,207 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:38:23,208 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:23,209 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:23,363 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-02-06 10:38:23,392 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-02-06 10:38:23,392 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:38:23,392 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:38:23,394 INFO L256 TraceCheckSpWp]: Trace formula consists of 427 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-06 10:38:23,395 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:38:23,444 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-02-06 10:38:23,444 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:38:23,483 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-02-06 10:38:23,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1770791336] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 10:38:23,483 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 10:38:23,483 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-02-06 10:38:23,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [300435632] [2025-02-06 10:38:23,483 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 10:38:23,483 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-06 10:38:23,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:38:23,484 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-06 10:38:23,484 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2025-02-06 10:38:23,484 INFO L87 Difference]: Start difference. First operand 109 states and 122 transitions. Second operand has 10 states, 10 states have (on average 9.7) internal successors, (97), 10 states have internal predecessors, (97), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-02-06 10:38:23,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:38:23,496 INFO L93 Difference]: Finished difference Result 112 states and 125 transitions. [2025-02-06 10:38:23,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 10:38:23,496 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 9.7) internal successors, (97), 10 states have internal predecessors, (97), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 56 [2025-02-06 10:38:23,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:38:23,497 INFO L225 Difference]: With dead ends: 112 [2025-02-06 10:38:23,497 INFO L226 Difference]: Without dead ends: 112 [2025-02-06 10:38:23,497 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 106 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2025-02-06 10:38:23,497 INFO L435 NwaCegarLoop]: 65 mSDtfsCounter, 105 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 237 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 10:38:23,497 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 237 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 10:38:23,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2025-02-06 10:38:23,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2025-02-06 10:38:23,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 96 states have (on average 1.2604166666666667) internal successors, (121), 108 states have internal predecessors, (121), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-06 10:38:23,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 125 transitions. [2025-02-06 10:38:23,499 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 125 transitions. Word has length 56 [2025-02-06 10:38:23,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:38:23,499 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 125 transitions. [2025-02-06 10:38:23,499 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.7) internal successors, (97), 10 states have internal predecessors, (97), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-02-06 10:38:23,499 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 125 transitions. [2025-02-06 10:38:23,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-02-06 10:38:23,499 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:38:23,499 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:38:23,506 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:23,700 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34,18 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:38:23,700 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2025-02-06 10:38:23,700 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:38:23,701 INFO L85 PathProgramCache]: Analyzing trace with hash -281590278, now seen corresponding path program 1 times [2025-02-06 10:38:23,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:38:23,701 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509319903] [2025-02-06 10:38:23,701 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:38:23,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:38:23,715 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-02-06 10:38:23,727 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-02-06 10:38:23,727 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:38:23,727 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:38:25,693 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 3 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:38:25,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:38:25,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [509319903] [2025-02-06 10:38:25,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [509319903] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:38:25,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1928099837] [2025-02-06 10:38:25,693 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:38:25,693 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:38:25,693 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:38:25,695 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:25,696 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:25,851 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-02-06 10:38:26,044 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-02-06 10:38:26,044 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:38:26,044 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:38:26,047 INFO L256 TraceCheckSpWp]: Trace formula consists of 453 conjuncts, 117 conjuncts are in the unsatisfiable core [2025-02-06 10:38:26,050 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:38:26,237 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:26,312 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 10:38:26,313 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:26,355 INFO L349 Elim1Store]: treesize reduction 33, result has 25.0 percent of original size [2025-02-06 10:38:26,355 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 15 [2025-02-06 10:38:26,943 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-06 10:38:26,943 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 0 case distinctions, treesize of input 34 treesize of output 23 [2025-02-06 10:38:27,083 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-06 10:38:27,101 INFO L349 Elim1Store]: treesize reduction 168, result has 7.7 percent of original size [2025-02-06 10:38:27,101 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 9 case distinctions, treesize of input 85 treesize of output 52 [2025-02-06 10:38:27,266 INFO L349 Elim1Store]: treesize reduction 80, result has 19.2 percent of original size [2025-02-06 10:38:27,266 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 58 treesize of output 47 [2025-02-06 10:38:27,443 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 7 treesize of output 3 [2025-02-06 10:38:27,517 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 10:38:27,519 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-02-06 10:38:27,519 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 25 [2025-02-06 10:38:27,642 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:38:27,696 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-02-06 10:38:27,696 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:38:28,791 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 200 treesize of output 144 [2025-02-06 10:38:28,793 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 148 treesize of output 108 [2025-02-06 10:38:29,042 INFO L349 Elim1Store]: treesize reduction 13, result has 96.7 percent of original size [2025-02-06 10:38:29,042 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 398 treesize of output 589 [2025-02-06 10:38:29,378 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-06 10:38:29,379 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 168 treesize of output 156 [2025-02-06 10:38:29,637 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 10:38:29,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1928099837] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 10:38:29,637 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 10:38:29,637 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 31, 29] total 88 [2025-02-06 10:38:29,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1261847020] [2025-02-06 10:38:29,637 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 10:38:29,637 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 89 states [2025-02-06 10:38:29,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:38:29,638 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2025-02-06 10:38:29,639 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=426, Invalid=7406, Unknown=0, NotChecked=0, Total=7832 [2025-02-06 10:38:29,639 INFO L87 Difference]: Start difference. First operand 112 states and 125 transitions. Second operand has 89 states, 87 states have (on average 1.5632183908045978) internal successors, (136), 82 states have internal predecessors, (136), 5 states have call successors, (5), 2 states have call predecessors, (5), 4 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2025-02-06 10:38:33,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:38:33,940 INFO L93 Difference]: Finished difference Result 110 states and 114 transitions. [2025-02-06 10:38:33,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2025-02-06 10:38:33,941 INFO L78 Accepts]: Start accepts. Automaton has has 89 states, 87 states have (on average 1.5632183908045978) internal successors, (136), 82 states have internal predecessors, (136), 5 states have call successors, (5), 2 states have call predecessors, (5), 4 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 57 [2025-02-06 10:38:33,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:38:33,942 INFO L225 Difference]: With dead ends: 110 [2025-02-06 10:38:33,942 INFO L226 Difference]: Without dead ends: 110 [2025-02-06 10:38:33,944 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3692 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=1202, Invalid=15054, Unknown=0, NotChecked=0, Total=16256 [2025-02-06 10:38:33,945 INFO L435 NwaCegarLoop]: 28 mSDtfsCounter, 193 mSDsluCounter, 1146 mSDsCounter, 0 mSdLazyCounter, 2900 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 1174 SdHoareTripleChecker+Invalid, 2936 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 2900 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-02-06 10:38:33,945 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [193 Valid, 1174 Invalid, 2936 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 2900 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-02-06 10:38:33,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2025-02-06 10:38:33,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 104. [2025-02-06 10:38:33,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 88 states have (on average 1.2272727272727273) internal successors, (108), 100 states have internal predecessors, (108), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-06 10:38:33,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 112 transitions. [2025-02-06 10:38:33,947 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 112 transitions. Word has length 57 [2025-02-06 10:38:33,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:38:33,947 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 112 transitions. [2025-02-06 10:38:33,947 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 89 states, 87 states have (on average 1.5632183908045978) internal successors, (136), 82 states have internal predecessors, (136), 5 states have call successors, (5), 2 states have call predecessors, (5), 4 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2025-02-06 10:38:33,948 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 112 transitions. [2025-02-06 10:38:33,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-02-06 10:38:33,948 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:38:33,948 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:38:33,958 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2025-02-06 10:38:34,148 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2025-02-06 10:38:34,149 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2025-02-06 10:38:34,149 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:38:34,149 INFO L85 PathProgramCache]: Analyzing trace with hash -281590277, now seen corresponding path program 1 times [2025-02-06 10:38:34,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:38:34,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1880609201] [2025-02-06 10:38:34,149 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:38:34,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:38:34,161 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-02-06 10:38:34,174 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-02-06 10:38:34,174 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:38:34,174 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:38:36,467 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:38:36,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:38:36,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1880609201] [2025-02-06 10:38:36,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1880609201] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:38:36,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1233873978] [2025-02-06 10:38:36,468 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:38:36,469 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:38:36,469 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:38:36,471 INFO L229 MonitoredProcess]: Starting monitored process 20 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:36,473 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2025-02-06 10:38:36,684 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-02-06 10:38:36,773 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-02-06 10:38:36,773 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:38:36,773 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:38:36,778 INFO L256 TraceCheckSpWp]: Trace formula consists of 453 conjuncts, 144 conjuncts are in the unsatisfiable core [2025-02-06 10:38:36,783 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:38:36,814 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:37,065 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-06 10:38:37,066 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:37,195 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:37,203 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:37,313 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:37,322 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:37,336 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2025-02-06 10:38:37,346 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:38,198 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-06 10:38:38,199 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-06 10:38:38,216 INFO L349 Elim1Store]: treesize reduction 84, result has 11.6 percent of original size [2025-02-06 10:38:38,216 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 7 case distinctions, treesize of input 118 treesize of output 66 [2025-02-06 10:38:38,231 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 10:38:38,232 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 33 treesize of output 28 [2025-02-06 10:38:38,497 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 93 treesize of output 58 [2025-02-06 10:38:38,504 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 40 [2025-02-06 10:38:38,780 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 25 [2025-02-06 10:38:38,786 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 10 [2025-02-06 10:38:38,876 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-02-06 10:38:38,917 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:38:38,917 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:38:41,035 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 336 treesize of output 248 [2025-02-06 10:38:41,038 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 252 treesize of output 180 [2025-02-06 10:38:41,412 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (.cse3 (+ 4 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store .cse5 .cse3 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 4))) (and (forall ((v_ArrVal_3616 (Array Int Int)) (|ULTIMATE.start_dll_circular_remove_last_#t~mem13#1.offset| Int)) (= (select (select (let ((.cse2 (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_3616) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 4))) (let ((.cse0 (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store v_ArrVal_3616 .cse3 .cse2)))) (store .cse0 .cse1 (store (select .cse0 .cse1) .cse2 |ULTIMATE.start_dll_circular_remove_last_#t~mem13#1.offset|)))) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse3) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) (forall ((|ULTIMATE.start_dll_circular_remove_last_#t~mem13#1.base| Int) (v_ArrVal_3616 (Array Int Int))) (= (select (select (let ((.cse4 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store .cse5 .cse3 .cse1)))) (store .cse4 .cse1 (store (select .cse4 .cse1) (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_3616) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 4) |ULTIMATE.start_dll_circular_remove_last_#t~mem13#1.base|))) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse3) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))))) is different from false [2025-02-06 10:38:41,432 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse7 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|)) (.cse5 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|)) (.cse4 (+ 4 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (and (forall ((v_ArrVal_3614 Int) (v_ArrVal_3613 Int) (v_ArrVal_3616 (Array Int Int)) (|ULTIMATE.start_dll_circular_remove_last_#t~mem13#1.offset| Int)) (= (select (select (let ((.cse6 (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store .cse7 |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| v_ArrVal_3614)))) (let ((.cse2 (select (select (store .cse6 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_3616) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 4))) (let ((.cse0 (store .cse6 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store v_ArrVal_3616 .cse4 .cse2))) (.cse1 (select (select (let ((.cse3 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store .cse5 |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| v_ArrVal_3613)))) (store .cse3 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store (select .cse3 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse4 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 4))) (store .cse0 .cse1 (store (select .cse0 .cse1) .cse2 |ULTIMATE.start_dll_circular_remove_last_#t~mem13#1.offset|))))) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse4) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) (forall ((|ULTIMATE.start_dll_circular_remove_last_#t~mem13#1.base| Int) (v_ArrVal_3614 Int) (v_ArrVal_3613 Int) (v_ArrVal_3616 (Array Int Int))) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (select (select (let ((.cse10 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store .cse5 |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| v_ArrVal_3613)))) (let ((.cse11 (select .cse10 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))) (let ((.cse9 (select (select (store .cse10 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store .cse11 .cse4 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 4))) (let ((.cse8 (store .cse10 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store .cse11 .cse4 .cse9)))) (store .cse8 .cse9 (store (select .cse8 .cse9) (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store .cse7 |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| v_ArrVal_3614)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_3616) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 4) |ULTIMATE.start_dll_circular_remove_last_#t~mem13#1.base|)))))) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse4))))) is different from false [2025-02-06 10:38:41,459 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse6 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|)) (.cse2 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|)) (.cse5 (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4))) (and (forall ((|ULTIMATE.start_dll_circular_remove_last_#t~mem13#1.base| Int) (v_ArrVal_3614 Int) (v_ArrVal_3613 Int) (v_ArrVal_3616 (Array Int Int))) (= (select (select (let ((.cse3 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store .cse6 |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| v_ArrVal_3613)))) (let ((.cse4 (select .cse3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) (let ((.cse1 (select (select (store .cse3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse4 .cse5 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 4))) (let ((.cse0 (store .cse3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse4 .cse5 .cse1)))) (store .cse0 .cse1 (store (select .cse0 .cse1) (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store .cse2 |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| v_ArrVal_3614)) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_3616) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 4) |ULTIMATE.start_dll_circular_remove_last_#t~mem13#1.base|)))))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse5) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (forall ((v_ArrVal_3614 Int) (v_ArrVal_3613 Int) (v_ArrVal_3616 (Array Int Int)) (|ULTIMATE.start_dll_circular_remove_last_#t~mem13#1.offset| Int)) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| (select (select (let ((.cse11 (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store .cse2 |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| v_ArrVal_3614)))) (let ((.cse9 (select (select (store .cse11 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_3616) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 4))) (let ((.cse7 (store .cse11 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store v_ArrVal_3616 .cse5 .cse9))) (.cse8 (select (select (let ((.cse10 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store .cse6 |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| v_ArrVal_3613)))) (store .cse10 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store (select .cse10 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse5 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|))) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 4))) (store .cse7 .cse8 (store (select .cse7 .cse8) .cse9 |ULTIMATE.start_dll_circular_remove_last_#t~mem13#1.offset|))))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse5))))) is different from false [2025-02-06 10:38:41,503 INFO L349 Elim1Store]: treesize reduction 19, result has 62.0 percent of original size [2025-02-06 10:38:41,504 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 464 treesize of output 467 [2025-02-06 10:38:41,510 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 347 treesize of output 335 [2025-02-06 10:38:41,525 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 10:38:41,525 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 310 treesize of output 307 [2025-02-06 10:38:41,530 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 280 treesize of output 276 [2025-02-06 10:38:41,610 INFO L349 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2025-02-06 10:38:41,610 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 298 treesize of output 1 [2025-02-06 10:38:41,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1233873978] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:38:41,897 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-06 10:38:41,897 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 33] total 68 [2025-02-06 10:38:41,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [441919805] [2025-02-06 10:38:41,897 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-06 10:38:41,898 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 68 states [2025-02-06 10:38:41,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:38:41,899 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2025-02-06 10:38:41,902 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=373, Invalid=7118, Unknown=3, NotChecked=516, Total=8010 [2025-02-06 10:38:41,902 INFO L87 Difference]: Start difference. First operand 104 states and 112 transitions. Second operand has 68 states, 67 states have (on average 1.5522388059701493) internal successors, (104), 62 states have internal predecessors, (104), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-06 10:38:44,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:38:44,153 INFO L93 Difference]: Finished difference Result 99 states and 103 transitions. [2025-02-06 10:38:44,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2025-02-06 10:38:44,154 INFO L78 Accepts]: Start accepts. Automaton has has 68 states, 67 states have (on average 1.5522388059701493) internal successors, (104), 62 states have internal predecessors, (104), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 57 [2025-02-06 10:38:44,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:38:44,156 INFO L225 Difference]: With dead ends: 99 [2025-02-06 10:38:44,156 INFO L226 Difference]: Without dead ends: 99 [2025-02-06 10:38:44,158 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 46 SyntacticMatches, 2 SemanticMatches, 107 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 2845 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=597, Invalid=10542, Unknown=3, NotChecked=630, Total=11772 [2025-02-06 10:38:44,162 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 76 mSDsluCounter, 1227 mSDsCounter, 0 mSdLazyCounter, 2014 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 1259 SdHoareTripleChecker+Invalid, 2021 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 2014 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:38:44,162 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 1259 Invalid, 2021 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 2014 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-02-06 10:38:44,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2025-02-06 10:38:44,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 97. [2025-02-06 10:38:44,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 81 states have (on average 1.1975308641975309) internal successors, (97), 93 states have internal predecessors, (97), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-06 10:38:44,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 101 transitions. [2025-02-06 10:38:44,167 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 101 transitions. Word has length 57 [2025-02-06 10:38:44,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:38:44,168 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 101 transitions. [2025-02-06 10:38:44,168 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 68 states, 67 states have (on average 1.5522388059701493) internal successors, (104), 62 states have internal predecessors, (104), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-06 10:38:44,168 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 101 transitions. [2025-02-06 10:38:44,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-02-06 10:38:44,169 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:38:44,169 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:44,182 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2025-02-06 10:38:44,369 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36,20 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:38:44,370 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2025-02-06 10:38:44,370 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:38:44,370 INFO L85 PathProgramCache]: Analyzing trace with hash 1651889540, now seen corresponding path program 1 times [2025-02-06 10:38:44,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:38:44,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [352336503] [2025-02-06 10:38:44,371 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:38:44,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:38:44,386 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-02-06 10:38:44,392 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-02-06 10:38:44,392 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:38:44,392 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:38:44,449 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-02-06 10:38:44,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:38:44,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [352336503] [2025-02-06 10:38:44,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [352336503] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:38:44,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1091306051] [2025-02-06 10:38:44,450 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:38:44,450 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:38:44,450 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:38:44,452 INFO L229 MonitoredProcess]: Starting monitored process 21 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:44,454 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2025-02-06 10:38:44,660 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-02-06 10:38:44,695 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-02-06 10:38:44,695 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:38:44,696 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:38:44,697 INFO L256 TraceCheckSpWp]: Trace formula consists of 506 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-06 10:38:44,699 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:38:44,778 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-02-06 10:38:44,778 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 10:38:44,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1091306051] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:38:44,778 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 10:38:44,778 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 10 [2025-02-06 10:38:44,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [106741017] [2025-02-06 10:38:44,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:38:44,779 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 10:38:44,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:38:44,779 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 10:38:44,779 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2025-02-06 10:38:44,779 INFO L87 Difference]: Start difference. First operand 97 states and 101 transitions. Second operand has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 10:38:44,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:38:44,801 INFO L93 Difference]: Finished difference Result 63 states and 63 transitions. [2025-02-06 10:38:44,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 10:38:44,804 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 65 [2025-02-06 10:38:44,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:38:44,805 INFO L225 Difference]: With dead ends: 63 [2025-02-06 10:38:44,805 INFO L226 Difference]: Without dead ends: 63 [2025-02-06 10:38:44,805 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2025-02-06 10:38:44,807 INFO L435 NwaCegarLoop]: 58 mSDtfsCounter, 0 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 10:38:44,807 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 145 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 10:38:44,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2025-02-06 10:38:44,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2025-02-06 10:38:44,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 58 states have (on average 1.0172413793103448) internal successors, (59), 59 states have internal predecessors, (59), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-06 10:38:44,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 63 transitions. [2025-02-06 10:38:44,810 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 63 transitions. Word has length 65 [2025-02-06 10:38:44,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:38:44,811 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 63 transitions. [2025-02-06 10:38:44,811 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 10:38:44,811 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 63 transitions. [2025-02-06 10:38:44,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-02-06 10:38:44,812 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:38:44,812 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:44,820 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2025-02-06 10:38:45,012 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2025-02-06 10:38:45,012 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2025-02-06 10:38:45,013 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:38:45,013 INFO L85 PathProgramCache]: Analyzing trace with hash -331050628, now seen corresponding path program 1 times [2025-02-06 10:38:45,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:38:45,013 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [12136870] [2025-02-06 10:38:45,013 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:38:45,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:38:45,027 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-02-06 10:38:45,040 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-02-06 10:38:45,040 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:38:45,040 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:38:46,606 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 15 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 10:38:46,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:38:46,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [12136870] [2025-02-06 10:38:46,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [12136870] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:38:46,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1885697370] [2025-02-06 10:38:46,607 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:38:46,607 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:38:46,607 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:38:46,609 INFO L229 MonitoredProcess]: Starting monitored process 22 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:46,610 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2025-02-06 10:38:46,792 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-02-06 10:38:46,837 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-02-06 10:38:46,837 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:38:46,837 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:38:46,840 INFO L256 TraceCheckSpWp]: Trace formula consists of 507 conjuncts, 122 conjuncts are in the unsatisfiable core [2025-02-06 10:38:46,844 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:38:47,157 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-02-06 10:38:47,550 INFO L349 Elim1Store]: treesize reduction 173, result has 33.7 percent of original size [2025-02-06 10:38:47,550 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 210 treesize of output 295 [2025-02-06 10:38:47,874 INFO L349 Elim1Store]: treesize reduction 32, result has 63.6 percent of original size [2025-02-06 10:38:47,874 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 153 treesize of output 124 [2025-02-06 10:38:48,565 INFO L349 Elim1Store]: treesize reduction 176, result has 69.2 percent of original size [2025-02-06 10:38:48,565 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 15 case distinctions, treesize of input 375 treesize of output 665 [2025-02-06 10:38:48,579 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1