./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/list-simple/sll2c_prepend_unequal.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/sll2c_prepend_unequal.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f2f6ef7968fa573a7da88ae0a516f1d800f437d82b0fa75227e8d7d318952eb1 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 10:40:07,516 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 10:40:07,567 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:40:07,572 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 10:40:07,574 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 10:40:07,597 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 10:40:07,598 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 10:40:07,598 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 10:40:07,599 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 10:40:07,599 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 10:40:07,599 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 10:40:07,599 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 10:40:07,600 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 10:40:07,600 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 10:40:07,600 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 10:40:07,600 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 10:40:07,600 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 10:40:07,600 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 10:40:07,600 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 10:40:07,600 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 10:40:07,600 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-02-06 10:40:07,600 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-02-06 10:40:07,601 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-02-06 10:40:07,601 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 10:40:07,601 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-06 10:40:07,601 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-06 10:40:07,601 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 10:40:07,601 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 10:40:07,601 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 10:40:07,601 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 10:40:07,601 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 10:40:07,601 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 10:40:07,601 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 10:40:07,601 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 10:40:07,602 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 10:40:07,602 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 10:40:07,602 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 10:40:07,602 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 10:40:07,602 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 10:40:07,602 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 10:40:07,602 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 10:40:07,602 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 10:40:07,602 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 -> f2f6ef7968fa573a7da88ae0a516f1d800f437d82b0fa75227e8d7d318952eb1 [2025-02-06 10:40:07,805 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 10:40:07,810 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 10:40:07,812 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 10:40:07,812 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 10:40:07,812 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 10:40:07,813 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-simple/sll2c_prepend_unequal.i [2025-02-06 10:40:08,974 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1170cdb2a/f99e458af8754100aeb0ec2e1049d2f1/FLAG5b2436c43 [2025-02-06 10:40:09,297 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 10:40:09,298 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/list-simple/sll2c_prepend_unequal.i [2025-02-06 10:40:09,305 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1170cdb2a/f99e458af8754100aeb0ec2e1049d2f1/FLAG5b2436c43 [2025-02-06 10:40:09,548 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1170cdb2a/f99e458af8754100aeb0ec2e1049d2f1 [2025-02-06 10:40:09,550 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 10:40:09,550 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 10:40:09,551 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 10:40:09,551 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 10:40:09,556 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 10:40:09,556 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 10:40:09" (1/1) ... [2025-02-06 10:40:09,558 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@35a56a25 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:40:09, skipping insertion in model container [2025-02-06 10:40:09,558 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 10:40:09" (1/1) ... [2025-02-06 10:40:09,582 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 10:40:09,751 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 10:40:09,758 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 10:40:09,784 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 10:40:09,802 INFO L204 MainTranslator]: Completed translation [2025-02-06 10:40:09,803 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:40:09 WrapperNode [2025-02-06 10:40:09,803 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 10:40:09,804 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 10:40:09,804 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 10:40:09,804 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 10:40:09,808 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:40:09" (1/1) ... [2025-02-06 10:40:09,815 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:40:09" (1/1) ... [2025-02-06 10:40:09,834 INFO L138 Inliner]: procedures = 127, calls = 46, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 149 [2025-02-06 10:40:09,837 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 10:40:09,838 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 10:40:09,838 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 10:40:09,838 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 10:40:09,843 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:40:09" (1/1) ... [2025-02-06 10:40:09,843 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:40:09" (1/1) ... [2025-02-06 10:40:09,845 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:40:09" (1/1) ... [2025-02-06 10:40:09,866 INFO L175 MemorySlicer]: Split 27 memory accesses to 3 slices as follows [2, 10, 15]. 56 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 1, 0]. The 9 writes are split as follows [0, 2, 7]. [2025-02-06 10:40:09,866 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:40:09" (1/1) ... [2025-02-06 10:40:09,866 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:40:09" (1/1) ... [2025-02-06 10:40:09,877 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:40:09" (1/1) ... [2025-02-06 10:40:09,877 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:40:09" (1/1) ... [2025-02-06 10:40:09,878 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:40:09" (1/1) ... [2025-02-06 10:40:09,879 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:40:09" (1/1) ... [2025-02-06 10:40:09,885 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 10:40:09,885 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 10:40:09,885 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 10:40:09,885 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 10:40:09,886 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:40:09" (1/1) ... [2025-02-06 10:40:09,893 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 10:40:09,904 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:40:09,919 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:40:09,924 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:40:09,939 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-06 10:40:09,939 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-06 10:40:09,939 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-06 10:40:09,939 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-06 10:40:09,939 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-06 10:40:09,939 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-06 10:40:09,939 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2025-02-06 10:40:09,939 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2025-02-06 10:40:09,939 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-06 10:40:09,939 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 10:40:09,939 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-06 10:40:09,939 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-02-06 10:40:09,939 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-02-06 10:40:09,939 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-02-06 10:40:09,939 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-02-06 10:40:09,939 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-02-06 10:40:09,939 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-02-06 10:40:09,939 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-06 10:40:09,939 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-02-06 10:40:09,939 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-02-06 10:40:09,939 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-02-06 10:40:09,939 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 10:40:09,939 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-06 10:40:09,939 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-06 10:40:09,939 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 10:40:09,940 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 10:40:10,053 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 10:40:10,055 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 10:40:10,342 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L624: 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:40:10,372 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:40:10,395 INFO L? ?]: Removed 142 outVars from TransFormulas that were not future-live. [2025-02-06 10:40:10,395 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 10:40:10,406 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 10:40:10,406 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 10:40:10,406 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 10:40:10 BoogieIcfgContainer [2025-02-06 10:40:10,406 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 10:40:10,410 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 10:40:10,411 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 10:40:10,414 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 10:40:10,414 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 10:40:09" (1/3) ... [2025-02-06 10:40:10,414 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d0c208f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 10:40:10, skipping insertion in model container [2025-02-06 10:40:10,414 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:40:09" (2/3) ... [2025-02-06 10:40:10,414 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d0c208f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 10:40:10, skipping insertion in model container [2025-02-06 10:40:10,415 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 10:40:10" (3/3) ... [2025-02-06 10:40:10,415 INFO L128 eAbstractionObserver]: Analyzing ICFG sll2c_prepend_unequal.i [2025-02-06 10:40:10,425 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 10:40:10,427 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG sll2c_prepend_unequal.i that has 2 procedures, 133 locations, 1 initial locations, 4 loop locations, and 56 error locations. [2025-02-06 10:40:10,460 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 10:40:10,470 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=None, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@7cbb26e6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 10:40:10,472 INFO L334 AbstractCegarLoop]: Starting to check reachability of 56 error locations. [2025-02-06 10:40:10,475 INFO L276 IsEmpty]: Start isEmpty. Operand has 133 states, 72 states have (on average 1.9583333333333333) internal successors, (141), 128 states have internal predecessors, (141), 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:40:10,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-02-06 10:40:10,479 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:40:10,479 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-02-06 10:40:10,479 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting node_createErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 53 more)] === [2025-02-06 10:40:10,483 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:40:10,483 INFO L85 PathProgramCache]: Analyzing trace with hash 645155028, now seen corresponding path program 1 times [2025-02-06 10:40:10,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:40:10,491 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1170492306] [2025-02-06 10:40:10,491 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:40:10,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:40:10,551 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-06 10:40:10,564 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-06 10:40:10,565 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:40:10,565 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:40:10,671 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:40:10,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:40:10,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1170492306] [2025-02-06 10:40:10,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1170492306] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:40:10,672 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:40:10,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 10:40:10,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [422420249] [2025-02-06 10:40:10,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:40:10,676 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 10:40:10,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:40:10,689 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 10:40:10,689 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 10:40:10,690 INFO L87 Difference]: Start difference. First operand has 133 states, 72 states have (on average 1.9583333333333333) internal successors, (141), 128 states have internal predecessors, (141), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:40:10,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:40:10,793 INFO L93 Difference]: Finished difference Result 130 states and 140 transitions. [2025-02-06 10:40:10,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 10:40:10,795 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:40:10,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:40:10,798 INFO L225 Difference]: With dead ends: 130 [2025-02-06 10:40:10,799 INFO L226 Difference]: Without dead ends: 127 [2025-02-06 10:40:10,800 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:40:10,801 INFO L435 NwaCegarLoop]: 133 mSDtfsCounter, 2 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:40:10,802 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 212 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 10:40:10,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2025-02-06 10:40:10,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2025-02-06 10:40:10,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 69 states have (on average 1.8840579710144927) internal successors, (130), 122 states have internal predecessors, (130), 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:40:10,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 136 transitions. [2025-02-06 10:40:10,824 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 136 transitions. Word has length 6 [2025-02-06 10:40:10,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:40:10,824 INFO L471 AbstractCegarLoop]: Abstraction has 127 states and 136 transitions. [2025-02-06 10:40:10,824 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:40:10,824 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 136 transitions. [2025-02-06 10:40:10,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-02-06 10:40:10,825 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:40:10,825 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-02-06 10:40:10,825 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 10:40:10,825 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting node_createErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 53 more)] === [2025-02-06 10:40:10,825 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:40:10,826 INFO L85 PathProgramCache]: Analyzing trace with hash 645155029, now seen corresponding path program 1 times [2025-02-06 10:40:10,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:40:10,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1656665703] [2025-02-06 10:40:10,826 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:40:10,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:40:10,832 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-06 10:40:10,838 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-06 10:40:10,838 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:40:10,838 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:40:10,897 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:40:10,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:40:10,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1656665703] [2025-02-06 10:40:10,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1656665703] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:40:10,898 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:40:10,898 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 10:40:10,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1157998489] [2025-02-06 10:40:10,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:40:10,899 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 10:40:10,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:40:10,899 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 10:40:10,899 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 10:40:10,899 INFO L87 Difference]: Start difference. First operand 127 states and 136 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:40:10,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:40:10,965 INFO L93 Difference]: Finished difference Result 125 states and 134 transitions. [2025-02-06 10:40:10,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 10:40:10,966 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:40:10,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:40:10,967 INFO L225 Difference]: With dead ends: 125 [2025-02-06 10:40:10,968 INFO L226 Difference]: Without dead ends: 125 [2025-02-06 10:40:10,968 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:40:10,969 INFO L435 NwaCegarLoop]: 130 mSDtfsCounter, 2 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 213 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:40:10,969 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 213 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 10:40:10,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2025-02-06 10:40:10,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2025-02-06 10:40:10,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 69 states have (on average 1.855072463768116) internal successors, (128), 120 states have internal predecessors, (128), 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:40:10,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 134 transitions. [2025-02-06 10:40:10,979 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 134 transitions. Word has length 6 [2025-02-06 10:40:10,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:40:10,979 INFO L471 AbstractCegarLoop]: Abstraction has 125 states and 134 transitions. [2025-02-06 10:40:10,979 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:40:10,979 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 134 transitions. [2025-02-06 10:40:10,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-02-06 10:40:10,979 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:40:10,979 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:40:10,979 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 10:40:10,980 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr48REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 53 more)] === [2025-02-06 10:40:10,980 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:40:10,980 INFO L85 PathProgramCache]: Analyzing trace with hash 1173778692, now seen corresponding path program 1 times [2025-02-06 10:40:10,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:40:10,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1591252835] [2025-02-06 10:40:10,980 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:40:10,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:40:10,989 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-06 10:40:10,999 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-06 10:40:11,000 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:40:11,000 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:40:11,071 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:40:11,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:40:11,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1591252835] [2025-02-06 10:40:11,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1591252835] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:40:11,071 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:40:11,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 10:40:11,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392000556] [2025-02-06 10:40:11,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:40:11,071 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 10:40:11,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:40:11,072 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 10:40:11,072 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 10:40:11,072 INFO L87 Difference]: Start difference. First operand 125 states and 134 transitions. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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:40:11,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:40:11,087 INFO L93 Difference]: Finished difference Result 132 states and 142 transitions. [2025-02-06 10:40:11,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 10:40:11,087 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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 13 [2025-02-06 10:40:11,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:40:11,089 INFO L225 Difference]: With dead ends: 132 [2025-02-06 10:40:11,089 INFO L226 Difference]: Without dead ends: 132 [2025-02-06 10:40:11,089 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:40:11,091 INFO L435 NwaCegarLoop]: 132 mSDtfsCounter, 5 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 259 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:40:11,091 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 259 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 10:40:11,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2025-02-06 10:40:11,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 126. [2025-02-06 10:40:11,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 70 states have (on average 1.8428571428571427) internal successors, (129), 121 states have internal predecessors, (129), 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:40:11,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 135 transitions. [2025-02-06 10:40:11,101 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 135 transitions. Word has length 13 [2025-02-06 10:40:11,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:40:11,101 INFO L471 AbstractCegarLoop]: Abstraction has 126 states and 135 transitions. [2025-02-06 10:40:11,102 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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:40:11,102 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 135 transitions. [2025-02-06 10:40:11,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-02-06 10:40:11,103 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:40:11,103 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:40:11,103 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 10:40:11,103 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr50REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 53 more)] === [2025-02-06 10:40:11,104 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:40:11,104 INFO L85 PathProgramCache]: Analyzing trace with hash 611708174, now seen corresponding path program 1 times [2025-02-06 10:40:11,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:40:11,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1245445220] [2025-02-06 10:40:11,104 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:40:11,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:40:11,118 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-02-06 10:40:11,130 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-02-06 10:40:11,133 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:40:11,133 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:40:11,244 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-06 10:40:11,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:40:11,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1245445220] [2025-02-06 10:40:11,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1245445220] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:40:11,245 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:40:11,245 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 10:40:11,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1854481082] [2025-02-06 10:40:11,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:40:11,245 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 10:40:11,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:40:11,246 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 10:40:11,246 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 10:40:11,246 INFO L87 Difference]: Start difference. First operand 126 states and 135 transitions. Second operand has 6 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 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:40:11,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:40:11,401 INFO L93 Difference]: Finished difference Result 125 states and 134 transitions. [2025-02-06 10:40:11,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 10:40:11,402 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 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 22 [2025-02-06 10:40:11,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:40:11,403 INFO L225 Difference]: With dead ends: 125 [2025-02-06 10:40:11,403 INFO L226 Difference]: Without dead ends: 125 [2025-02-06 10:40:11,403 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:40:11,403 INFO L435 NwaCegarLoop]: 125 mSDtfsCounter, 2 mSDsluCounter, 281 mSDsCounter, 0 mSdLazyCounter, 250 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 406 SdHoareTripleChecker+Invalid, 251 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 250 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:40:11,404 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 406 Invalid, 251 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 250 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 10:40:11,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2025-02-06 10:40:11,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2025-02-06 10:40:11,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 70 states have (on average 1.8285714285714285) internal successors, (128), 120 states have internal predecessors, (128), 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:40:11,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 134 transitions. [2025-02-06 10:40:11,414 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 134 transitions. Word has length 22 [2025-02-06 10:40:11,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:40:11,414 INFO L471 AbstractCegarLoop]: Abstraction has 125 states and 134 transitions. [2025-02-06 10:40:11,415 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 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:40:11,415 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 134 transitions. [2025-02-06 10:40:11,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-02-06 10:40:11,415 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:40:11,415 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:40:11,415 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 10:40:11,415 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr51REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 53 more)] === [2025-02-06 10:40:11,415 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:40:11,416 INFO L85 PathProgramCache]: Analyzing trace with hash 611708175, now seen corresponding path program 1 times [2025-02-06 10:40:11,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:40:11,416 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1716353365] [2025-02-06 10:40:11,416 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:40:11,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:40:11,449 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-02-06 10:40:11,463 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-02-06 10:40:11,463 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:40:11,463 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:40:11,633 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 10:40:11,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:40:11,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1716353365] [2025-02-06 10:40:11,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1716353365] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:40:11,633 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:40:11,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 10:40:11,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2105732078] [2025-02-06 10:40:11,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:40:11,634 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 10:40:11,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:40:11,634 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 10:40:11,634 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 10:40:11,635 INFO L87 Difference]: Start difference. First operand 125 states and 134 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:40:11,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:40:11,759 INFO L93 Difference]: Finished difference Result 124 states and 133 transitions. [2025-02-06 10:40:11,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 10:40:11,759 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 22 [2025-02-06 10:40:11,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:40:11,760 INFO L225 Difference]: With dead ends: 124 [2025-02-06 10:40:11,760 INFO L226 Difference]: Without dead ends: 124 [2025-02-06 10:40:11,760 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:40:11,761 INFO L435 NwaCegarLoop]: 125 mSDtfsCounter, 1 mSDsluCounter, 305 mSDsCounter, 0 mSdLazyCounter, 221 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 430 SdHoareTripleChecker+Invalid, 221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 221 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:40:11,761 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 430 Invalid, 221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 221 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 10:40:11,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2025-02-06 10:40:11,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 124. [2025-02-06 10:40:11,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 70 states have (on average 1.8142857142857143) internal successors, (127), 119 states have internal predecessors, (127), 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:40:11,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 133 transitions. [2025-02-06 10:40:11,764 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 133 transitions. Word has length 22 [2025-02-06 10:40:11,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:40:11,765 INFO L471 AbstractCegarLoop]: Abstraction has 124 states and 133 transitions. [2025-02-06 10:40:11,765 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:40:11,765 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 133 transitions. [2025-02-06 10:40:11,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-02-06 10:40:11,765 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:40:11,765 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:40:11,765 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 10:40:11,766 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr48REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 53 more)] === [2025-02-06 10:40:11,766 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:40:11,766 INFO L85 PathProgramCache]: Analyzing trace with hash -147929752, now seen corresponding path program 1 times [2025-02-06 10:40:11,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:40:11,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [24622574] [2025-02-06 10:40:11,766 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:40:11,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:40:11,775 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-02-06 10:40:11,781 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-02-06 10:40:11,781 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:40:11,781 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:40:11,943 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 10:40:11,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:40:11,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [24622574] [2025-02-06 10:40:11,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [24622574] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:40:11,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1811424271] [2025-02-06 10:40:11,944 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:40:11,944 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:40:11,944 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:40:11,946 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:40:11,948 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:40:12,003 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-02-06 10:40:12,024 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-02-06 10:40:12,024 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:40:12,024 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:40:12,026 INFO L256 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-02-06 10:40:12,029 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:40:12,078 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:40:12,115 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:40:12,159 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-02-06 10:40:12,160 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:40:12,168 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 6 not checked. [2025-02-06 10:40:12,168 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:40:12,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1811424271] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:40:12,235 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-06 10:40:12,235 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 10 [2025-02-06 10:40:12,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1680838489] [2025-02-06 10:40:12,236 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-06 10:40:12,236 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-06 10:40:12,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:40:12,236 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-06 10:40:12,236 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=86, Unknown=1, NotChecked=18, Total=132 [2025-02-06 10:40:12,236 INFO L87 Difference]: Start difference. First operand 124 states and 133 transitions. Second operand has 11 states, 10 states have (on average 2.7) internal successors, (27), 9 states have internal predecessors, (27), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-02-06 10:40:12,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:40:12,492 INFO L93 Difference]: Finished difference Result 123 states and 132 transitions. [2025-02-06 10:40:12,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 10:40:12,492 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.7) internal successors, (27), 9 states have internal predecessors, (27), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 25 [2025-02-06 10:40:12,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:40:12,493 INFO L225 Difference]: With dead ends: 123 [2025-02-06 10:40:12,493 INFO L226 Difference]: Without dead ends: 123 [2025-02-06 10:40:12,493 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=122, Unknown=1, NotChecked=22, Total=182 [2025-02-06 10:40:12,494 INFO L435 NwaCegarLoop]: 121 mSDtfsCounter, 2 mSDsluCounter, 476 mSDsCounter, 0 mSdLazyCounter, 418 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 597 SdHoareTripleChecker+Invalid, 547 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 418 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 125 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 10:40:12,494 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 597 Invalid, 547 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 418 Invalid, 0 Unknown, 125 Unchecked, 0.2s Time] [2025-02-06 10:40:12,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2025-02-06 10:40:12,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2025-02-06 10:40:12,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 70 states have (on average 1.8) internal successors, (126), 118 states have internal predecessors, (126), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-06 10:40:12,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 132 transitions. [2025-02-06 10:40:12,497 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 132 transitions. Word has length 25 [2025-02-06 10:40:12,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:40:12,498 INFO L471 AbstractCegarLoop]: Abstraction has 123 states and 132 transitions. [2025-02-06 10:40:12,498 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.7) internal successors, (27), 9 states have internal predecessors, (27), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-02-06 10:40:12,498 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 132 transitions. [2025-02-06 10:40:12,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-02-06 10:40:12,498 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:40:12,498 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:40:12,505 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-02-06 10:40:12,698 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:40:12,699 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr49REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 53 more)] === [2025-02-06 10:40:12,699 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:40:12,699 INFO L85 PathProgramCache]: Analyzing trace with hash -147929751, now seen corresponding path program 1 times [2025-02-06 10:40:12,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:40:12,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [180775803] [2025-02-06 10:40:12,699 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:40:12,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:40:12,711 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-02-06 10:40:12,733 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-02-06 10:40:12,733 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:40:12,733 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:40:13,005 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:40:13,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:40:13,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [180775803] [2025-02-06 10:40:13,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [180775803] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:40:13,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [128502615] [2025-02-06 10:40:13,006 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:40:13,006 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:40:13,006 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:40:13,012 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:40:13,014 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:40:13,070 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-02-06 10:40:13,091 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-02-06 10:40:13,091 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:40:13,091 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:40:13,092 INFO L256 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-02-06 10:40:13,094 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:40:13,102 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:40:13,264 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-02-06 10:40:13,265 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:40:13,295 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 10:40:13,295 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:40:13,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [128502615] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:40:13,416 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-06 10:40:13,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 17 [2025-02-06 10:40:13,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [8824349] [2025-02-06 10:40:13,416 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-06 10:40:13,416 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-02-06 10:40:13,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:40:13,417 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-02-06 10:40:13,417 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=324, Unknown=0, NotChecked=0, Total=380 [2025-02-06 10:40:13,417 INFO L87 Difference]: Start difference. First operand 123 states and 132 transitions. Second operand has 18 states, 17 states have (on average 2.3529411764705883) internal successors, (40), 14 states have internal predecessors, (40), 3 states have call successors, (3), 3 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-02-06 10:40:13,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:40:13,866 INFO L93 Difference]: Finished difference Result 130 states and 142 transitions. [2025-02-06 10:40:13,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-06 10:40:13,866 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 2.3529411764705883) internal successors, (40), 14 states have internal predecessors, (40), 3 states have call successors, (3), 3 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 25 [2025-02-06 10:40:13,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:40:13,867 INFO L225 Difference]: With dead ends: 130 [2025-02-06 10:40:13,868 INFO L226 Difference]: Without dead ends: 130 [2025-02-06 10:40:13,868 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=77, Invalid=429, Unknown=0, NotChecked=0, Total=506 [2025-02-06 10:40:13,870 INFO L435 NwaCegarLoop]: 121 mSDtfsCounter, 5 mSDsluCounter, 842 mSDsCounter, 0 mSdLazyCounter, 696 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 963 SdHoareTripleChecker+Invalid, 707 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 696 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-06 10:40:13,870 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 963 Invalid, 707 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 696 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-06 10:40:13,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2025-02-06 10:40:13,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 122. [2025-02-06 10:40:13,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 70 states have (on average 1.7857142857142858) internal successors, (125), 117 states have internal predecessors, (125), 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:40:13,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 131 transitions. [2025-02-06 10:40:13,879 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 131 transitions. Word has length 25 [2025-02-06 10:40:13,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:40:13,879 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 131 transitions. [2025-02-06 10:40:13,879 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 2.3529411764705883) internal successors, (40), 14 states have internal predecessors, (40), 3 states have call successors, (3), 3 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-02-06 10:40:13,880 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 131 transitions. [2025-02-06 10:40:13,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-02-06 10:40:13,880 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:40:13,880 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:40:13,890 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-06 10:40:14,080 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:40:14,081 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr46REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 53 more)] === [2025-02-06 10:40:14,081 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:40:14,082 INFO L85 PathProgramCache]: Analyzing trace with hash -1136686916, now seen corresponding path program 1 times [2025-02-06 10:40:14,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:40:14,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [953072712] [2025-02-06 10:40:14,082 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:40:14,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:40:14,100 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-02-06 10:40:14,114 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-02-06 10:40:14,115 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:40:14,115 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:40:14,472 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-06 10:40:14,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:40:14,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [953072712] [2025-02-06 10:40:14,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [953072712] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:40:14,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1389538752] [2025-02-06 10:40:14,473 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:40:14,473 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:40:14,473 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:40:14,475 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:40:14,479 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:40:14,539 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-02-06 10:40:14,567 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-02-06 10:40:14,567 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:40:14,567 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:40:14,568 INFO L256 TraceCheckSpWp]: Trace formula consists of 325 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-02-06 10:40:14,570 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:40:14,573 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:40:14,582 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:40:14,592 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:40:14,623 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 10:40:14,624 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:40:14,640 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:40:14,694 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 10:40:14,695 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:40:14,716 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:40:14,752 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-02-06 10:40:14,753 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:40:14,755 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 12 not checked. [2025-02-06 10:40:14,755 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:40:14,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1389538752] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:40:14,793 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-06 10:40:14,793 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 7] total 14 [2025-02-06 10:40:14,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [611038786] [2025-02-06 10:40:14,793 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-06 10:40:14,794 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-02-06 10:40:14,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:40:14,794 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-02-06 10:40:14,794 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=147, Unknown=2, NotChecked=50, Total=240 [2025-02-06 10:40:14,794 INFO L87 Difference]: Start difference. First operand 122 states and 131 transitions. Second operand has 15 states, 14 states have (on average 3.0714285714285716) internal successors, (43), 14 states have internal predecessors, (43), 2 states have call successors, (3), 1 states have call predecessors, (3), 5 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2025-02-06 10:40:15,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:40:15,103 INFO L93 Difference]: Finished difference Result 131 states and 141 transitions. [2025-02-06 10:40:15,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 10:40:15,103 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 3.0714285714285716) internal successors, (43), 14 states have internal predecessors, (43), 2 states have call successors, (3), 1 states have call predecessors, (3), 5 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) Word has length 37 [2025-02-06 10:40:15,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:40:15,104 INFO L225 Difference]: With dead ends: 131 [2025-02-06 10:40:15,104 INFO L226 Difference]: Without dead ends: 131 [2025-02-06 10:40:15,104 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=216, Unknown=2, NotChecked=62, Total=342 [2025-02-06 10:40:15,105 INFO L435 NwaCegarLoop]: 61 mSDtfsCounter, 121 mSDsluCounter, 281 mSDsCounter, 0 mSdLazyCounter, 405 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 342 SdHoareTripleChecker+Invalid, 685 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 405 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 268 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 10:40:15,105 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 342 Invalid, 685 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 405 Invalid, 0 Unknown, 268 Unchecked, 0.2s Time] [2025-02-06 10:40:15,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2025-02-06 10:40:15,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 113. [2025-02-06 10:40:15,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 70 states have (on average 1.6571428571428573) internal successors, (116), 108 states have internal predecessors, (116), 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:40:15,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 122 transitions. [2025-02-06 10:40:15,110 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 122 transitions. Word has length 37 [2025-02-06 10:40:15,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:40:15,111 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 122 transitions. [2025-02-06 10:40:15,111 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 3.0714285714285716) internal successors, (43), 14 states have internal predecessors, (43), 2 states have call successors, (3), 1 states have call predecessors, (3), 5 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2025-02-06 10:40:15,111 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 122 transitions. [2025-02-06 10:40:15,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-02-06 10:40:15,111 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:40:15,111 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:40:15,120 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:40:15,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:40:15,313 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr47REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 53 more)] === [2025-02-06 10:40:15,313 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:40:15,313 INFO L85 PathProgramCache]: Analyzing trace with hash -1136686915, now seen corresponding path program 1 times [2025-02-06 10:40:15,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:40:15,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [118759044] [2025-02-06 10:40:15,313 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:40:15,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:40:15,339 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-02-06 10:40:15,349 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-02-06 10:40:15,349 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:40:15,349 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:40:15,762 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 10:40:15,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:40:15,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [118759044] [2025-02-06 10:40:15,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [118759044] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:40:15,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1153127060] [2025-02-06 10:40:15,763 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:40:15,763 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:40:15,763 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:40:15,766 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:40:15,769 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:40:15,836 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-02-06 10:40:15,863 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-02-06 10:40:15,863 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:40:15,863 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:40:15,865 INFO L256 TraceCheckSpWp]: Trace formula consists of 325 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-02-06 10:40:15,867 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:40:15,872 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:40:15,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:40:15,896 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:40:15,917 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 10:40:15,918 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:40:15,931 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:40:15,955 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 10:40:15,955 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:40:16,004 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:40:16,031 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 10:40:16,031 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:40:16,048 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-02-06 10:40:16,048 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 10:40:16,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1153127060] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:40:16,048 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 10:40:16,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [14] total 18 [2025-02-06 10:40:16,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077373653] [2025-02-06 10:40:16,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:40:16,049 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 10:40:16,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:40:16,049 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 10:40:16,049 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=255, Unknown=1, NotChecked=32, Total=342 [2025-02-06 10:40:16,050 INFO L87 Difference]: Start difference. First operand 113 states and 122 transitions. Second operand has 7 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-02-06 10:40:16,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:40:16,164 INFO L93 Difference]: Finished difference Result 107 states and 116 transitions. [2025-02-06 10:40:16,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 10:40:16,164 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 37 [2025-02-06 10:40:16,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:40:16,165 INFO L225 Difference]: With dead ends: 107 [2025-02-06 10:40:16,165 INFO L226 Difference]: Without dead ends: 107 [2025-02-06 10:40:16,165 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=59, Invalid=286, Unknown=1, NotChecked=34, Total=380 [2025-02-06 10:40:16,166 INFO L435 NwaCegarLoop]: 94 mSDtfsCounter, 22 mSDsluCounter, 227 mSDsCounter, 0 mSdLazyCounter, 180 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 321 SdHoareTripleChecker+Invalid, 328 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 143 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:40:16,166 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 321 Invalid, 328 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 180 Invalid, 0 Unknown, 143 Unchecked, 0.1s Time] [2025-02-06 10:40:16,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2025-02-06 10:40:16,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2025-02-06 10:40:16,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 70 states have (on average 1.5714285714285714) internal successors, (110), 102 states have internal predecessors, (110), 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:40:16,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 116 transitions. [2025-02-06 10:40:16,169 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 116 transitions. Word has length 37 [2025-02-06 10:40:16,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:40:16,169 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 116 transitions. [2025-02-06 10:40:16,169 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-02-06 10:40:16,169 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 116 transitions. [2025-02-06 10:40:16,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-02-06 10:40:16,170 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:40:16,170 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:40:16,180 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:40:16,374 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:40:16,374 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 53 more)] === [2025-02-06 10:40:16,375 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:40:16,375 INFO L85 PathProgramCache]: Analyzing trace with hash -1517702348, now seen corresponding path program 1 times [2025-02-06 10:40:16,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:40:16,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1581106842] [2025-02-06 10:40:16,375 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:40:16,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:40:16,385 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-02-06 10:40:16,391 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-02-06 10:40:16,392 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:40:16,392 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:40:16,441 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-02-06 10:40:16,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:40:16,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1581106842] [2025-02-06 10:40:16,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1581106842] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:40:16,442 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:40:16,442 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 10:40:16,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1817485984] [2025-02-06 10:40:16,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:40:16,442 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 10:40:16,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:40:16,443 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 10:40:16,443 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 10:40:16,443 INFO L87 Difference]: Start difference. First operand 107 states and 116 transitions. Second operand has 6 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-06 10:40:16,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:40:16,542 INFO L93 Difference]: Finished difference Result 105 states and 114 transitions. [2025-02-06 10:40:16,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 10:40:16,543 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 40 [2025-02-06 10:40:16,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:40:16,543 INFO L225 Difference]: With dead ends: 105 [2025-02-06 10:40:16,543 INFO L226 Difference]: Without dead ends: 105 [2025-02-06 10:40:16,544 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:40:16,544 INFO L435 NwaCegarLoop]: 92 mSDtfsCounter, 21 mSDsluCounter, 236 mSDsCounter, 0 mSdLazyCounter, 206 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 328 SdHoareTripleChecker+Invalid, 208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 206 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:40:16,544 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 328 Invalid, 208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 206 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 10:40:16,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2025-02-06 10:40:16,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2025-02-06 10:40:16,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 70 states have (on average 1.542857142857143) internal successors, (108), 100 states have internal predecessors, (108), 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:40:16,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 114 transitions. [2025-02-06 10:40:16,548 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 114 transitions. Word has length 40 [2025-02-06 10:40:16,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:40:16,548 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 114 transitions. [2025-02-06 10:40:16,549 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-06 10:40:16,549 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 114 transitions. [2025-02-06 10:40:16,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-02-06 10:40:16,550 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:40:16,550 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:40:16,550 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-06 10:40:16,550 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 53 more)] === [2025-02-06 10:40:16,551 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:40:16,551 INFO L85 PathProgramCache]: Analyzing trace with hash -1517702347, now seen corresponding path program 1 times [2025-02-06 10:40:16,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:40:16,552 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [760960695] [2025-02-06 10:40:16,552 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:40:16,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:40:16,562 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-02-06 10:40:16,567 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-02-06 10:40:16,567 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:40:16,567 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:40:16,671 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-02-06 10:40:16,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:40:16,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [760960695] [2025-02-06 10:40:16,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [760960695] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:40:16,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [740870500] [2025-02-06 10:40:16,671 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:40:16,672 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:40:16,672 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:40:16,677 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:40:16,679 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:40:16,749 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-02-06 10:40:16,778 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-02-06 10:40:16,778 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:40:16,778 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:40:16,780 INFO L256 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-02-06 10:40:16,785 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:40:16,793 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:40:16,860 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-02-06 10:40:16,861 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 10:40:16,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [740870500] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:40:16,861 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 10:40:16,861 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 14 [2025-02-06 10:40:16,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [781692734] [2025-02-06 10:40:16,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:40:16,863 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 10:40:16,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:40:16,863 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 10:40:16,863 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2025-02-06 10:40:16,863 INFO L87 Difference]: Start difference. First operand 105 states and 114 transitions. Second operand has 6 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-06 10:40:16,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:40:16,963 INFO L93 Difference]: Finished difference Result 103 states and 112 transitions. [2025-02-06 10:40:16,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 10:40:16,964 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 40 [2025-02-06 10:40:16,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:40:16,964 INFO L225 Difference]: With dead ends: 103 [2025-02-06 10:40:16,965 INFO L226 Difference]: Without dead ends: 103 [2025-02-06 10:40:16,966 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2025-02-06 10:40:16,966 INFO L435 NwaCegarLoop]: 92 mSDtfsCounter, 20 mSDsluCounter, 248 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 340 SdHoareTripleChecker+Invalid, 185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:40:16,966 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 340 Invalid, 185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 184 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 10:40:16,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2025-02-06 10:40:16,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2025-02-06 10:40:16,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 70 states have (on average 1.5142857142857142) internal successors, (106), 98 states have internal predecessors, (106), 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:40:16,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 112 transitions. [2025-02-06 10:40:16,968 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 112 transitions. Word has length 40 [2025-02-06 10:40:16,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:40:16,968 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 112 transitions. [2025-02-06 10:40:16,968 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-06 10:40:16,968 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 112 transitions. [2025-02-06 10:40:16,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-02-06 10:40:16,970 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:40:16,970 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:40:16,977 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-02-06 10:40:17,170 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,SelfDestructingSolverStorable10 [2025-02-06 10:40:17,171 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 53 more)] === [2025-02-06 10:40:17,171 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:40:17,171 INFO L85 PathProgramCache]: Analyzing trace with hash 1776925618, now seen corresponding path program 1 times [2025-02-06 10:40:17,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:40:17,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [844440170] [2025-02-06 10:40:17,172 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:40:17,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:40:17,182 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-02-06 10:40:17,190 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-02-06 10:40:17,190 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:40:17,191 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:40:17,363 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-02-06 10:40:17,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:40:17,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [844440170] [2025-02-06 10:40:17,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [844440170] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:40:17,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2118974515] [2025-02-06 10:40:17,363 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:40:17,363 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:40:17,363 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:40:17,365 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:40:17,369 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:40:17,450 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-02-06 10:40:17,483 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-02-06 10:40:17,483 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:40:17,483 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:40:17,485 INFO L256 TraceCheckSpWp]: Trace formula consists of 370 conjuncts, 43 conjuncts are in the unsatisfiable core [2025-02-06 10:40:17,489 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:40:17,497 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:40:17,502 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:40:17,528 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:40:17,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 5 treesize of output 3 [2025-02-06 10:40:17,600 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 10:40:17,600 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:40:17,606 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 10:40:17,606 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 12 treesize of output 14 [2025-02-06 10:40:17,684 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:40:17,688 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 10:40:17,689 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-06 10:40:17,750 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-02-06 10:40:17,750 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:40:17,761 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 10:40:17,771 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2025-02-06 10:40:17,772 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2025-02-06 10:40:17,845 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:40:17,868 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:40:17,893 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 10:40:17,894 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:40:17,926 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 12 not checked. [2025-02-06 10:40:17,926 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:40:18,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2118974515] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:40:18,029 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-06 10:40:18,029 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 14] total 23 [2025-02-06 10:40:18,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [641651484] [2025-02-06 10:40:18,029 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-06 10:40:18,030 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-02-06 10:40:18,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:40:18,030 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-02-06 10:40:18,030 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=483, Unknown=1, NotChecked=44, Total=600 [2025-02-06 10:40:18,030 INFO L87 Difference]: Start difference. First operand 103 states and 112 transitions. Second operand has 23 states, 22 states have (on average 2.9545454545454546) internal successors, (65), 18 states have internal predecessors, (65), 5 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2025-02-06 10:40:18,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:40:18,674 INFO L93 Difference]: Finished difference Result 101 states and 110 transitions. [2025-02-06 10:40:18,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-02-06 10:40:18,675 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 2.9545454545454546) internal successors, (65), 18 states have internal predecessors, (65), 5 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 42 [2025-02-06 10:40:18,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:40:18,675 INFO L225 Difference]: With dead ends: 101 [2025-02-06 10:40:18,676 INFO L226 Difference]: Without dead ends: 101 [2025-02-06 10:40:18,676 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=164, Invalid=961, Unknown=1, NotChecked=64, Total=1190 [2025-02-06 10:40:18,676 INFO L435 NwaCegarLoop]: 61 mSDtfsCounter, 142 mSDsluCounter, 866 mSDsCounter, 0 mSdLazyCounter, 958 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 927 SdHoareTripleChecker+Invalid, 1070 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 958 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 104 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-06 10:40:18,677 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 927 Invalid, 1070 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 958 Invalid, 0 Unknown, 104 Unchecked, 0.4s Time] [2025-02-06 10:40:18,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2025-02-06 10:40:18,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 98. [2025-02-06 10:40:18,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 68 states have (on average 1.4705882352941178) internal successors, (100), 93 states have internal predecessors, (100), 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:40:18,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 106 transitions. [2025-02-06 10:40:18,679 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 106 transitions. Word has length 42 [2025-02-06 10:40:18,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:40:18,679 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 106 transitions. [2025-02-06 10:40:18,679 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 2.9545454545454546) internal successors, (65), 18 states have internal predecessors, (65), 5 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2025-02-06 10:40:18,679 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 106 transitions. [2025-02-06 10:40:18,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-02-06 10:40:18,679 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:40:18,679 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:40:18,686 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-02-06 10:40:18,880 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,SelfDestructingSolverStorable11 [2025-02-06 10:40:18,880 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 53 more)] === [2025-02-06 10:40:18,881 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:40:18,881 INFO L85 PathProgramCache]: Analyzing trace with hash 1808419636, now seen corresponding path program 1 times [2025-02-06 10:40:18,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:40:18,881 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1971550735] [2025-02-06 10:40:18,881 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:40:18,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:40:18,890 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-02-06 10:40:18,896 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-02-06 10:40:18,896 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:40:18,896 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:40:19,130 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 17 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 10:40:19,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:40:19,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1971550735] [2025-02-06 10:40:19,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1971550735] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:40:19,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [156567164] [2025-02-06 10:40:19,130 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:40:19,131 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:40:19,131 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:40:19,136 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:40:19,137 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:40:19,216 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-02-06 10:40:19,305 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-02-06 10:40:19,305 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:40:19,305 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:40:19,307 INFO L256 TraceCheckSpWp]: Trace formula consists of 347 conjuncts, 38 conjuncts are in the unsatisfiable core [2025-02-06 10:40:19,311 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:40:19,450 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2025-02-06 10:40:19,497 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:40:19,523 INFO L349 Elim1Store]: treesize reduction 32, result has 36.0 percent of original size [2025-02-06 10:40:19,523 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 24 [2025-02-06 10:40:19,537 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:40:19,540 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-02-06 10:40:19,540 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 10:40:19,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [156567164] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:40:19,540 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 10:40:19,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [14] total 21 [2025-02-06 10:40:19,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229553993] [2025-02-06 10:40:19,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:40:19,540 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-06 10:40:19,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:40:19,541 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-06 10:40:19,541 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=369, Unknown=1, NotChecked=38, Total=462 [2025-02-06 10:40:19,541 INFO L87 Difference]: Start difference. First operand 98 states and 106 transitions. Second operand has 12 states, 11 states have (on average 2.727272727272727) internal successors, (30), 11 states have internal predecessors, (30), 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:40:19,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:40:19,724 INFO L93 Difference]: Finished difference Result 99 states and 109 transitions. [2025-02-06 10:40:19,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-06 10:40:19,725 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.727272727272727) internal successors, (30), 11 states have internal predecessors, (30), 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 42 [2025-02-06 10:40:19,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:40:19,725 INFO L225 Difference]: With dead ends: 99 [2025-02-06 10:40:19,725 INFO L226 Difference]: Without dead ends: 99 [2025-02-06 10:40:19,725 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=69, Invalid=486, Unknown=1, NotChecked=44, Total=600 [2025-02-06 10:40:19,726 INFO L435 NwaCegarLoop]: 81 mSDtfsCounter, 29 mSDsluCounter, 366 mSDsCounter, 0 mSdLazyCounter, 332 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 447 SdHoareTripleChecker+Invalid, 486 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 332 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 149 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:40:19,726 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 447 Invalid, 486 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 332 Invalid, 0 Unknown, 149 Unchecked, 0.1s Time] [2025-02-06 10:40:19,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2025-02-06 10:40:19,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 98. [2025-02-06 10:40:19,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 70 states have (on average 1.4428571428571428) internal successors, (101), 93 states have internal predecessors, (101), 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:40:19,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 107 transitions. [2025-02-06 10:40:19,728 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 107 transitions. Word has length 42 [2025-02-06 10:40:19,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:40:19,728 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 107 transitions. [2025-02-06 10:40:19,728 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.727272727272727) internal successors, (30), 11 states have internal predecessors, (30), 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:40:19,729 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 107 transitions. [2025-02-06 10:40:19,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-02-06 10:40:19,731 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:40:19,731 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:40:19,738 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:40:19,931 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:40:19,931 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 53 more)] === [2025-02-06 10:40:19,931 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:40:19,931 INFO L85 PathProgramCache]: Analyzing trace with hash 1808419637, now seen corresponding path program 1 times [2025-02-06 10:40:19,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:40:19,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1185045928] [2025-02-06 10:40:19,932 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:40:19,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:40:19,942 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-02-06 10:40:19,949 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-02-06 10:40:19,949 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:40:19,949 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:40:20,301 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 15 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 10:40:20,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:40:20,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1185045928] [2025-02-06 10:40:20,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1185045928] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:40:20,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1722053683] [2025-02-06 10:40:20,301 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:40:20,301 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:40:20,301 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:40:20,303 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:40:20,306 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:40:20,392 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-02-06 10:40:20,484 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-02-06 10:40:20,484 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:40:20,484 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:40:20,486 INFO L256 TraceCheckSpWp]: Trace formula consists of 347 conjuncts, 60 conjuncts are in the unsatisfiable core [2025-02-06 10:40:20,491 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:40:20,511 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:40:20,514 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:40:20,722 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2025-02-06 10:40:20,724 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2025-02-06 10:40:20,752 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_4| Int)) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_4|) 0) 0)) (exists ((|node_create_~temp~0#1.base| Int)) (and (= (store |c_old(#length)| |node_create_~temp~0#1.base| (select |c_#length| |node_create_~temp~0#1.base|)) |c_#length|) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|))))) is different from true [2025-02-06 10:40:20,780 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 10:40:20,781 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2025-02-06 10:40:20,787 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2025-02-06 10:40:20,787 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2025-02-06 10:40:20,834 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:40:20,874 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 6 not checked. [2025-02-06 10:40:20,874 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:40:21,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1722053683] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:40:21,020 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-06 10:40:21,021 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 15] total 27 [2025-02-06 10:40:21,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1178010605] [2025-02-06 10:40:21,021 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-06 10:40:21,021 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-02-06 10:40:21,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:40:21,021 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-02-06 10:40:21,022 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=849, Unknown=1, NotChecked=58, Total=992 [2025-02-06 10:40:21,022 INFO L87 Difference]: Start difference. First operand 98 states and 107 transitions. Second operand has 28 states, 26 states have (on average 2.5) internal successors, (65), 24 states have internal predecessors, (65), 4 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2025-02-06 10:40:21,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:40:21,792 INFO L93 Difference]: Finished difference Result 116 states and 125 transitions. [2025-02-06 10:40:21,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-02-06 10:40:21,793 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 26 states have (on average 2.5) internal successors, (65), 24 states have internal predecessors, (65), 4 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 42 [2025-02-06 10:40:21,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:40:21,793 INFO L225 Difference]: With dead ends: 116 [2025-02-06 10:40:21,793 INFO L226 Difference]: Without dead ends: 116 [2025-02-06 10:40:21,794 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 278 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=191, Invalid=1974, Unknown=1, NotChecked=90, Total=2256 [2025-02-06 10:40:21,794 INFO L435 NwaCegarLoop]: 79 mSDtfsCounter, 131 mSDsluCounter, 1138 mSDsCounter, 0 mSdLazyCounter, 1110 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 1217 SdHoareTripleChecker+Invalid, 1237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 1110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 119 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-06 10:40:21,794 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 1217 Invalid, 1237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 1110 Invalid, 0 Unknown, 119 Unchecked, 0.5s Time] [2025-02-06 10:40:21,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2025-02-06 10:40:21,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 113. [2025-02-06 10:40:21,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 84 states have (on average 1.369047619047619) internal successors, (115), 107 states have internal predecessors, (115), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-06 10:40:21,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 121 transitions. [2025-02-06 10:40:21,796 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 121 transitions. Word has length 42 [2025-02-06 10:40:21,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:40:21,796 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 121 transitions. [2025-02-06 10:40:21,796 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 26 states have (on average 2.5) internal successors, (65), 24 states have internal predecessors, (65), 4 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2025-02-06 10:40:21,796 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 121 transitions. [2025-02-06 10:40:21,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-02-06 10:40:21,796 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:40:21,797 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:40:21,803 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:40:21,997 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:40:21,998 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 53 more)] === [2025-02-06 10:40:21,998 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:40:21,998 INFO L85 PathProgramCache]: Analyzing trace with hash -1656691570, now seen corresponding path program 1 times [2025-02-06 10:40:21,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:40:21,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [542974610] [2025-02-06 10:40:21,998 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:40:21,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:40:22,008 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-02-06 10:40:22,016 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-02-06 10:40:22,017 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:40:22,017 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:40:22,695 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 17 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:40:22,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:40:22,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [542974610] [2025-02-06 10:40:22,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [542974610] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:40:22,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1008216742] [2025-02-06 10:40:22,695 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:40:22,696 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:40:22,696 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:40:22,698 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:40:22,700 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:40:22,788 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-02-06 10:40:22,855 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-02-06 10:40:22,855 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:40:22,855 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:40:22,858 INFO L256 TraceCheckSpWp]: Trace formula consists of 377 conjuncts, 100 conjuncts are in the unsatisfiable core [2025-02-06 10:40:22,860 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:40:22,882 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:40:23,053 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-06 10:40:23,054 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:40:23,153 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:40:23,236 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-02-06 10:40:23,236 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 33 [2025-02-06 10:40:23,342 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2025-02-06 10:40:23,345 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-02-06 10:40:23,488 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_5| Int)) (= 0 (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_5|) 0))) (exists ((|node_create_~temp~0#1.base| Int)) (and (= (store |c_old(#memory_$Pointer$#2.base)| |node_create_~temp~0#1.base| (select |c_#memory_$Pointer$#2.base| |node_create_~temp~0#1.base|)) |c_#memory_$Pointer$#2.base|) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| 1))))) is different from true [2025-02-06 10:40:23,508 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 10:40:23,509 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 27 [2025-02-06 10:40:23,530 INFO L349 Elim1Store]: treesize reduction 72, result has 37.4 percent of original size [2025-02-06 10:40:23,530 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 34 treesize of output 57 [2025-02-06 10:40:23,656 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-02-06 10:40:23,656 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 15 treesize of output 7 [2025-02-06 10:40:23,811 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 38 [2025-02-06 10:40:23,881 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 17 [2025-02-06 10:40:23,993 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 3 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2025-02-06 10:40:23,993 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:40:24,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1008216742] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:40:24,077 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-06 10:40:24,077 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 26] total 49 [2025-02-06 10:40:24,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [905224715] [2025-02-06 10:40:24,077 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-06 10:40:24,077 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2025-02-06 10:40:24,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:40:24,078 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2025-02-06 10:40:24,078 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=160, Invalid=2293, Unknown=1, NotChecked=96, Total=2550 [2025-02-06 10:40:24,079 INFO L87 Difference]: Start difference. First operand 113 states and 121 transitions. Second operand has 50 states, 46 states have (on average 1.8043478260869565) internal successors, (83), 43 states have internal predecessors, (83), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-06 10:40:25,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:40:25,409 INFO L93 Difference]: Finished difference Result 164 states and 179 transitions. [2025-02-06 10:40:25,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-02-06 10:40:25,409 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 46 states have (on average 1.8043478260869565) internal successors, (83), 43 states have internal predecessors, (83), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 48 [2025-02-06 10:40:25,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:40:25,411 INFO L225 Difference]: With dead ends: 164 [2025-02-06 10:40:25,411 INFO L226 Difference]: Without dead ends: 164 [2025-02-06 10:40:25,413 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 65 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 935 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=317, Invalid=3976, Unknown=1, NotChecked=128, Total=4422 [2025-02-06 10:40:25,414 INFO L435 NwaCegarLoop]: 75 mSDtfsCounter, 180 mSDsluCounter, 1633 mSDsCounter, 0 mSdLazyCounter, 1893 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 182 SdHoareTripleChecker+Valid, 1708 SdHoareTripleChecker+Invalid, 2069 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 1893 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 156 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-06 10:40:25,414 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [182 Valid, 1708 Invalid, 2069 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 1893 Invalid, 0 Unknown, 156 Unchecked, 0.8s Time] [2025-02-06 10:40:25,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2025-02-06 10:40:25,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 142. [2025-02-06 10:40:25,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 110 states have (on average 1.309090909090909) internal successors, (144), 133 states have internal predecessors, (144), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-02-06 10:40:25,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 154 transitions. [2025-02-06 10:40:25,421 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 154 transitions. Word has length 48 [2025-02-06 10:40:25,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:40:25,421 INFO L471 AbstractCegarLoop]: Abstraction has 142 states and 154 transitions. [2025-02-06 10:40:25,421 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 46 states have (on average 1.8043478260869565) internal successors, (83), 43 states have internal predecessors, (83), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-06 10:40:25,421 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 154 transitions. [2025-02-06 10:40:25,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-02-06 10:40:25,422 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:40:25,422 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:40:25,429 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:40:25,627 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:40:25,627 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 53 more)] === [2025-02-06 10:40:25,627 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:40:25,628 INFO L85 PathProgramCache]: Analyzing trace with hash -1656691569, now seen corresponding path program 1 times [2025-02-06 10:40:25,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:40:25,628 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [835361882] [2025-02-06 10:40:25,628 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:40:25,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:40:25,642 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-02-06 10:40:25,654 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-02-06 10:40:25,656 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:40:25,656 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:40:26,680 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 5 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:40:26,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:40:26,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [835361882] [2025-02-06 10:40:26,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [835361882] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:40:26,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [532845332] [2025-02-06 10:40:26,681 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:40:26,681 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:40:26,681 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:40:26,685 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:40:26,688 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:40:26,787 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-02-06 10:40:26,837 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-02-06 10:40:26,837 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:40:26,837 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:40:26,841 INFO L256 TraceCheckSpWp]: Trace formula consists of 377 conjuncts, 124 conjuncts are in the unsatisfiable core [2025-02-06 10:40:26,845 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:40:26,870 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:40:26,877 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:40:27,102 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-02-06 10:40:27,103 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:40:27,112 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-06 10:40:27,112 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:40:27,196 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:40:27,200 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:40:27,331 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-02-06 10:40:27,331 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 59 treesize of output 52 [2025-02-06 10:40:27,337 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2025-02-06 10:40:27,530 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 19 [2025-02-06 10:40:27,533 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-02-06 10:40:27,536 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2025-02-06 10:40:27,538 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2025-02-06 10:40:27,710 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6| Int)) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6|) 0) 0)) (exists ((|node_create_~temp~0#1.base| Int)) (and (= (store |c_old(#memory_$Pointer$#2.base)| |node_create_~temp~0#1.base| (select |c_#memory_$Pointer$#2.base| |node_create_~temp~0#1.base|)) |c_#memory_$Pointer$#2.base|) (= (store |c_old(#length)| |node_create_~temp~0#1.base| (select |c_#length| |node_create_~temp~0#1.base|)) |c_#length|) (= (store |c_old(#memory_$Pointer$#2.offset)| |node_create_~temp~0#1.base| (select |c_#memory_$Pointer$#2.offset| |node_create_~temp~0#1.base|)) |c_#memory_$Pointer$#2.offset|) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|))))) is different from true [2025-02-06 10:40:27,734 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 10:40:27,735 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 34 [2025-02-06 10:40:27,738 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 10:40:27,739 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 22 treesize of output 17 [2025-02-06 10:40:27,753 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2025-02-06 10:40:27,753 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2025-02-06 10:40:27,756 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2025-02-06 10:40:28,007 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 48 treesize of output 28 [2025-02-06 10:40:28,061 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:40:28,065 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2025-02-06 10:40:28,136 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 3 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2025-02-06 10:40:28,137 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:40:28,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [532845332] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:40:28,506 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-06 10:40:28,506 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 50 [2025-02-06 10:40:28,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1974688395] [2025-02-06 10:40:28,506 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-06 10:40:28,506 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2025-02-06 10:40:28,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:40:28,507 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2025-02-06 10:40:28,507 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=2917, Unknown=1, NotChecked=108, Total=3192 [2025-02-06 10:40:28,508 INFO L87 Difference]: Start difference. First operand 142 states and 154 transitions. Second operand has 51 states, 47 states have (on average 1.7659574468085106) internal successors, (83), 44 states have internal predecessors, (83), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-06 10:40:30,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:40:30,655 INFO L93 Difference]: Finished difference Result 164 states and 178 transitions. [2025-02-06 10:40:30,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-02-06 10:40:30,655 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 47 states have (on average 1.7659574468085106) internal successors, (83), 44 states have internal predecessors, (83), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 48 [2025-02-06 10:40:30,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:40:30,656 INFO L225 Difference]: With dead ends: 164 [2025-02-06 10:40:30,656 INFO L226 Difference]: Without dead ends: 164 [2025-02-06 10:40:30,657 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 76 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1083 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=335, Invalid=5520, Unknown=1, NotChecked=150, Total=6006 [2025-02-06 10:40:30,657 INFO L435 NwaCegarLoop]: 82 mSDtfsCounter, 172 mSDsluCounter, 1768 mSDsCounter, 0 mSdLazyCounter, 2383 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 1850 SdHoareTripleChecker+Invalid, 2558 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 2383 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 158 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-02-06 10:40:30,657 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [174 Valid, 1850 Invalid, 2558 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 2383 Invalid, 0 Unknown, 158 Unchecked, 1.2s Time] [2025-02-06 10:40:30,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2025-02-06 10:40:30,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 140. [2025-02-06 10:40:30,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 108 states have (on average 1.3055555555555556) internal successors, (141), 131 states have internal predecessors, (141), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-02-06 10:40:30,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 151 transitions. [2025-02-06 10:40:30,664 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 151 transitions. Word has length 48 [2025-02-06 10:40:30,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:40:30,664 INFO L471 AbstractCegarLoop]: Abstraction has 140 states and 151 transitions. [2025-02-06 10:40:30,664 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 47 states have (on average 1.7659574468085106) internal successors, (83), 44 states have internal predecessors, (83), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-06 10:40:30,664 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 151 transitions. [2025-02-06 10:40:30,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-02-06 10:40:30,664 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:40:30,665 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 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] [2025-02-06 10:40:30,678 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:40:30,865 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,SelfDestructingSolverStorable15 [2025-02-06 10:40:30,865 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 53 more)] === [2025-02-06 10:40:30,866 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:40:30,866 INFO L85 PathProgramCache]: Analyzing trace with hash -1869507992, now seen corresponding path program 2 times [2025-02-06 10:40:30,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:40:30,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1782864035] [2025-02-06 10:40:30,866 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 10:40:30,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:40:30,876 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 54 statements into 2 equivalence classes. [2025-02-06 10:40:30,903 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 54 of 54 statements. [2025-02-06 10:40:30,904 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 10:40:30,904 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:40:31,949 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 19 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:40:31,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:40:31,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1782864035] [2025-02-06 10:40:31,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1782864035] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:40:31,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [15920916] [2025-02-06 10:40:31,949 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 10:40:31,949 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:40:31,949 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:40:31,954 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:40:31,955 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:40:32,068 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 54 statements into 2 equivalence classes. [2025-02-06 10:40:32,120 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 54 of 54 statements. [2025-02-06 10:40:32,120 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 10:40:32,120 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:40:32,126 INFO L256 TraceCheckSpWp]: Trace formula consists of 407 conjuncts, 127 conjuncts are in the unsatisfiable core [2025-02-06 10:40:32,132 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:40:32,151 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:40:32,366 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-06 10:40:32,366 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:40:32,443 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:40:32,446 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:40:32,572 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2025-02-06 10:40:32,572 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 38 [2025-02-06 10:40:32,578 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 22 [2025-02-06 10:40:32,765 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2025-02-06 10:40:32,765 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 64 treesize of output 31 [2025-02-06 10:40:32,769 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2025-02-06 10:40:32,771 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-02-06 10:40:32,931 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_7| Int)) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_7|) 0) 0)) (exists ((|node_create_~temp~0#1.base| Int)) (and (= (store |c_old(#memory_$Pointer$#2.base)| |node_create_~temp~0#1.base| (select |c_#memory_$Pointer$#2.base| |node_create_~temp~0#1.base|)) |c_#memory_$Pointer$#2.base|) (= (store |c_old(#memory_$Pointer$#2.offset)| |node_create_~temp~0#1.base| (select |c_#memory_$Pointer$#2.offset| |node_create_~temp~0#1.base|)) |c_#memory_$Pointer$#2.offset|) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|))))) is different from true [2025-02-06 10:40:32,956 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 10:40:32,964 INFO L349 Elim1Store]: treesize reduction 29, result has 14.7 percent of original size [2025-02-06 10:40:32,964 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 72 treesize of output 55 [2025-02-06 10:40:32,968 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 10:40:32,969 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 10:40:32,969 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 33 [2025-02-06 10:40:32,985 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2025-02-06 10:40:32,985 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2025-02-06 10:40:33,418 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2025-02-06 10:40:33,418 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 66 treesize of output 29 [2025-02-06 10:40:33,429 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2025-02-06 10:40:33,477 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:40:33,508 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 9 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2025-02-06 10:40:33,508 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:40:33,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [15920916] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:40:33,918 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-06 10:40:33,918 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 53 [2025-02-06 10:40:33,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [518899927] [2025-02-06 10:40:33,918 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-06 10:40:33,918 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2025-02-06 10:40:33,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:40:33,919 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2025-02-06 10:40:33,919 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=3119, Unknown=1, NotChecked=112, Total=3422 [2025-02-06 10:40:33,920 INFO L87 Difference]: Start difference. First operand 140 states and 151 transitions. Second operand has 53 states, 50 states have (on average 1.82) internal successors, (91), 46 states have internal predecessors, (91), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-06 10:40:35,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:40:35,494 INFO L93 Difference]: Finished difference Result 149 states and 161 transitions. [2025-02-06 10:40:35,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-02-06 10:40:35,494 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 50 states have (on average 1.82) internal successors, (91), 46 states have internal predecessors, (91), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 54 [2025-02-06 10:40:35,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:40:35,495 INFO L225 Difference]: With dead ends: 149 [2025-02-06 10:40:35,495 INFO L226 Difference]: Without dead ends: 149 [2025-02-06 10:40:35,496 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 45 SyntacticMatches, 1 SemanticMatches, 73 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1219 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=346, Invalid=5059, Unknown=1, NotChecked=144, Total=5550 [2025-02-06 10:40:35,496 INFO L435 NwaCegarLoop]: 81 mSDtfsCounter, 98 mSDsluCounter, 2179 mSDsCounter, 0 mSdLazyCounter, 1832 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 2260 SdHoareTripleChecker+Invalid, 1986 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 1832 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 141 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-02-06 10:40:35,496 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 2260 Invalid, 1986 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 1832 Invalid, 0 Unknown, 141 Unchecked, 0.9s Time] [2025-02-06 10:40:35,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2025-02-06 10:40:35,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 144. [2025-02-06 10:40:35,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 112 states have (on average 1.2946428571428572) internal successors, (145), 135 states have internal predecessors, (145), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-02-06 10:40:35,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 155 transitions. [2025-02-06 10:40:35,500 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 155 transitions. Word has length 54 [2025-02-06 10:40:35,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:40:35,501 INFO L471 AbstractCegarLoop]: Abstraction has 144 states and 155 transitions. [2025-02-06 10:40:35,501 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 50 states have (on average 1.82) internal successors, (91), 46 states have internal predecessors, (91), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-06 10:40:35,501 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 155 transitions. [2025-02-06 10:40:35,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-02-06 10:40:35,501 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:40:35,501 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:40:35,508 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2025-02-06 10:40:35,705 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,SelfDestructingSolverStorable16 [2025-02-06 10:40:35,705 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 53 more)] === [2025-02-06 10:40:35,705 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:40:35,705 INFO L85 PathProgramCache]: Analyzing trace with hash 376740422, now seen corresponding path program 1 times [2025-02-06 10:40:35,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:40:35,705 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [773376032] [2025-02-06 10:40:35,705 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:40:35,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:40:35,727 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-02-06 10:40:35,732 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-02-06 10:40:35,732 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:40:35,732 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:40:35,924 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-02-06 10:40:35,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:40:35,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [773376032] [2025-02-06 10:40:35,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [773376032] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:40:35,924 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:40:35,924 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-06 10:40:35,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1922513708] [2025-02-06 10:40:35,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:40:35,925 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-06 10:40:35,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:40:35,926 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-06 10:40:35,926 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-02-06 10:40:35,926 INFO L87 Difference]: Start difference. First operand 144 states and 155 transitions. Second operand has 10 states, 8 states have (on average 5.0) internal successors, (40), 9 states have internal predecessors, (40), 2 states have call successors, (3), 1 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:40:36,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:40:36,138 INFO L93 Difference]: Finished difference Result 145 states and 155 transitions. [2025-02-06 10:40:36,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-06 10:40:36,138 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 5.0) internal successors, (40), 9 states have internal predecessors, (40), 2 states have call successors, (3), 1 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 54 [2025-02-06 10:40:36,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:40:36,139 INFO L225 Difference]: With dead ends: 145 [2025-02-06 10:40:36,139 INFO L226 Difference]: Without dead ends: 145 [2025-02-06 10:40:36,139 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2025-02-06 10:40:36,139 INFO L435 NwaCegarLoop]: 73 mSDtfsCounter, 45 mSDsluCounter, 402 mSDsCounter, 0 mSdLazyCounter, 341 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 475 SdHoareTripleChecker+Invalid, 345 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 341 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 10:40:36,139 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 475 Invalid, 345 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 341 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 10:40:36,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2025-02-06 10:40:36,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 141. [2025-02-06 10:40:36,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 112 states have (on average 1.2678571428571428) internal successors, (142), 132 states have internal predecessors, (142), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-02-06 10:40:36,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 152 transitions. [2025-02-06 10:40:36,144 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 152 transitions. Word has length 54 [2025-02-06 10:40:36,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:40:36,145 INFO L471 AbstractCegarLoop]: Abstraction has 141 states and 152 transitions. [2025-02-06 10:40:36,145 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 5.0) internal successors, (40), 9 states have internal predecessors, (40), 2 states have call successors, (3), 1 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:40:36,145 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 152 transitions. [2025-02-06 10:40:36,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-02-06 10:40:36,146 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:40:36,146 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:40:36,146 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-06 10:40:36,146 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 53 more)] === [2025-02-06 10:40:36,146 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:40:36,146 INFO L85 PathProgramCache]: Analyzing trace with hash 376740423, now seen corresponding path program 1 times [2025-02-06 10:40:36,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:40:36,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2109264509] [2025-02-06 10:40:36,146 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:40:36,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:40:36,158 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-02-06 10:40:36,163 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-02-06 10:40:36,163 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:40:36,163 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:40:36,371 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-02-06 10:40:36,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:40:36,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2109264509] [2025-02-06 10:40:36,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2109264509] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:40:36,372 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:40:36,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-06 10:40:36,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [353701602] [2025-02-06 10:40:36,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:40:36,373 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-06 10:40:36,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:40:36,373 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-06 10:40:36,373 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-02-06 10:40:36,373 INFO L87 Difference]: Start difference. First operand 141 states and 152 transitions. Second operand has 10 states, 8 states have (on average 5.25) internal successors, (42), 9 states have internal predecessors, (42), 2 states have call successors, (3), 1 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:40:36,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:40:36,505 INFO L93 Difference]: Finished difference Result 143 states and 153 transitions. [2025-02-06 10:40:36,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-06 10:40:36,509 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 5.25) internal successors, (42), 9 states have internal predecessors, (42), 2 states have call successors, (3), 1 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 54 [2025-02-06 10:40:36,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:40:36,510 INFO L225 Difference]: With dead ends: 143 [2025-02-06 10:40:36,510 INFO L226 Difference]: Without dead ends: 143 [2025-02-06 10:40:36,510 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2025-02-06 10:40:36,510 INFO L435 NwaCegarLoop]: 71 mSDtfsCounter, 46 mSDsluCounter, 334 mSDsCounter, 0 mSdLazyCounter, 242 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 405 SdHoareTripleChecker+Invalid, 243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 242 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:40:36,510 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 405 Invalid, 243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 242 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 10:40:36,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2025-02-06 10:40:36,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 139. [2025-02-06 10:40:36,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 112 states have (on average 1.25) internal successors, (140), 130 states have internal predecessors, (140), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-02-06 10:40:36,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 150 transitions. [2025-02-06 10:40:36,515 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 150 transitions. Word has length 54 [2025-02-06 10:40:36,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:40:36,515 INFO L471 AbstractCegarLoop]: Abstraction has 139 states and 150 transitions. [2025-02-06 10:40:36,515 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 5.25) internal successors, (42), 9 states have internal predecessors, (42), 2 states have call successors, (3), 1 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:40:36,515 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 150 transitions. [2025-02-06 10:40:36,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-02-06 10:40:36,516 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:40:36,516 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:40:36,516 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-06 10:40:36,516 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 53 more)] === [2025-02-06 10:40:36,516 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:40:36,516 INFO L85 PathProgramCache]: Analyzing trace with hash 981573291, now seen corresponding path program 1 times [2025-02-06 10:40:36,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:40:36,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2139376712] [2025-02-06 10:40:36,516 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:40:36,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:40:36,527 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-02-06 10:40:36,535 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-02-06 10:40:36,536 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:40:36,536 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:40:37,433 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 13 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:40:37,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:40:37,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2139376712] [2025-02-06 10:40:37,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2139376712] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:40:37,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [839375022] [2025-02-06 10:40:37,434 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:40:37,434 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:40:37,434 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:40:37,436 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:40:37,437 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:40:37,588 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-02-06 10:40:37,649 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-02-06 10:40:37,649 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:40:37,649 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:40:37,655 INFO L256 TraceCheckSpWp]: Trace formula consists of 447 conjuncts, 80 conjuncts are in the unsatisfiable core [2025-02-06 10:40:37,663 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:40:37,684 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:40:37,778 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-06 10:40:37,778 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:40:37,827 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:40:37,897 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-02-06 10:40:37,897 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 26 [2025-02-06 10:40:38,000 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2025-02-06 10:40:38,010 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:40:38,268 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((|node_create_~temp~0#1.base| Int)) (and (= (store |c_old(#memory_$Pointer$#2.base)| |node_create_~temp~0#1.base| (select |c_#memory_$Pointer$#2.base| |node_create_~temp~0#1.base|)) |c_#memory_$Pointer$#2.base|) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) (exists ((|ULTIMATE.start_main_~#s~0#1.offset| Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_8| Int)) (and (<= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_8|) |ULTIMATE.start_main_~#s~0#1.offset|) 0) (<= |ULTIMATE.start_main_~#s~0#1.offset| 0)))) is different from true [2025-02-06 10:40:38,303 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2025-02-06 10:40:38,303 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2025-02-06 10:40:38,308 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 25 treesize of output 20 [2025-02-06 10:40:38,479 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-06 10:40:38,484 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 10:40:38,485 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 22 [2025-02-06 10:40:38,592 INFO L349 Elim1Store]: treesize reduction 13, result has 18.8 percent of original size [2025-02-06 10:40:38,592 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 15 [2025-02-06 10:40:38,714 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 3 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2025-02-06 10:40:38,715 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:40:38,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [839375022] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:40:38,962 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-06 10:40:38,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 27] total 48 [2025-02-06 10:40:38,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [210568754] [2025-02-06 10:40:38,962 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-06 10:40:38,963 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2025-02-06 10:40:38,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:40:38,963 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2025-02-06 10:40:38,964 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=164, Invalid=2701, Unknown=1, NotChecked=104, Total=2970 [2025-02-06 10:40:38,964 INFO L87 Difference]: Start difference. First operand 139 states and 150 transitions. Second operand has 48 states, 45 states have (on average 1.9111111111111112) internal successors, (86), 41 states have internal predecessors, (86), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-06 10:40:40,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:40:40,408 INFO L93 Difference]: Finished difference Result 142 states and 153 transitions. [2025-02-06 10:40:40,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-02-06 10:40:40,408 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 45 states have (on average 1.9111111111111112) internal successors, (86), 41 states have internal predecessors, (86), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 58 [2025-02-06 10:40:40,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:40:40,409 INFO L225 Difference]: With dead ends: 142 [2025-02-06 10:40:40,409 INFO L226 Difference]: Without dead ends: 142 [2025-02-06 10:40:40,410 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 57 SyntacticMatches, 1 SemanticMatches, 73 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1094 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=381, Invalid=5024, Unknown=1, NotChecked=144, Total=5550 [2025-02-06 10:40:40,410 INFO L435 NwaCegarLoop]: 76 mSDtfsCounter, 118 mSDsluCounter, 2100 mSDsCounter, 0 mSdLazyCounter, 1645 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 2176 SdHoareTripleChecker+Invalid, 1789 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 1645 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 133 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-06 10:40:40,411 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 2176 Invalid, 1789 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 1645 Invalid, 0 Unknown, 133 Unchecked, 0.7s Time] [2025-02-06 10:40:40,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2025-02-06 10:40:40,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 139. [2025-02-06 10:40:40,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 112 states have (on average 1.2410714285714286) internal successors, (139), 130 states have internal predecessors, (139), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-02-06 10:40:40,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 149 transitions. [2025-02-06 10:40:40,415 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 149 transitions. Word has length 58 [2025-02-06 10:40:40,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:40:40,415 INFO L471 AbstractCegarLoop]: Abstraction has 139 states and 149 transitions. [2025-02-06 10:40:40,415 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 45 states have (on average 1.9111111111111112) internal successors, (86), 41 states have internal predecessors, (86), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-06 10:40:40,415 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 149 transitions. [2025-02-06 10:40:40,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-02-06 10:40:40,415 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:40:40,415 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 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:40:40,424 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-02-06 10:40:40,620 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,13 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:40:40,620 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 53 more)] === [2025-02-06 10:40:40,621 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:40:40,621 INFO L85 PathProgramCache]: Analyzing trace with hash -935717462, now seen corresponding path program 3 times [2025-02-06 10:40:40,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:40:40,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [975897962] [2025-02-06 10:40:40,621 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 10:40:40,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:40:40,633 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 60 statements into 4 equivalence classes. [2025-02-06 10:40:40,641 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 50 of 60 statements. [2025-02-06 10:40:40,641 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-02-06 10:40:40,641 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:40:40,674 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2025-02-06 10:40:40,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:40:40,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [975897962] [2025-02-06 10:40:40,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [975897962] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:40:40,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2042599697] [2025-02-06 10:40:40,675 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 10:40:40,675 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:40:40,675 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:40:40,680 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:40:40,681 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:40:40,802 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 60 statements into 4 equivalence classes. [2025-02-06 10:40:40,881 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 50 of 60 statements. [2025-02-06 10:40:40,881 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-02-06 10:40:40,881 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:40:40,882 INFO L256 TraceCheckSpWp]: Trace formula consists of 395 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-06 10:40:40,884 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:40:40,903 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-02-06 10:40:40,903 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 10:40:40,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2042599697] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:40:40,903 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 10:40:40,903 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2025-02-06 10:40:40,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2029410616] [2025-02-06 10:40:40,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:40:40,904 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 10:40:40,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:40:40,904 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 10:40:40,904 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-02-06 10:40:40,904 INFO L87 Difference]: Start difference. First operand 139 states and 149 transitions. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-02-06 10:40:40,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:40:40,912 INFO L93 Difference]: Finished difference Result 98 states and 103 transitions. [2025-02-06 10:40:40,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 10:40:40,912 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 60 [2025-02-06 10:40:40,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:40:40,912 INFO L225 Difference]: With dead ends: 98 [2025-02-06 10:40:40,912 INFO L226 Difference]: Without dead ends: 98 [2025-02-06 10:40:40,912 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-02-06 10:40:40,913 INFO L435 NwaCegarLoop]: 91 mSDtfsCounter, 0 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 10:40:40,913 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 178 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 10:40:40,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2025-02-06 10:40:40,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2025-02-06 10:40:40,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 78 states have (on average 1.2435897435897436) internal successors, (97), 92 states have internal predecessors, (97), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-06 10:40:40,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 103 transitions. [2025-02-06 10:40:40,915 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 103 transitions. Word has length 60 [2025-02-06 10:40:40,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:40:40,915 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 103 transitions. [2025-02-06 10:40:40,915 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-02-06 10:40:40,915 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 103 transitions. [2025-02-06 10:40:40,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-02-06 10:40:40,915 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:40:40,915 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:40:40,923 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2025-02-06 10:40:41,116 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,14 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:40:41,116 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 53 more)] === [2025-02-06 10:40:41,116 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:40:41,116 INFO L85 PathProgramCache]: Analyzing trace with hash -1587657723, now seen corresponding path program 1 times [2025-02-06 10:40:41,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:40:41,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [484479541] [2025-02-06 10:40:41,116 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:40:41,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:40:41,149 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-02-06 10:40:41,165 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-02-06 10:40:41,165 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:40:41,165 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:40:42,378 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 13 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:40:42,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:40:42,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [484479541] [2025-02-06 10:40:42,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [484479541] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:40:42,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1236961547] [2025-02-06 10:40:42,379 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:40:42,379 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:40:42,379 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:40:42,381 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:40:42,381 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:40:42,503 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-02-06 10:40:42,545 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-02-06 10:40:42,546 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:40:42,546 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:40:42,552 INFO L256 TraceCheckSpWp]: Trace formula consists of 477 conjuncts, 143 conjuncts are in the unsatisfiable core [2025-02-06 10:40:42,557 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:40:42,584 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:40:42,804 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-06 10:40:42,804 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-02-06 10:40:42,890 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-02-06 10:40:42,995 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 16 treesize of output 11 [2025-02-06 10:40:43,155 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2025-02-06 10:40:43,158 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2025-02-06 10:40:43,292 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:40:43,370 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:40:43,381 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:40:43,626 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2025-02-06 10:40:43,626 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2025-02-06 10:40:43,637 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2025-02-06 10:40:44,321 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-06 10:40:44,322 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-06 10:40:44,322 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 7 [2025-02-06 10:40:44,596 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 10:40:44,596 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 1 case distinctions, treesize of input 15 treesize of output 15 [2025-02-06 10:40:45,013 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-02-06 10:40:45,066 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-06 10:40:45,069 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-06 10:40:45,110 INFO L349 Elim1Store]: treesize reduction 20, result has 58.3 percent of original size [2025-02-06 10:40:45,110 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 44 treesize of output 44 [2025-02-06 10:40:45,115 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-06 10:40:45,123 INFO L349 Elim1Store]: treesize reduction 37, result has 15.9 percent of original size [2025-02-06 10:40:45,123 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 26 treesize of output 21 [2025-02-06 10:40:45,237 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:40:45,334 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-06 10:40:45,334 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-02-06 10:40:45,340 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-02-06 10:40:45,342 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 3 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:40:45,342 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:40:45,448 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2052 (Array Int Int))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store |c_#memory_int#2| |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_2052) (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)))) is different from false [2025-02-06 10:40:45,453 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2052 (Array Int Int))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store |c_#memory_int#2| |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_2052) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)))) is different from false [2025-02-06 10:40:45,466 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2049 (Array Int Int)) (v_ArrVal_2052 (Array Int Int))) (or (not (= v_ArrVal_2049 (store (select |c_#memory_int#2| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| (select v_ArrVal_2049 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (store |c_#memory_int#2| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_2049) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_2052) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))))) is different from false [2025-02-06 10:40:46,512 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 10:40:46,512 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 206 treesize of output 210 [2025-02-06 10:40:46,522 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 178 treesize of output 146 [2025-02-06 10:40:46,533 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 438 treesize of output 400 [2025-02-06 10:40:46,575 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 19 treesize of output 3 [2025-02-06 10:40:46,602 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 138 treesize of output 122 [2025-02-06 10:40:46,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1236961547] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:40:46,898 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-06 10:40:46,898 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 37] total 64 [2025-02-06 10:40:46,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1314288586] [2025-02-06 10:40:46,898 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-06 10:40:46,898 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 64 states [2025-02-06 10:40:46,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:40:46,899 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2025-02-06 10:40:46,900 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=241, Invalid=5619, Unknown=4, NotChecked=456, Total=6320 [2025-02-06 10:40:46,900 INFO L87 Difference]: Start difference. First operand 98 states and 103 transitions. Second operand has 64 states, 61 states have (on average 1.7868852459016393) internal successors, (109), 55 states have internal predecessors, (109), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-06 10:40:49,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:40:49,392 INFO L93 Difference]: Finished difference Result 98 states and 102 transitions. [2025-02-06 10:40:49,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2025-02-06 10:40:49,395 INFO L78 Accepts]: Start accepts. Automaton has has 64 states, 61 states have (on average 1.7868852459016393) internal successors, (109), 55 states have internal predecessors, (109), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 64 [2025-02-06 10:40:49,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:40:49,395 INFO L225 Difference]: With dead ends: 98 [2025-02-06 10:40:49,396 INFO L226 Difference]: Without dead ends: 98 [2025-02-06 10:40:49,398 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 109 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 2319 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=538, Invalid=11026, Unknown=4, NotChecked=642, Total=12210 [2025-02-06 10:40:49,399 INFO L435 NwaCegarLoop]: 59 mSDtfsCounter, 63 mSDsluCounter, 1955 mSDsCounter, 0 mSdLazyCounter, 2176 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 2014 SdHoareTripleChecker+Invalid, 2182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 2176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-02-06 10:40:49,399 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 2014 Invalid, 2182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 2176 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-02-06 10:40:49,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2025-02-06 10:40:49,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2025-02-06 10:40:49,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 78 states have (on average 1.2307692307692308) internal successors, (96), 92 states have internal predecessors, (96), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-06 10:40:49,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 102 transitions. [2025-02-06 10:40:49,402 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 102 transitions. Word has length 64 [2025-02-06 10:40:49,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:40:49,402 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 102 transitions. [2025-02-06 10:40:49,402 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 64 states, 61 states have (on average 1.7868852459016393) internal successors, (109), 55 states have internal predecessors, (109), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-06 10:40:49,403 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 102 transitions. [2025-02-06 10:40:49,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-02-06 10:40:49,403 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:40:49,403 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:40:49,410 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2025-02-06 10:40:49,603 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,SelfDestructingSolverStorable21 [2025-02-06 10:40:49,604 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 53 more)] === [2025-02-06 10:40:49,604 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:40:49,604 INFO L85 PathProgramCache]: Analyzing trace with hash -1970224864, now seen corresponding path program 1 times [2025-02-06 10:40:49,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:40:49,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [118618367] [2025-02-06 10:40:49,605 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:40:49,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:40:49,618 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-02-06 10:40:49,628 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-02-06 10:40:49,628 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:40:49,628 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:40:50,790 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 13 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:40:50,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:40:50,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [118618367] [2025-02-06 10:40:50,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [118618367] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:40:50,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [21422590] [2025-02-06 10:40:50,791 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:40:50,791 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:40:50,791 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:40:50,793 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:40:50,794 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:40:50,933 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-02-06 10:40:50,987 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-02-06 10:40:50,987 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:40:50,987 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:40:50,989 INFO L256 TraceCheckSpWp]: Trace formula consists of 491 conjuncts, 102 conjuncts are in the unsatisfiable core [2025-02-06 10:40:50,992 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:40:51,017 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:40:51,164 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-06 10:40:51,164 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:40:51,252 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:40:51,360 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-02-06 10:40:51,360 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 33 [2025-02-06 10:40:51,508 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 14 [2025-02-06 10:40:51,510 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-02-06 10:40:51,563 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 10:40:51,564 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 35 [2025-02-06 10:40:51,575 INFO L349 Elim1Store]: treesize reduction 8, result has 75.8 percent of original size [2025-02-06 10:40:51,575 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 34 [2025-02-06 10:40:52,256 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-06 10:40:52,259 INFO L349 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2025-02-06 10:40:52,260 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 67 treesize of output 57 [2025-02-06 10:40:52,393 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-06 10:40:52,394 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 111 treesize of output 68 [2025-02-06 10:40:52,401 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-06 10:40:52,402 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 103 treesize of output 76 [2025-02-06 10:40:52,518 INFO L349 Elim1Store]: treesize reduction 60, result has 20.0 percent of original size [2025-02-06 10:40:52,518 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 134 treesize of output 85 [2025-02-06 10:40:52,630 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-06 10:40:52,630 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 101 treesize of output 69 [2025-02-06 10:40:52,632 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-06 10:40:52,634 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 10:40:52,634 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 73 treesize of output 52 [2025-02-06 10:40:52,775 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2025-02-06 10:40:52,775 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 24 [2025-02-06 10:40:52,780 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 9 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:40:52,780 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:40:52,803 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2221 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_2221) (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) 1)) is different from false [2025-02-06 10:40:52,808 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2221 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_2221) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) 1)) is different from false [2025-02-06 10:40:53,249 WARN L851 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| Int) (v_ArrVal_2221 (Array Int Int))) (= (select |c_#valid| (select (let ((.cse0 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|))) (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| (select .cse0 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|))) |c_ULTIMATE.start_sll_circular_prepend_#t~mem14#1.base| v_ArrVal_2221) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse0 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) 1)) is different from false [2025-02-06 10:40:53,254 WARN L851 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| Int) (v_ArrVal_2221 (Array Int Int))) (= (select |c_#valid| (select (let ((.cse0 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|))) (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| (select .cse0 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|))) (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset|) v_ArrVal_2221) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse0 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) 1)) is different from false [2025-02-06 10:40:53,268 INFO L349 Elim1Store]: treesize reduction 5, result has 90.9 percent of original size [2025-02-06 10:40:53,268 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 59 treesize of output 58 [2025-02-06 10:40:53,272 WARN L851 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| Int) (v_ArrVal_2221 (Array Int Int))) (= |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| (select (let ((.cse0 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|))) (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| (select .cse0 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|))) (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset|) v_ArrVal_2221) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse0 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) is different from false [2025-02-06 10:40:53,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [21422590] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:40:53,758 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-06 10:40:53,758 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 36] total 61 [2025-02-06 10:40:53,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [541198114] [2025-02-06 10:40:53,758 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-06 10:40:53,759 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 62 states [2025-02-06 10:40:53,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:40:53,759 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2025-02-06 10:40:53,760 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=262, Invalid=4379, Unknown=71, NotChecked=690, Total=5402 [2025-02-06 10:40:53,760 INFO L87 Difference]: Start difference. First operand 98 states and 102 transitions. Second operand has 62 states, 58 states have (on average 1.8103448275862069) internal successors, (105), 54 states have internal predecessors, (105), 6 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-06 10:40:58,607 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-02-06 10:40:59,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:40:59,384 INFO L93 Difference]: Finished difference Result 104 states and 108 transitions. [2025-02-06 10:40:59,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2025-02-06 10:40:59,384 INFO L78 Accepts]: Start accepts. Automaton has has 62 states, 58 states have (on average 1.8103448275862069) internal successors, (105), 54 states have internal predecessors, (105), 6 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 65 [2025-02-06 10:40:59,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:40:59,385 INFO L225 Difference]: With dead ends: 104 [2025-02-06 10:40:59,385 INFO L226 Difference]: Without dead ends: 104 [2025-02-06 10:40:59,387 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 1376 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=422, Invalid=6836, Unknown=72, NotChecked=860, Total=8190 [2025-02-06 10:40:59,387 INFO L435 NwaCegarLoop]: 56 mSDtfsCounter, 107 mSDsluCounter, 1932 mSDsCounter, 0 mSdLazyCounter, 2351 mSolverCounterSat, 11 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 1988 SdHoareTripleChecker+Invalid, 2363 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 2351 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.0s IncrementalHoareTripleChecker+Time [2025-02-06 10:40:59,387 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 1988 Invalid, 2363 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 2351 Invalid, 1 Unknown, 0 Unchecked, 5.0s Time] [2025-02-06 10:40:59,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2025-02-06 10:40:59,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 100. [2025-02-06 10:40:59,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 80 states have (on average 1.2375) internal successors, (99), 94 states have internal predecessors, (99), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-06 10:40:59,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 105 transitions. [2025-02-06 10:40:59,389 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 105 transitions. Word has length 65 [2025-02-06 10:40:59,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:40:59,389 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 105 transitions. [2025-02-06 10:40:59,390 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 62 states, 58 states have (on average 1.8103448275862069) internal successors, (105), 54 states have internal predecessors, (105), 6 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-06 10:40:59,390 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 105 transitions. [2025-02-06 10:40:59,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-02-06 10:40:59,390 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:40:59,390 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:40:59,397 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2025-02-06 10:40:59,590 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,16 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:40:59,590 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 53 more)] === [2025-02-06 10:40:59,591 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:40:59,591 INFO L85 PathProgramCache]: Analyzing trace with hash -1970224863, now seen corresponding path program 1 times [2025-02-06 10:40:59,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:40:59,591 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [375360245] [2025-02-06 10:40:59,591 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:40:59,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:40:59,602 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-02-06 10:40:59,613 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-02-06 10:40:59,614 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:40:59,614 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:41:01,607 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 13 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:41:01,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:41:01,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [375360245] [2025-02-06 10:41:01,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [375360245] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:41:01,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [75667107] [2025-02-06 10:41:01,608 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:41:01,608 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:41:01,608 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:41:01,610 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:41:01,613 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:41:01,761 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-02-06 10:41:01,806 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-02-06 10:41:01,806 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:41:01,806 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:41:01,812 INFO L256 TraceCheckSpWp]: Trace formula consists of 491 conjuncts, 122 conjuncts are in the unsatisfiable core [2025-02-06 10:41:01,815 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:41:01,853 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:41:02,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 8 treesize of output 1 [2025-02-06 10:41:02,107 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-06 10:41:02,107 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:41:02,207 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:41:02,343 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-02-06 10:41:02,343 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 33 [2025-02-06 10:41:02,549 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2025-02-06 10:41:02,552 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2025-02-06 10:41:02,554 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-02-06 10:41:02,873 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2025-02-06 10:41:02,873 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 21 [2025-02-06 10:41:02,879 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 10:41:02,880 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 27 [2025-02-06 10:41:02,894 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2025-02-06 10:41:02,894 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2025-02-06 10:41:04,148 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-06 10:41:04,148 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-06 10:41:04,149 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 42 [2025-02-06 10:41:04,166 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2025-02-06 10:41:04,327 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-06 10:41:04,328 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-06 10:41:04,328 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 111 treesize of output 68 [2025-02-06 10:41:04,332 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-06 10:41:04,334 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-06 10:41:04,348 INFO L349 Elim1Store]: treesize reduction 33, result has 31.3 percent of original size [2025-02-06 10:41:04,348 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 136 treesize of output 112 [2025-02-06 10:41:04,487 INFO L349 Elim1Store]: treesize reduction 60, result has 20.0 percent of original size [2025-02-06 10:41:04,487 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 174 treesize of output 97 [2025-02-06 10:41:04,490 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 56 treesize of output 19 [2025-02-06 10:41:04,635 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-06 10:41:04,637 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 116 treesize of output 80 [2025-02-06 10:41:04,639 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-06 10:41:04,642 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 10:41:04,642 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 84 treesize of output 59 [2025-02-06 10:41:04,803 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2025-02-06 10:41:04,803 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 24 [2025-02-06 10:41:04,806 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2025-02-06 10:41:04,811 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 3 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:41:04,811 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:41:05,135 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse1 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (and (forall ((v_ArrVal_2387 (Array Int Int))) (<= 0 (+ 4 (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_2387) .cse0) .cse1)))) (forall ((v_ArrVal_2387 (Array Int Int)) (v_ArrVal_2386 (Array Int Int))) (<= (+ 8 (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_2387) .cse0) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_2386) .cse0) .cse1)))))) is different from false [2025-02-06 10:41:05,339 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 10:41:05,339 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 1 case distinctions, treesize of input 85 treesize of output 86 [2025-02-06 10:41:05,346 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 10:41:05,346 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 176 treesize of output 179 [2025-02-06 10:41:05,350 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 76 treesize of output 62 [2025-02-06 10:41:05,386 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 10:41:05,386 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 45 [2025-02-06 10:41:05,388 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-06 10:41:05,393 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 10:41:05,393 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 1 case distinctions, treesize of input 42 treesize of output 30 [2025-02-06 10:41:07,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [75667107] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:41:07,281 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-06 10:41:07,281 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 35] total 71 [2025-02-06 10:41:07,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653492899] [2025-02-06 10:41:07,282 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-06 10:41:07,282 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 72 states [2025-02-06 10:41:07,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:41:07,283 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2025-02-06 10:41:07,283 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=301, Invalid=7138, Unknown=47, NotChecked=170, Total=7656 [2025-02-06 10:41:07,284 INFO L87 Difference]: Start difference. First operand 100 states and 105 transitions. Second operand has 72 states, 68 states have (on average 1.6764705882352942) internal successors, (114), 63 states have internal predecessors, (114), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-06 10:41:10,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:41:10,843 INFO L93 Difference]: Finished difference Result 106 states and 110 transitions. [2025-02-06 10:41:10,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2025-02-06 10:41:10,843 INFO L78 Accepts]: Start accepts. Automaton has has 72 states, 68 states have (on average 1.6764705882352942) internal successors, (114), 63 states have internal predecessors, (114), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 65 [2025-02-06 10:41:10,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:41:10,844 INFO L225 Difference]: With dead ends: 106 [2025-02-06 10:41:10,844 INFO L226 Difference]: Without dead ends: 106 [2025-02-06 10:41:10,845 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 116 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 2622 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=571, Invalid=12952, Unknown=53, NotChecked=230, Total=13806 [2025-02-06 10:41:10,845 INFO L435 NwaCegarLoop]: 57 mSDtfsCounter, 65 mSDsluCounter, 2371 mSDsCounter, 0 mSdLazyCounter, 3067 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 2428 SdHoareTripleChecker+Invalid, 3071 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 3067 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-02-06 10:41:10,845 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 2428 Invalid, 3071 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 3067 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-02-06 10:41:10,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2025-02-06 10:41:10,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 102. [2025-02-06 10:41:10,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 82 states have (on average 1.2317073170731707) internal successors, (101), 96 states have internal predecessors, (101), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-06 10:41:10,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 107 transitions. [2025-02-06 10:41:10,847 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 107 transitions. Word has length 65 [2025-02-06 10:41:10,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:41:10,847 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 107 transitions. [2025-02-06 10:41:10,847 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 72 states, 68 states have (on average 1.6764705882352942) internal successors, (114), 63 states have internal predecessors, (114), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-06 10:41:10,848 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 107 transitions. [2025-02-06 10:41:10,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-02-06 10:41:10,848 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:41:10,848 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:41:10,855 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:41:11,052 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,17 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:41:11,052 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 53 more)] === [2025-02-06 10:41:11,052 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:41:11,052 INFO L85 PathProgramCache]: Analyzing trace with hash 1679119377, now seen corresponding path program 1 times [2025-02-06 10:41:11,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:41:11,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [306775477] [2025-02-06 10:41:11,052 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:41:11,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:41:11,072 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-02-06 10:41:11,088 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-02-06 10:41:11,088 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:41:11,089 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:41:13,618 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 11 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:41:13,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:41:13,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [306775477] [2025-02-06 10:41:13,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [306775477] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:41:13,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [339875426] [2025-02-06 10:41:13,618 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:41:13,618 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:41:13,618 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:41:13,621 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:41:13,622 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:41:13,762 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-02-06 10:41:13,807 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-02-06 10:41:13,807 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:41:13,807 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:41:13,810 INFO L256 TraceCheckSpWp]: Trace formula consists of 500 conjuncts, 138 conjuncts are in the unsatisfiable core [2025-02-06 10:41:13,814 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:41:13,864 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:41:14,114 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-02-06 10:41:14,215 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-06 10:41:14,215 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:41:14,332 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:41:14,344 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 25 treesize of output 13 [2025-02-06 10:41:14,490 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-02-06 10:41:14,490 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2025-02-06 10:41:14,497 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 26 treesize of output 13 [2025-02-06 10:41:14,744 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 14 [2025-02-06 10:41:14,748 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 3 [2025-02-06 10:41:14,753 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-02-06 10:41:14,951 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 10:41:14,952 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 35 [2025-02-06 10:41:15,006 INFO L349 Elim1Store]: treesize reduction 8, result has 75.8 percent of original size [2025-02-06 10:41:15,007 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 34 [2025-02-06 10:41:15,016 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 26 treesize of output 21 [2025-02-06 10:41:16,128 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2025-02-06 10:41:16,134 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-06 10:41:16,135 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-06 10:41:16,135 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 42 [2025-02-06 10:41:16,146 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 26 treesize of output 21 [2025-02-06 10:41:16,299 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-06 10:41:16,300 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 119 treesize of output 76 [2025-02-06 10:41:16,304 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-06 10:41:16,304 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 147 treesize of output 112 [2025-02-06 10:41:16,454 INFO L349 Elim1Store]: treesize reduction 84, result has 15.2 percent of original size [2025-02-06 10:41:16,454 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 326 treesize of output 221 [2025-02-06 10:41:16,464 INFO L349 Elim1Store]: treesize reduction 51, result has 15.0 percent of original size [2025-02-06 10:41:16,464 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 242 treesize of output 211 [2025-02-06 10:41:16,467 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 37 [2025-02-06 10:41:16,628 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-06 10:41:16,629 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 141 treesize of output 97 [2025-02-06 10:41:16,635 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-06 10:41:16,641 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 10:41:16,641 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 101 treesize of output 68 [2025-02-06 10:41:16,825 INFO L349 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2025-02-06 10:41:16,825 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 69 treesize of output 32 [2025-02-06 10:41:16,827 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 21 treesize of output 13 [2025-02-06 10:41:17,021 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 3 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:41:17,021 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:41:17,609 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2559 (Array Int Int)) (v_ArrVal_2561 (Array Int Int)) (v_ArrVal_2560 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse0 (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse1 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select (store |c_#memory_int#2| |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_2561) (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_2560) .cse0) .cse1)) (+ (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_2559) .cse0) .cse1) 4))))) is different from false [2025-02-06 10:41:17,622 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 10:41:17,622 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 93 treesize of output 94 [2025-02-06 10:41:17,630 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 10:41:17,631 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 192 treesize of output 195 [2025-02-06 10:41:17,636 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 84 treesize of output 70 [2025-02-06 10:41:28,567 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse7 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse13 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|))) (let ((.cse3 (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse13 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse9 (= |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| .cse7)) (.cse4 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|))) (let ((.cse5 (+ (select .cse4 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|) 4)) (.cse11 (not .cse9)) (.cse8 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse0 (= |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| .cse3)) (.cse1 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|)) (.cse2 (select .cse13 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|))) (and (or .cse0 (forall ((|ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| Int) (v_ArrVal_2554 (Array Int Int)) (v_ArrVal_2561 (Array Int Int)) (v_ArrVal_2560 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#2| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_2554) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_2561) (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse1 |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| .cse2)) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_2560) .cse3) (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse4 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) .cse5)))) (forall ((|ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| Int) (v_ArrVal_2554 (Array Int Int)) (v_ArrVal_2561 (Array Int Int)) (v_ArrVal_2560 (Array Int Int)) (v_arrayElimCell_216 Int)) (let ((.cse6 (select (store (store |c_#memory_int#2| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_2554) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_2561) (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse1 |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| .cse2)) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_2560) .cse3) (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse4 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse6 .cse5)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse6 (+ v_arrayElimCell_216 4)))))) (or (forall ((|ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| Int) (v_ArrVal_2554 (Array Int Int)) (v_ArrVal_2561 (Array Int Int)) (v_ArrVal_2560 (Array Int Int)) (v_arrayElimCell_215 Int)) (or (= (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse4 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#2| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_2554) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_2561) (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse1 |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| .cse2)) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_2560) .cse7) .cse8)) (+ v_arrayElimCell_215 4))))) .cse9) (forall ((|ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| Int)) (or (= (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse4 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|) (forall ((v_ArrVal_2554 (Array Int Int)) (v_ArrVal_2561 (Array Int Int)) (v_ArrVal_2560 (Array Int Int)) (v_arrayElimCell_216 Int) (v_arrayElimCell_215 Int)) (let ((.cse10 (select (store (store |c_#memory_int#2| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_2554) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_2561) (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse1 |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| .cse2)) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_2560) .cse7) .cse8)))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse10 (+ v_arrayElimCell_215 4))) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse10 (+ v_arrayElimCell_216 4)))))))) (or .cse11 (forall ((|ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| Int) (v_ArrVal_2554 (Array Int Int)) (v_ArrVal_2561 (Array Int Int)) (v_ArrVal_2560 (Array Int Int)) (v_arrayElimCell_216 Int)) (or (= (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse4 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#2| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_2554) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_2561) (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse1 |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| .cse2)) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_2560) .cse7) .cse8)) (+ v_arrayElimCell_216 4)))))) (or (and (or (forall ((|ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| Int) (v_ArrVal_2554 (Array Int Int)) (v_ArrVal_2561 (Array Int Int)) (v_ArrVal_2560 (Array Int Int)) (v_arrayElimCell_216 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#2| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_2554) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_2561) (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse1 |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| .cse2)) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_2560) .cse7) .cse8)) (+ v_arrayElimCell_216 4)))) .cse11) (forall ((|ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| Int) (v_ArrVal_2554 (Array Int Int)) (v_ArrVal_2561 (Array Int Int)) (v_ArrVal_2560 (Array Int Int)) (v_arrayElimCell_216 Int) (v_arrayElimCell_215 Int)) (let ((.cse12 (select (store (store |c_#memory_int#2| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_2554) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_2561) (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse1 |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| .cse2)) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_2560) .cse7) .cse8)))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse12 (+ v_arrayElimCell_215 4))) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse12 (+ v_arrayElimCell_216 4)))))) (or (forall ((|ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| Int) (v_ArrVal_2554 (Array Int Int)) (v_ArrVal_2561 (Array Int Int)) (v_ArrVal_2560 (Array Int Int)) (v_arrayElimCell_215 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#2| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_2554) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_2561) (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse1 |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| .cse2)) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_2560) .cse7) .cse8)) (+ v_arrayElimCell_215 4)))) .cse9)) (= .cse3 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|)) (or (not .cse0) (forall ((|ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| Int) (v_ArrVal_2554 (Array Int Int)) (v_ArrVal_2561 (Array Int Int)) (v_ArrVal_2560 (Array Int Int)) (v_arrayElimCell_216 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#2| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_2554) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_2561) (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse1 |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| .cse2)) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_2560) .cse3) (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse4 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ v_arrayElimCell_216 4))))))))) is different from false [2025-02-06 10:41:29,000 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse13 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|)) (.cse3 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse0 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|)) (.cse5 (= .cse3 |c_ULTIMATE.start_sll_circular_prepend_#t~mem14#1.base|)) (.cse7 (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse13 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse8 (= .cse7 |c_ULTIMATE.start_sll_circular_prepend_#t~mem14#1.base|)) (.cse6 (not .cse5)) (.cse4 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse9 (+ (select .cse0 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|) 4)) (.cse1 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|)) (.cse2 (select .cse13 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|))) (and (or (forall ((|ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| Int) (v_ArrVal_2554 (Array Int Int)) (v_ArrVal_2561 (Array Int Int)) (v_ArrVal_2560 (Array Int Int)) (v_arrayElimCell_215 Int)) (or (= (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse0 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|) (= (select (select (store (store |c_#memory_int#2| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_2554) |c_ULTIMATE.start_sll_circular_prepend_#t~mem14#1.base| v_ArrVal_2561) (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse1 |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| .cse2)) |c_ULTIMATE.start_sll_circular_prepend_#t~mem14#1.base| v_ArrVal_2560) .cse3) .cse4)) (+ v_arrayElimCell_215 4)) |c_ULTIMATE.start_main_~data~0#1|))) .cse5) (or .cse6 (forall ((|ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| Int) (v_ArrVal_2554 (Array Int Int)) (v_ArrVal_2561 (Array Int Int)) (v_ArrVal_2560 (Array Int Int)) (v_arrayElimCell_216 Int)) (or (= (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse0 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#2| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_2554) |c_ULTIMATE.start_sll_circular_prepend_#t~mem14#1.base| v_ArrVal_2561) (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse1 |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| .cse2)) |c_ULTIMATE.start_sll_circular_prepend_#t~mem14#1.base| v_ArrVal_2560) .cse3) .cse4)) (+ v_arrayElimCell_216 4)))))) (or (forall ((|ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| Int) (v_ArrVal_2554 (Array Int Int)) (v_ArrVal_2561 (Array Int Int)) (v_ArrVal_2560 (Array Int Int)) (v_arrayElimCell_216 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#2| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_2554) |c_ULTIMATE.start_sll_circular_prepend_#t~mem14#1.base| v_ArrVal_2561) (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse1 |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| .cse2)) |c_ULTIMATE.start_sll_circular_prepend_#t~mem14#1.base| v_ArrVal_2560) .cse7) (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse0 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ v_arrayElimCell_216 4)))) (not .cse8)) (or (forall ((|ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| Int) (v_ArrVal_2554 (Array Int Int)) (v_ArrVal_2561 (Array Int Int)) (v_ArrVal_2560 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#2| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_2554) |c_ULTIMATE.start_sll_circular_prepend_#t~mem14#1.base| v_ArrVal_2561) (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse1 |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| .cse2)) |c_ULTIMATE.start_sll_circular_prepend_#t~mem14#1.base| v_ArrVal_2560) .cse7) (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse0 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) .cse9))) .cse8) (forall ((|ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| Int)) (or (= (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse0 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|) (forall ((v_ArrVal_2554 (Array Int Int)) (v_ArrVal_2561 (Array Int Int)) (v_ArrVal_2560 (Array Int Int)) (v_arrayElimCell_216 Int) (v_arrayElimCell_215 Int)) (let ((.cse10 (select (store (store |c_#memory_int#2| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_2554) |c_ULTIMATE.start_sll_circular_prepend_#t~mem14#1.base| v_ArrVal_2561) (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse1 |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| .cse2)) |c_ULTIMATE.start_sll_circular_prepend_#t~mem14#1.base| v_ArrVal_2560) .cse3) .cse4)))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse10 (+ v_arrayElimCell_216 4))) (= (select .cse10 (+ v_arrayElimCell_215 4)) |c_ULTIMATE.start_main_~data~0#1|)))))) (or (and (or .cse5 (forall ((|ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| Int) (v_ArrVal_2554 (Array Int Int)) (v_ArrVal_2561 (Array Int Int)) (v_ArrVal_2560 (Array Int Int)) (v_arrayElimCell_215 Int)) (= (select (select (store (store |c_#memory_int#2| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_2554) |c_ULTIMATE.start_sll_circular_prepend_#t~mem14#1.base| v_ArrVal_2561) (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse1 |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| .cse2)) |c_ULTIMATE.start_sll_circular_prepend_#t~mem14#1.base| v_ArrVal_2560) .cse3) .cse4)) (+ v_arrayElimCell_215 4)) |c_ULTIMATE.start_main_~data~0#1|))) (or .cse6 (forall ((|ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| Int) (v_ArrVal_2554 (Array Int Int)) (v_ArrVal_2561 (Array Int Int)) (v_ArrVal_2560 (Array Int Int)) (v_arrayElimCell_216 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#2| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_2554) |c_ULTIMATE.start_sll_circular_prepend_#t~mem14#1.base| v_ArrVal_2561) (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse1 |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| .cse2)) |c_ULTIMATE.start_sll_circular_prepend_#t~mem14#1.base| v_ArrVal_2560) .cse3) .cse4)) (+ v_arrayElimCell_216 4))))) (forall ((|ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| Int) (v_ArrVal_2554 (Array Int Int)) (v_ArrVal_2561 (Array Int Int)) (v_ArrVal_2560 (Array Int Int)) (v_arrayElimCell_216 Int) (v_arrayElimCell_215 Int)) (let ((.cse11 (select (store (store |c_#memory_int#2| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_2554) |c_ULTIMATE.start_sll_circular_prepend_#t~mem14#1.base| v_ArrVal_2561) (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse1 |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| .cse2)) |c_ULTIMATE.start_sll_circular_prepend_#t~mem14#1.base| v_ArrVal_2560) .cse3) .cse4)))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse11 (+ v_arrayElimCell_216 4))) (= (select .cse11 (+ v_arrayElimCell_215 4)) |c_ULTIMATE.start_main_~data~0#1|))))) (= .cse7 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|)) (forall ((|ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| Int) (v_ArrVal_2554 (Array Int Int)) (v_ArrVal_2561 (Array Int Int)) (v_ArrVal_2560 (Array Int Int)) (v_arrayElimCell_216 Int)) (let ((.cse12 (select (store (store |c_#memory_int#2| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_2554) |c_ULTIMATE.start_sll_circular_prepend_#t~mem14#1.base| v_ArrVal_2561) (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse1 |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| .cse2)) |c_ULTIMATE.start_sll_circular_prepend_#t~mem14#1.base| v_ArrVal_2560) .cse7) (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse0 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse12 (+ v_arrayElimCell_216 4))) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse12 .cse9))))))))) is different from false [2025-02-06 10:41:29,104 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset|)) (.cse5 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse14 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|))) (let ((.cse7 (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse14 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse12 (= .cse2 .cse5)) (.cse0 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|))) (let ((.cse8 (+ (select .cse0 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|) 4)) (.cse10 (not .cse12)) (.cse6 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse3 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|)) (.cse4 (select .cse14 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (.cse9 (= .cse7 .cse2))) (and (forall ((|ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| Int)) (or (= (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse0 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|) (forall ((v_ArrVal_2554 (Array Int Int)) (v_ArrVal_2561 (Array Int Int)) (v_ArrVal_2560 (Array Int Int)) (v_arrayElimCell_216 Int) (v_arrayElimCell_215 Int)) (let ((.cse1 (select (store (store |c_#memory_int#2| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_2554) .cse2 v_ArrVal_2561) (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse3 |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| .cse4)) .cse2 v_ArrVal_2560) .cse5) .cse6)))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse1 (+ v_arrayElimCell_216 4))) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse1 (+ v_arrayElimCell_215 4)))))))) (or (forall ((|ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| Int) (v_ArrVal_2554 (Array Int Int)) (v_ArrVal_2561 (Array Int Int)) (v_ArrVal_2560 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#2| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_2554) .cse2 v_ArrVal_2561) (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse3 |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| .cse4)) .cse2 v_ArrVal_2560) .cse7) (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse0 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) .cse8))) .cse9) (or .cse10 (forall ((|ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| Int) (v_ArrVal_2554 (Array Int Int)) (v_ArrVal_2561 (Array Int Int)) (v_ArrVal_2560 (Array Int Int)) (v_arrayElimCell_216 Int)) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#2| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_2554) .cse2 v_ArrVal_2561) (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse3 |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| .cse4)) .cse2 v_ArrVal_2560) .cse5) .cse6)) (+ v_arrayElimCell_216 4))) (= (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse0 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)))) (forall ((|ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| Int) (v_ArrVal_2554 (Array Int Int)) (v_ArrVal_2561 (Array Int Int)) (v_ArrVal_2560 (Array Int Int)) (v_arrayElimCell_216 Int)) (let ((.cse11 (select (store (store |c_#memory_int#2| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_2554) .cse2 v_ArrVal_2561) (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse3 |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| .cse4)) .cse2 v_ArrVal_2560) .cse7) (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse0 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse11 (+ v_arrayElimCell_216 4))) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse11 .cse8))))) (or .cse12 (forall ((|ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| Int) (v_ArrVal_2554 (Array Int Int)) (v_ArrVal_2561 (Array Int Int)) (v_ArrVal_2560 (Array Int Int)) (v_arrayElimCell_215 Int)) (or (= (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse0 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#2| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_2554) .cse2 v_ArrVal_2561) (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse3 |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| .cse4)) .cse2 v_ArrVal_2560) .cse5) .cse6)) (+ v_arrayElimCell_215 4)))))) (or (and (forall ((|ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| Int) (v_ArrVal_2554 (Array Int Int)) (v_ArrVal_2561 (Array Int Int)) (v_ArrVal_2560 (Array Int Int)) (v_arrayElimCell_216 Int) (v_arrayElimCell_215 Int)) (let ((.cse13 (select (store (store |c_#memory_int#2| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_2554) .cse2 v_ArrVal_2561) (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse3 |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| .cse4)) .cse2 v_ArrVal_2560) .cse5) .cse6)))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse13 (+ v_arrayElimCell_216 4))) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse13 (+ v_arrayElimCell_215 4)))))) (or .cse12 (forall ((|ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| Int) (v_ArrVal_2554 (Array Int Int)) (v_ArrVal_2561 (Array Int Int)) (v_ArrVal_2560 (Array Int Int)) (v_arrayElimCell_215 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#2| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_2554) .cse2 v_ArrVal_2561) (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse3 |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| .cse4)) .cse2 v_ArrVal_2560) .cse5) .cse6)) (+ v_arrayElimCell_215 4))))) (or .cse10 (forall ((|ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| Int) (v_ArrVal_2554 (Array Int Int)) (v_ArrVal_2561 (Array Int Int)) (v_ArrVal_2560 (Array Int Int)) (v_arrayElimCell_216 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#2| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_2554) .cse2 v_ArrVal_2561) (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse3 |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| .cse4)) .cse2 v_ArrVal_2560) .cse5) .cse6)) (+ v_arrayElimCell_216 4)))))) (= .cse7 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|)) (or (forall ((|ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| Int) (v_ArrVal_2554 (Array Int Int)) (v_ArrVal_2561 (Array Int Int)) (v_ArrVal_2560 (Array Int Int)) (v_arrayElimCell_216 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#2| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_2554) .cse2 v_ArrVal_2561) (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse3 |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| .cse4)) .cse2 v_ArrVal_2560) .cse7) (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse0 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ v_arrayElimCell_216 4)))) (not .cse9)))))) is different from false [2025-02-06 10:41:29,570 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_#t~mem11#1.base|) |c_ULTIMATE.start_sll_circular_prepend_#t~mem11#1.offset|)) (.cse4 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse14 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|))) (let ((.cse10 (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse14 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse6 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|)) (.cse0 (= .cse1 .cse4))) (let ((.cse7 (not .cse0)) (.cse5 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|)) (.cse3 (select .cse14 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (.cse12 (+ (select .cse6 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|) 4)) (.cse13 (= .cse10 .cse1))) (and (or .cse0 (forall ((|ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| Int) (v_ArrVal_2554 (Array Int Int)) (v_ArrVal_2561 (Array Int Int)) (v_ArrVal_2560 (Array Int Int)) (v_arrayElimCell_215 Int)) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#2| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_2554) .cse1 v_ArrVal_2561) (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse2 |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| .cse3)) .cse1 v_ArrVal_2560) .cse4) .cse5)) (+ v_arrayElimCell_215 4))) (= (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse6 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)))) (or (forall ((|ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| Int) (v_ArrVal_2554 (Array Int Int)) (v_ArrVal_2561 (Array Int Int)) (v_ArrVal_2560 (Array Int Int)) (v_arrayElimCell_216 Int)) (or (= (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse6 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#2| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_2554) .cse1 v_ArrVal_2561) (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse2 |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| .cse3)) .cse1 v_ArrVal_2560) .cse4) .cse5)) (+ v_arrayElimCell_216 4))))) .cse7) (forall ((|ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| Int)) (or (= (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse6 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|) (forall ((v_ArrVal_2554 (Array Int Int)) (v_ArrVal_2561 (Array Int Int)) (v_ArrVal_2560 (Array Int Int)) (v_arrayElimCell_216 Int) (v_arrayElimCell_215 Int)) (let ((.cse8 (select (store (store |c_#memory_int#2| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_2554) .cse1 v_ArrVal_2561) (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse2 |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| .cse3)) .cse1 v_ArrVal_2560) .cse4) .cse5)))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse8 (+ v_arrayElimCell_215 4))) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse8 (+ v_arrayElimCell_216 4)))))))) (or (and (or .cse7 (forall ((|ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| Int) (v_ArrVal_2554 (Array Int Int)) (v_ArrVal_2561 (Array Int Int)) (v_ArrVal_2560 (Array Int Int)) (v_arrayElimCell_216 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#2| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_2554) .cse1 v_ArrVal_2561) (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse2 |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| .cse3)) .cse1 v_ArrVal_2560) .cse4) .cse5)) (+ v_arrayElimCell_216 4))))) (or .cse0 (forall ((|ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| Int) (v_ArrVal_2554 (Array Int Int)) (v_ArrVal_2561 (Array Int Int)) (v_ArrVal_2560 (Array Int Int)) (v_arrayElimCell_215 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#2| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_2554) .cse1 v_ArrVal_2561) (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse2 |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| .cse3)) .cse1 v_ArrVal_2560) .cse4) .cse5)) (+ v_arrayElimCell_215 4))))) (forall ((|ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| Int) (v_ArrVal_2554 (Array Int Int)) (v_ArrVal_2561 (Array Int Int)) (v_ArrVal_2560 (Array Int Int)) (v_arrayElimCell_216 Int) (v_arrayElimCell_215 Int)) (let ((.cse9 (select (store (store |c_#memory_int#2| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_2554) .cse1 v_ArrVal_2561) (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse2 |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| .cse3)) .cse1 v_ArrVal_2560) .cse4) .cse5)))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse9 (+ v_arrayElimCell_215 4))) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse9 (+ v_arrayElimCell_216 4))))))) (= .cse10 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|)) (forall ((|ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| Int) (v_ArrVal_2554 (Array Int Int)) (v_ArrVal_2561 (Array Int Int)) (v_ArrVal_2560 (Array Int Int)) (v_arrayElimCell_216 Int)) (let ((.cse11 (select (store (store |c_#memory_int#2| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_2554) .cse1 v_ArrVal_2561) (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse2 |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| .cse3)) .cse1 v_ArrVal_2560) .cse10) (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse6 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse11 (+ v_arrayElimCell_216 4))) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse11 .cse12))))) (or (forall ((|ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| Int) (v_ArrVal_2554 (Array Int Int)) (v_ArrVal_2561 (Array Int Int)) (v_ArrVal_2560 (Array Int Int)) (v_arrayElimCell_216 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#2| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_2554) .cse1 v_ArrVal_2561) (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse2 |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| .cse3)) .cse1 v_ArrVal_2560) .cse10) (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse6 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ v_arrayElimCell_216 4)))) (not .cse13)) (or (forall ((|ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| Int) (v_ArrVal_2554 (Array Int Int)) (v_ArrVal_2561 (Array Int Int)) (v_ArrVal_2560 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#2| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_2554) .cse1 v_ArrVal_2561) (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse2 |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| .cse3)) .cse1 v_ArrVal_2560) .cse10) (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse6 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) .cse12))) .cse13))))) is different from false