./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/list-simple/sll2n_insert_unequal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 551b0097 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/sll2n_insert_unequal.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 383c6933c6ab916f651364224af1d774f30e162ad506fd2f28fe7f76c4487ba3 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 22:43:49,861 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 22:43:49,922 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-01-09 22:43:49,929 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 22:43:49,929 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 22:43:49,949 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 22:43:49,950 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 22:43:49,950 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 22:43:49,951 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 22:43:49,951 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 22:43:49,951 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 22:43:49,951 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 22:43:49,951 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 22:43:49,951 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 22:43:49,951 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 22:43:49,952 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 22:43:49,952 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 22:43:49,952 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 22:43:49,952 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 22:43:49,952 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 22:43:49,953 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-01-09 22:43:49,953 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-01-09 22:43:49,953 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-01-09 22:43:49,953 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 22:43:49,953 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-09 22:43:49,953 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-09 22:43:49,953 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 22:43:49,953 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 22:43:49,953 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 22:43:49,953 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 22:43:49,953 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 22:43:49,953 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 22:43:49,953 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 22:43:49,953 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 22:43:49,953 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 22:43:49,953 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 22:43:49,953 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 22:43:49,953 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 22:43:49,953 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 22:43:49,954 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 22:43:49,954 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 22:43:49,954 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 22:43:49,954 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 22:43:49,954 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 22:43:49,954 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 22:43:49,954 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 22:43:49,954 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 22:43:49,954 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 -> 383c6933c6ab916f651364224af1d774f30e162ad506fd2f28fe7f76c4487ba3 [2025-01-09 22:43:50,233 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 22:43:50,246 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 22:43:50,248 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 22:43:50,249 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 22:43:50,250 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 22:43:50,251 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-simple/sll2n_insert_unequal.i [2025-01-09 22:43:51,508 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8f25de7d3/fcef9a87d0b54b5ca141924c5e27b7d4/FLAGb069f65ff [2025-01-09 22:43:51,771 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 22:43:51,772 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/list-simple/sll2n_insert_unequal.i [2025-01-09 22:43:51,782 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8f25de7d3/fcef9a87d0b54b5ca141924c5e27b7d4/FLAGb069f65ff [2025-01-09 22:43:52,063 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8f25de7d3/fcef9a87d0b54b5ca141924c5e27b7d4 [2025-01-09 22:43:52,065 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 22:43:52,067 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 22:43:52,068 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 22:43:52,068 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 22:43:52,071 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 22:43:52,071 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 10:43:52" (1/1) ... [2025-01-09 22:43:52,072 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@75466729 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:43:52, skipping insertion in model container [2025-01-09 22:43:52,072 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 10:43:52" (1/1) ... [2025-01-09 22:43:52,100 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 22:43:52,324 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 22:43:52,334 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 22:43:52,372 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 22:43:52,401 INFO L204 MainTranslator]: Completed translation [2025-01-09 22:43:52,402 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:43:52 WrapperNode [2025-01-09 22:43:52,402 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 22:43:52,403 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 22:43:52,403 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 22:43:52,403 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 22:43:52,408 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:43:52" (1/1) ... [2025-01-09 22:43:52,417 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:43:52" (1/1) ... [2025-01-09 22:43:52,443 INFO L138 Inliner]: procedures = 128, calls = 37, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 141 [2025-01-09 22:43:52,443 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 22:43:52,444 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 22:43:52,444 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 22:43:52,444 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 22:43:52,451 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:43:52" (1/1) ... [2025-01-09 22:43:52,452 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:43:52" (1/1) ... [2025-01-09 22:43:52,454 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:43:52" (1/1) ... [2025-01-09 22:43:52,471 INFO L175 MemorySlicer]: Split 20 memory accesses to 3 slices as follows [2, 13, 5]. 65 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 0, 1]. The 6 writes are split as follows [0, 5, 1]. [2025-01-09 22:43:52,471 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:43:52" (1/1) ... [2025-01-09 22:43:52,471 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:43:52" (1/1) ... [2025-01-09 22:43:52,479 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:43:52" (1/1) ... [2025-01-09 22:43:52,480 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:43:52" (1/1) ... [2025-01-09 22:43:52,482 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:43:52" (1/1) ... [2025-01-09 22:43:52,484 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:43:52" (1/1) ... [2025-01-09 22:43:52,485 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:43:52" (1/1) ... [2025-01-09 22:43:52,486 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 22:43:52,487 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 22:43:52,487 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 22:43:52,487 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 22:43:52,488 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:43:52" (1/1) ... [2025-01-09 22:43:52,492 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 22:43:52,502 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:43:52,516 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-01-09 22:43:52,526 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-01-09 22:43:52,552 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-09 22:43:52,553 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-09 22:43:52,553 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-01-09 22:43:52,553 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-09 22:43:52,553 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-09 22:43:52,553 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-01-09 22:43:52,553 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2025-01-09 22:43:52,553 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2025-01-09 22:43:52,553 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-09 22:43:52,553 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 22:43:52,553 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-01-09 22:43:52,554 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-01-09 22:43:52,554 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-01-09 22:43:52,554 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-01-09 22:43:52,554 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-01-09 22:43:52,554 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-01-09 22:43:52,554 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-01-09 22:43:52,554 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-09 22:43:52,554 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-01-09 22:43:52,554 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-01-09 22:43:52,554 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-01-09 22:43:52,554 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 22:43:52,554 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-09 22:43:52,554 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-09 22:43:52,554 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 22:43:52,554 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 22:43:52,692 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 22:43:52,694 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 22:43:52,970 INFO L? ?]: Removed 116 outVars from TransFormulas that were not future-live. [2025-01-09 22:43:52,971 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 22:43:52,989 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 22:43:52,993 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-09 22:43:52,993 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 10:43:52 BoogieIcfgContainer [2025-01-09 22:43:52,993 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 22:43:52,994 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 22:43:52,994 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 22:43:52,998 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 22:43:52,998 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 10:43:52" (1/3) ... [2025-01-09 22:43:52,998 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4023f81f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 10:43:52, skipping insertion in model container [2025-01-09 22:43:52,998 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:43:52" (2/3) ... [2025-01-09 22:43:52,998 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4023f81f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 10:43:52, skipping insertion in model container [2025-01-09 22:43:52,998 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 10:43:52" (3/3) ... [2025-01-09 22:43:52,999 INFO L128 eAbstractionObserver]: Analyzing ICFG sll2n_insert_unequal.i [2025-01-09 22:43:53,011 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 22:43:53,013 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG sll2n_insert_unequal.i that has 2 procedures, 100 locations, 1 initial locations, 5 loop locations, and 39 error locations. [2025-01-09 22:43:53,044 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 22:43:53,055 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;@23d39817, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 22:43:53,055 INFO L334 AbstractCegarLoop]: Starting to check reachability of 39 error locations. [2025-01-09 22:43:53,059 INFO L276 IsEmpty]: Start isEmpty. Operand has 100 states, 57 states have (on average 1.894736842105263) internal successors, (108), 96 states have internal predecessors, (108), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-09 22:43:53,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-01-09 22:43:53,063 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:43:53,064 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:43:53,064 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting node_createErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2025-01-09 22:43:53,068 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:43:53,069 INFO L85 PathProgramCache]: Analyzing trace with hash 1810549301, now seen corresponding path program 1 times [2025-01-09 22:43:53,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:43:53,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1101036642] [2025-01-09 22:43:53,076 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:43:53,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:43:53,149 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-01-09 22:43:53,165 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-09 22:43:53,165 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:43:53,166 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:43:53,284 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:43:53,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:43:53,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1101036642] [2025-01-09 22:43:53,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1101036642] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:43:53,285 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:43:53,285 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 22:43:53,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2019246789] [2025-01-09 22:43:53,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:43:53,289 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 22:43:53,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:43:53,305 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 22:43:53,306 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:43:53,308 INFO L87 Difference]: Start difference. First operand has 100 states, 57 states have (on average 1.894736842105263) internal successors, (108), 96 states have internal predecessors, (108), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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-01-09 22:43:53,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:43:53,430 INFO L93 Difference]: Finished difference Result 97 states and 107 transitions. [2025-01-09 22:43:53,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 22:43:53,433 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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 7 [2025-01-09 22:43:53,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:43:53,440 INFO L225 Difference]: With dead ends: 97 [2025-01-09 22:43:53,441 INFO L226 Difference]: Without dead ends: 94 [2025-01-09 22:43:53,447 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-01-09 22:43:53,449 INFO L435 NwaCegarLoop]: 100 mSDtfsCounter, 2 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:43:53,450 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 162 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:43:53,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2025-01-09 22:43:53,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2025-01-09 22:43:53,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 54 states have (on average 1.8333333333333333) internal successors, (99), 90 states have internal predecessors, (99), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-09 22:43:53,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 103 transitions. [2025-01-09 22:43:53,489 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 103 transitions. Word has length 7 [2025-01-09 22:43:53,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:43:53,490 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 103 transitions. [2025-01-09 22:43:53,490 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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-01-09 22:43:53,491 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 103 transitions. [2025-01-09 22:43:53,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-01-09 22:43:53,491 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:43:53,491 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:43:53,491 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 22:43:53,491 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting node_createErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2025-01-09 22:43:53,492 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:43:53,492 INFO L85 PathProgramCache]: Analyzing trace with hash 1810549302, now seen corresponding path program 1 times [2025-01-09 22:43:53,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:43:53,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909219833] [2025-01-09 22:43:53,492 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:43:53,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:43:53,507 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-01-09 22:43:53,516 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-09 22:43:53,519 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:43:53,519 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:43:53,626 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:43:53,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:43:53,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [909219833] [2025-01-09 22:43:53,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [909219833] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:43:53,626 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:43:53,626 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 22:43:53,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [593612075] [2025-01-09 22:43:53,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:43:53,627 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 22:43:53,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:43:53,627 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 22:43:53,628 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:43:53,628 INFO L87 Difference]: Start difference. First operand 94 states and 103 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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-01-09 22:43:53,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:43:53,705 INFO L93 Difference]: Finished difference Result 92 states and 101 transitions. [2025-01-09 22:43:53,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 22:43:53,706 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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 7 [2025-01-09 22:43:53,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:43:53,706 INFO L225 Difference]: With dead ends: 92 [2025-01-09 22:43:53,707 INFO L226 Difference]: Without dead ends: 92 [2025-01-09 22:43:53,707 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-01-09 22:43:53,708 INFO L435 NwaCegarLoop]: 97 mSDtfsCounter, 2 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:43:53,708 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 161 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:43:53,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2025-01-09 22:43:53,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2025-01-09 22:43:53,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 54 states have (on average 1.7962962962962963) internal successors, (97), 88 states have internal predecessors, (97), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-09 22:43:53,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 101 transitions. [2025-01-09 22:43:53,717 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 101 transitions. Word has length 7 [2025-01-09 22:43:53,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:43:53,717 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 101 transitions. [2025-01-09 22:43:53,717 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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-01-09 22:43:53,717 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 101 transitions. [2025-01-09 22:43:53,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-01-09 22:43:53,717 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:43:53,717 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:43:53,718 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 22:43:53,718 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2025-01-09 22:43:53,718 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:43:53,718 INFO L85 PathProgramCache]: Analyzing trace with hash -815028932, now seen corresponding path program 1 times [2025-01-09 22:43:53,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:43:53,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1361705681] [2025-01-09 22:43:53,718 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:43:53,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:43:53,731 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-01-09 22:43:53,752 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-01-09 22:43:53,754 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:43:53,754 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:43:53,833 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:43:53,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:43:53,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1361705681] [2025-01-09 22:43:53,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1361705681] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:43:53,833 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:43:53,834 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 22:43:53,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1688764398] [2025-01-09 22:43:53,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:43:53,834 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 22:43:53,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:43:53,835 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 22:43:53,835 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 22:43:53,835 INFO L87 Difference]: Start difference. First operand 92 states and 101 transitions. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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-01-09 22:43:53,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:43:53,971 INFO L93 Difference]: Finished difference Result 91 states and 100 transitions. [2025-01-09 22:43:53,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 22:43:53,972 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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-01-09 22:43:53,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:43:53,973 INFO L225 Difference]: With dead ends: 91 [2025-01-09 22:43:53,973 INFO L226 Difference]: Without dead ends: 91 [2025-01-09 22:43:53,974 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-01-09 22:43:53,974 INFO L435 NwaCegarLoop]: 92 mSDtfsCounter, 2 mSDsluCounter, 217 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 309 SdHoareTripleChecker+Invalid, 183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:43:53,974 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 309 Invalid, 183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:43:53,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2025-01-09 22:43:53,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2025-01-09 22:43:53,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 54 states have (on average 1.7777777777777777) internal successors, (96), 87 states have internal predecessors, (96), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-09 22:43:53,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 100 transitions. [2025-01-09 22:43:53,980 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 100 transitions. Word has length 13 [2025-01-09 22:43:53,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:43:53,981 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 100 transitions. [2025-01-09 22:43:53,982 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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-01-09 22:43:53,982 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 100 transitions. [2025-01-09 22:43:53,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-01-09 22:43:53,982 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:43:53,982 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:43:53,982 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 22:43:53,982 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2025-01-09 22:43:53,983 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:43:53,983 INFO L85 PathProgramCache]: Analyzing trace with hash -815028931, now seen corresponding path program 1 times [2025-01-09 22:43:53,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:43:53,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1115773930] [2025-01-09 22:43:53,983 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:43:53,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:43:53,994 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-01-09 22:43:54,005 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-01-09 22:43:54,005 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:43:54,005 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:43:54,151 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:43:54,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:43:54,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1115773930] [2025-01-09 22:43:54,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1115773930] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:43:54,151 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:43:54,151 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 22:43:54,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1844925137] [2025-01-09 22:43:54,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:43:54,153 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 22:43:54,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:43:54,153 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 22:43:54,153 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 22:43:54,153 INFO L87 Difference]: Start difference. First operand 91 states and 100 transitions. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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-01-09 22:43:54,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:43:54,265 INFO L93 Difference]: Finished difference Result 90 states and 99 transitions. [2025-01-09 22:43:54,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 22:43:54,266 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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-01-09 22:43:54,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:43:54,266 INFO L225 Difference]: With dead ends: 90 [2025-01-09 22:43:54,266 INFO L226 Difference]: Without dead ends: 90 [2025-01-09 22:43:54,266 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-01-09 22:43:54,267 INFO L435 NwaCegarLoop]: 92 mSDtfsCounter, 1 mSDsluCounter, 233 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 325 SdHoareTripleChecker+Invalid, 161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:43:54,267 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 325 Invalid, 161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:43:54,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2025-01-09 22:43:54,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2025-01-09 22:43:54,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 54 states have (on average 1.7592592592592593) internal successors, (95), 86 states have internal predecessors, (95), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-09 22:43:54,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 99 transitions. [2025-01-09 22:43:54,271 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 99 transitions. Word has length 13 [2025-01-09 22:43:54,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:43:54,271 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 99 transitions. [2025-01-09 22:43:54,271 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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-01-09 22:43:54,271 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 99 transitions. [2025-01-09 22:43:54,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-01-09 22:43:54,272 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:43:54,272 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:43:54,272 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 22:43:54,272 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2025-01-09 22:43:54,272 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:43:54,272 INFO L85 PathProgramCache]: Analyzing trace with hash 977598942, now seen corresponding path program 1 times [2025-01-09 22:43:54,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:43:54,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1622387119] [2025-01-09 22:43:54,272 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:43:54,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:43:54,284 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-01-09 22:43:54,292 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-01-09 22:43:54,292 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:43:54,293 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:43:54,342 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:43:54,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:43:54,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1622387119] [2025-01-09 22:43:54,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1622387119] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:43:54,343 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:43:54,343 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 22:43:54,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [574302314] [2025-01-09 22:43:54,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:43:54,344 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 22:43:54,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:43:54,344 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 22:43:54,344 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:43:54,344 INFO L87 Difference]: Start difference. First operand 90 states and 99 transitions. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-09 22:43:54,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:43:54,358 INFO L93 Difference]: Finished difference Result 95 states and 105 transitions. [2025-01-09 22:43:54,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 22:43:54,359 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2025-01-09 22:43:54,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:43:54,359 INFO L225 Difference]: With dead ends: 95 [2025-01-09 22:43:54,359 INFO L226 Difference]: Without dead ends: 95 [2025-01-09 22:43:54,360 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-01-09 22:43:54,360 INFO L435 NwaCegarLoop]: 97 mSDtfsCounter, 3 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 191 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-01-09 22:43:54,360 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 191 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:43:54,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2025-01-09 22:43:54,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 91. [2025-01-09 22:43:54,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 55 states have (on average 1.7454545454545454) internal successors, (96), 87 states have internal predecessors, (96), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-09 22:43:54,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 100 transitions. [2025-01-09 22:43:54,366 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 100 transitions. Word has length 14 [2025-01-09 22:43:54,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:43:54,366 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 100 transitions. [2025-01-09 22:43:54,367 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-09 22:43:54,367 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 100 transitions. [2025-01-09 22:43:54,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-01-09 22:43:54,367 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:43:54,367 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:43:54,367 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 22:43:54,368 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2025-01-09 22:43:54,368 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:43:54,368 INFO L85 PathProgramCache]: Analyzing trace with hash 151896908, now seen corresponding path program 1 times [2025-01-09 22:43:54,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:43:54,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1959050104] [2025-01-09 22:43:54,368 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:43:54,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:43:54,380 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-01-09 22:43:54,385 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-01-09 22:43:54,385 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:43:54,385 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:43:54,458 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-01-09 22:43:54,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:43:54,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1959050104] [2025-01-09 22:43:54,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1959050104] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:43:54,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [939318598] [2025-01-09 22:43:54,458 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:43:54,459 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:43:54,459 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:43:54,461 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-01-09 22:43:54,462 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-01-09 22:43:54,528 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-01-09 22:43:54,558 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-01-09 22:43:54,559 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:43:54,559 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:43:54,561 INFO L256 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-09 22:43:54,569 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:43:54,614 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:43:54,614 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:43:54,657 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-01-09 22:43:54,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [939318598] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 22:43:54,658 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 22:43:54,658 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2025-01-09 22:43:54,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616792947] [2025-01-09 22:43:54,658 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 22:43:54,658 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 22:43:54,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:43:54,660 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 22:43:54,660 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-01-09 22:43:54,660 INFO L87 Difference]: Start difference. First operand 91 states and 100 transitions. Second operand has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-01-09 22:43:54,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:43:54,676 INFO L93 Difference]: Finished difference Result 96 states and 106 transitions. [2025-01-09 22:43:54,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 22:43:54,678 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 26 [2025-01-09 22:43:54,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:43:54,679 INFO L225 Difference]: With dead ends: 96 [2025-01-09 22:43:54,679 INFO L226 Difference]: Without dead ends: 96 [2025-01-09 22:43:54,679 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 49 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-01-09 22:43:54,679 INFO L435 NwaCegarLoop]: 97 mSDtfsCounter, 3 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 22:43:54,679 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 190 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:43:54,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2025-01-09 22:43:54,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2025-01-09 22:43:54,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 59 states have (on average 1.694915254237288) internal successors, (100), 91 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-01-09 22:43:54,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 106 transitions. [2025-01-09 22:43:54,689 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 106 transitions. Word has length 26 [2025-01-09 22:43:54,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:43:54,690 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 106 transitions. [2025-01-09 22:43:54,690 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-01-09 22:43:54,690 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 106 transitions. [2025-01-09 22:43:54,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-01-09 22:43:54,690 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:43:54,690 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:43:54,699 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-09 22:43:54,891 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-01-09 22:43:54,891 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2025-01-09 22:43:54,892 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:43:54,892 INFO L85 PathProgramCache]: Analyzing trace with hash 1212012474, now seen corresponding path program 2 times [2025-01-09 22:43:54,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:43:54,892 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2077470922] [2025-01-09 22:43:54,892 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 22:43:54,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:43:54,916 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 38 statements into 2 equivalence classes. [2025-01-09 22:43:54,943 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 38 of 38 statements. [2025-01-09 22:43:54,943 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 22:43:54,943 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:43:55,448 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-01-09 22:43:55,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:43:55,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2077470922] [2025-01-09 22:43:55,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2077470922] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:43:55,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1611622388] [2025-01-09 22:43:55,448 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 22:43:55,449 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:43:55,449 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:43:55,451 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-01-09 22:43:55,452 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-01-09 22:43:55,537 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 38 statements into 2 equivalence classes. [2025-01-09 22:43:55,576 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 38 of 38 statements. [2025-01-09 22:43:55,576 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 22:43:55,576 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:43:55,578 INFO L256 TraceCheckSpWp]: Trace formula consists of 342 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-01-09 22:43:55,580 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:43:55,597 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-01-09 22:43:55,615 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-01-09 22:43:55,630 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-01-09 22:43:55,691 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 22:43:55,692 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-01-09 22:43:55,720 WARN L873 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| 1))) is different from true [2025-01-09 22:43:55,742 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2025-01-09 22:43:55,742 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2025-01-09 22:43:55,808 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2025-01-09 22:43:55,808 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2025-01-09 22:43:55,838 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 10 trivial. 15 not checked. [2025-01-09 22:43:55,838 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:43:56,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1611622388] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:43:56,212 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 22:43:56,213 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8] total 14 [2025-01-09 22:43:56,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [688753286] [2025-01-09 22:43:56,213 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 22:43:56,213 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-01-09 22:43:56,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:43:56,214 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-01-09 22:43:56,214 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=187, Unknown=2, NotChecked=58, Total=306 [2025-01-09 22:43:56,214 INFO L87 Difference]: Start difference. First operand 96 states and 106 transitions. Second operand has 15 states, 14 states have (on average 3.4285714285714284) internal successors, (48), 14 states have internal predecessors, (48), 3 states have call successors, (3), 1 states have call predecessors, (3), 5 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-01-09 22:43:56,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:43:56,486 INFO L93 Difference]: Finished difference Result 108 states and 119 transitions. [2025-01-09 22:43:56,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 22:43:56,488 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 3.4285714285714284) internal successors, (48), 14 states have internal predecessors, (48), 3 states have call successors, (3), 1 states have call predecessors, (3), 5 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 38 [2025-01-09 22:43:56,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:43:56,489 INFO L225 Difference]: With dead ends: 108 [2025-01-09 22:43:56,489 INFO L226 Difference]: Without dead ends: 108 [2025-01-09 22:43:56,489 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 57 SyntacticMatches, 7 SemanticMatches, 19 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=84, Invalid=264, Unknown=2, NotChecked=70, Total=420 [2025-01-09 22:43:56,489 INFO L435 NwaCegarLoop]: 53 mSDtfsCounter, 171 mSDsluCounter, 239 mSDsCounter, 0 mSdLazyCounter, 273 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 292 SdHoareTripleChecker+Invalid, 490 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 273 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 212 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 22:43:56,490 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [171 Valid, 292 Invalid, 490 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 273 Invalid, 0 Unknown, 212 Unchecked, 0.2s Time] [2025-01-09 22:43:56,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2025-01-09 22:43:56,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 92. [2025-01-09 22:43:56,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 59 states have (on average 1.6271186440677967) internal successors, (96), 87 states have internal predecessors, (96), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-09 22:43:56,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 102 transitions. [2025-01-09 22:43:56,498 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 102 transitions. Word has length 38 [2025-01-09 22:43:56,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:43:56,499 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 102 transitions. [2025-01-09 22:43:56,499 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 3.4285714285714284) internal successors, (48), 14 states have internal predecessors, (48), 3 states have call successors, (3), 1 states have call predecessors, (3), 5 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-01-09 22:43:56,499 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 102 transitions. [2025-01-09 22:43:56,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-01-09 22:43:56,499 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:43:56,499 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:43:56,508 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-01-09 22:43:56,700 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-01-09 22:43:56,700 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2025-01-09 22:43:56,704 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:43:56,704 INFO L85 PathProgramCache]: Analyzing trace with hash 1212012475, now seen corresponding path program 1 times [2025-01-09 22:43:56,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:43:56,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1531891742] [2025-01-09 22:43:56,704 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:43:56,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:43:56,718 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-01-09 22:43:56,732 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-01-09 22:43:56,735 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:43:56,735 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:43:57,287 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 22:43:57,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:43:57,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1531891742] [2025-01-09 22:43:57,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1531891742] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:43:57,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1872895464] [2025-01-09 22:43:57,288 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:43:57,288 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:43:57,288 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:43:57,290 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-01-09 22:43:57,292 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-01-09 22:43:57,368 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-01-09 22:43:57,402 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-01-09 22:43:57,402 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:43:57,402 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:43:57,404 INFO L256 TraceCheckSpWp]: Trace formula consists of 342 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-01-09 22:43:57,406 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:43:57,412 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-01-09 22:43:57,447 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-01-09 22:43:57,453 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-01-09 22:43:57,484 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 22:43:57,485 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-01-09 22:43:57,507 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-01-09 22:43:57,546 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 22:43:57,547 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-01-09 22:43:57,600 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-01-09 22:43:57,642 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 22:43:57,643 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-01-09 22:43:57,646 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-01-09 22:43:57,646 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 22:43:57,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1872895464] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:43:57,646 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 22:43:57,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [14] total 17 [2025-01-09 22:43:57,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [509870986] [2025-01-09 22:43:57,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:43:57,647 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 22:43:57,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:43:57,647 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 22:43:57,647 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=225, Unknown=1, NotChecked=30, Total=306 [2025-01-09 22:43:57,647 INFO L87 Difference]: Start difference. First operand 92 states and 102 transitions. Second operand has 7 states, 5 states have (on average 3.2) internal successors, (16), 6 states have internal predecessors, (16), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-09 22:43:57,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:43:57,737 INFO L93 Difference]: Finished difference Result 94 states and 104 transitions. [2025-01-09 22:43:57,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 22:43:57,737 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 3.2) internal successors, (16), 6 states have internal predecessors, (16), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 38 [2025-01-09 22:43:57,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:43:57,738 INFO L225 Difference]: With dead ends: 94 [2025-01-09 22:43:57,738 INFO L226 Difference]: Without dead ends: 94 [2025-01-09 22:43:57,738 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=254, Unknown=1, NotChecked=32, Total=342 [2025-01-09 22:43:57,739 INFO L435 NwaCegarLoop]: 78 mSDtfsCounter, 17 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 230 SdHoareTripleChecker+Invalid, 232 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 121 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:43:57,739 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 230 Invalid, 232 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 110 Invalid, 0 Unknown, 121 Unchecked, 0.1s Time] [2025-01-09 22:43:57,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2025-01-09 22:43:57,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 90. [2025-01-09 22:43:57,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 59 states have (on average 1.5932203389830508) internal successors, (94), 85 states have internal predecessors, (94), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-09 22:43:57,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 100 transitions. [2025-01-09 22:43:57,746 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 100 transitions. Word has length 38 [2025-01-09 22:43:57,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:43:57,746 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 100 transitions. [2025-01-09 22:43:57,747 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 3.2) internal successors, (16), 6 states have internal predecessors, (16), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-09 22:43:57,747 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 100 transitions. [2025-01-09 22:43:57,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-01-09 22:43:57,748 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:43:57,748 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:43:57,755 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-01-09 22:43:57,948 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-01-09 22:43:57,949 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2025-01-09 22:43:57,949 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:43:57,949 INFO L85 PathProgramCache]: Analyzing trace with hash -726452353, now seen corresponding path program 1 times [2025-01-09 22:43:57,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:43:57,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [199111843] [2025-01-09 22:43:57,949 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:43:57,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:43:57,965 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-01-09 22:43:57,976 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-01-09 22:43:57,977 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:43:57,977 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:43:58,254 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 21 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-09 22:43:58,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:43:58,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [199111843] [2025-01-09 22:43:58,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [199111843] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:43:58,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [41346201] [2025-01-09 22:43:58,255 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:43:58,255 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:43:58,255 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:43:58,257 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-01-09 22:43:58,259 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-01-09 22:43:58,332 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-01-09 22:43:58,456 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-01-09 22:43:58,456 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:43:58,457 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:43:58,459 INFO L256 TraceCheckSpWp]: Trace formula consists of 359 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-01-09 22:43:58,461 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:43:58,503 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-01-09 22:43:58,608 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-01-09 22:43:58,615 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-01-09 22:43:58,654 INFO L349 Elim1Store]: treesize reduction 32, result has 36.0 percent of original size [2025-01-09 22:43:58,654 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-01-09 22:43:58,662 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-01-09 22:43:58,665 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 6 not checked. [2025-01-09 22:43:58,666 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:43:58,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [41346201] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:43:58,719 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 22:43:58,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 21 [2025-01-09 22:43:58,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1615152044] [2025-01-09 22:43:58,719 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 22:43:58,719 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-01-09 22:43:58,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:43:58,720 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-01-09 22:43:58,720 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=406, Unknown=1, NotChecked=40, Total=506 [2025-01-09 22:43:58,720 INFO L87 Difference]: Start difference. First operand 90 states and 100 transitions. Second operand has 22 states, 21 states have (on average 2.4761904761904763) internal successors, (52), 19 states have internal predecessors, (52), 4 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2025-01-09 22:43:59,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:43:59,171 INFO L93 Difference]: Finished difference Result 107 states and 120 transitions. [2025-01-09 22:43:59,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-01-09 22:43:59,171 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 2.4761904761904763) internal successors, (52), 19 states have internal predecessors, (52), 4 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 41 [2025-01-09 22:43:59,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:43:59,172 INFO L225 Difference]: With dead ends: 107 [2025-01-09 22:43:59,172 INFO L226 Difference]: Without dead ends: 107 [2025-01-09 22:43:59,172 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=110, Invalid=763, Unknown=1, NotChecked=56, Total=930 [2025-01-09 22:43:59,173 INFO L435 NwaCegarLoop]: 69 mSDtfsCounter, 122 mSDsluCounter, 676 mSDsCounter, 0 mSdLazyCounter, 756 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 745 SdHoareTripleChecker+Invalid, 875 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 756 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 112 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 22:43:59,173 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 745 Invalid, 875 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 756 Invalid, 0 Unknown, 112 Unchecked, 0.3s Time] [2025-01-09 22:43:59,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2025-01-09 22:43:59,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 92. [2025-01-09 22:43:59,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 61 states have (on average 1.6065573770491803) internal successors, (98), 87 states have internal predecessors, (98), 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-01-09 22:43:59,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 104 transitions. [2025-01-09 22:43:59,176 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 104 transitions. Word has length 41 [2025-01-09 22:43:59,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:43:59,176 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 104 transitions. [2025-01-09 22:43:59,176 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 2.4761904761904763) internal successors, (52), 19 states have internal predecessors, (52), 4 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2025-01-09 22:43:59,176 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 104 transitions. [2025-01-09 22:43:59,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-01-09 22:43:59,177 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:43:59,177 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:43:59,184 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-01-09 22:43:59,381 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-01-09 22:43:59,381 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2025-01-09 22:43:59,381 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:43:59,381 INFO L85 PathProgramCache]: Analyzing trace with hash -726452352, now seen corresponding path program 1 times [2025-01-09 22:43:59,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:43:59,381 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1696576425] [2025-01-09 22:43:59,381 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:43:59,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:43:59,398 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-01-09 22:43:59,412 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-01-09 22:43:59,413 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:43:59,414 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:43:59,842 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 19 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-09 22:43:59,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:43:59,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1696576425] [2025-01-09 22:43:59,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1696576425] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:43:59,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1694076595] [2025-01-09 22:43:59,843 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:43:59,843 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:43:59,843 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:43:59,844 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-01-09 22:43:59,846 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-01-09 22:43:59,921 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-01-09 22:44:00,025 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-01-09 22:44:00,026 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:44:00,026 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:44:00,029 INFO L256 TraceCheckSpWp]: Trace formula consists of 359 conjuncts, 58 conjuncts are in the unsatisfiable core [2025-01-09 22:44:00,034 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:44:00,061 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-01-09 22:44:00,253 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-01-09 22:44:00,255 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-01-09 22:44:00,290 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_sll_insert_~head#1.base_BEFORE_CALL_5| Int)) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_insert_~head#1.base_BEFORE_CALL_5|) 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-01-09 22:44:00,325 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 22:44:00,326 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-01-09 22:44:00,337 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2025-01-09 22:44:00,337 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-01-09 22:44:00,382 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-01-09 22:44:00,390 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 6 not checked. [2025-01-09 22:44:00,390 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:44:00,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1694076595] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:44:00,536 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 22:44:00,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 26 [2025-01-09 22:44:00,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [656942099] [2025-01-09 22:44:00,537 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 22:44:00,537 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-01-09 22:44:00,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:44:00,537 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-01-09 22:44:00,538 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=786, Unknown=1, NotChecked=56, Total=930 [2025-01-09 22:44:00,538 INFO L87 Difference]: Start difference. First operand 92 states and 104 transitions. Second operand has 27 states, 24 states have (on average 2.3333333333333335) internal successors, (56), 23 states have internal predecessors, (56), 4 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2025-01-09 22:44:01,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:44:01,234 INFO L93 Difference]: Finished difference Result 114 states and 125 transitions. [2025-01-09 22:44:01,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-01-09 22:44:01,235 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 24 states have (on average 2.3333333333333335) internal successors, (56), 23 states have internal predecessors, (56), 4 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 41 [2025-01-09 22:44:01,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:44:01,235 INFO L225 Difference]: With dead ends: 114 [2025-01-09 22:44:01,235 INFO L226 Difference]: Without dead ends: 114 [2025-01-09 22:44:01,236 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 247 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=156, Invalid=1407, Unknown=1, NotChecked=76, Total=1640 [2025-01-09 22:44:01,236 INFO L435 NwaCegarLoop]: 71 mSDtfsCounter, 117 mSDsluCounter, 748 mSDsCounter, 0 mSdLazyCounter, 946 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 819 SdHoareTripleChecker+Invalid, 1065 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 946 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 115 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 22:44:01,236 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 819 Invalid, 1065 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 946 Invalid, 0 Unknown, 115 Unchecked, 0.5s Time] [2025-01-09 22:44:01,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2025-01-09 22:44:01,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 99. [2025-01-09 22:44:01,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 67 states have (on average 1.537313432835821) internal successors, (103), 93 states have internal predecessors, (103), 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-01-09 22:44:01,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 109 transitions. [2025-01-09 22:44:01,242 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 109 transitions. Word has length 41 [2025-01-09 22:44:01,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:44:01,242 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 109 transitions. [2025-01-09 22:44:01,242 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 24 states have (on average 2.3333333333333335) internal successors, (56), 23 states have internal predecessors, (56), 4 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2025-01-09 22:44:01,242 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 109 transitions. [2025-01-09 22:44:01,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-01-09 22:44:01,242 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:44:01,242 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:44:01,253 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-01-09 22:44:01,443 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-01-09 22:44:01,443 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2025-01-09 22:44:01,443 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:44:01,443 INFO L85 PathProgramCache]: Analyzing trace with hash -1045180443, now seen corresponding path program 1 times [2025-01-09 22:44:01,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:44:01,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1701463408] [2025-01-09 22:44:01,444 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:44:01,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:44:01,459 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-01-09 22:44:01,466 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-01-09 22:44:01,466 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:44:01,466 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:44:01,491 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-01-09 22:44:01,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:44:01,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1701463408] [2025-01-09 22:44:01,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1701463408] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:44:01,491 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:44:01,491 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 22:44:01,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91808698] [2025-01-09 22:44:01,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:44:01,493 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 22:44:01,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:44:01,493 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 22:44:01,493 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:44:01,493 INFO L87 Difference]: Start difference. First operand 99 states and 109 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 22:44:01,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:44:01,503 INFO L93 Difference]: Finished difference Result 100 states and 110 transitions. [2025-01-09 22:44:01,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 22:44:01,503 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 42 [2025-01-09 22:44:01,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:44:01,504 INFO L225 Difference]: With dead ends: 100 [2025-01-09 22:44:01,504 INFO L226 Difference]: Without dead ends: 100 [2025-01-09 22:44:01,504 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-01-09 22:44:01,505 INFO L435 NwaCegarLoop]: 92 mSDtfsCounter, 0 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 174 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-01-09 22:44:01,505 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 174 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:44:01,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2025-01-09 22:44:01,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2025-01-09 22:44:01,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 68 states have (on average 1.5294117647058822) internal successors, (104), 94 states have internal predecessors, (104), 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-01-09 22:44:01,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 110 transitions. [2025-01-09 22:44:01,507 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 110 transitions. Word has length 42 [2025-01-09 22:44:01,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:44:01,507 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 110 transitions. [2025-01-09 22:44:01,508 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 22:44:01,508 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 110 transitions. [2025-01-09 22:44:01,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-01-09 22:44:01,512 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:44:01,512 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:44:01,513 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 22:44:01,513 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2025-01-09 22:44:01,513 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:44:01,514 INFO L85 PathProgramCache]: Analyzing trace with hash 1959149610, now seen corresponding path program 1 times [2025-01-09 22:44:01,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:44:01,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1007639417] [2025-01-09 22:44:01,514 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:44:01,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:44:01,526 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-01-09 22:44:01,531 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-01-09 22:44:01,532 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:44:01,532 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:44:01,602 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-01-09 22:44:01,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:44:01,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1007639417] [2025-01-09 22:44:01,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1007639417] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:44:01,603 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:44:01,603 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 22:44:01,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [188634274] [2025-01-09 22:44:01,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:44:01,603 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 22:44:01,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:44:01,604 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 22:44:01,604 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 22:44:01,604 INFO L87 Difference]: Start difference. First operand 100 states and 110 transitions. Second operand has 6 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 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-01-09 22:44:01,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:44:01,683 INFO L93 Difference]: Finished difference Result 99 states and 109 transitions. [2025-01-09 22:44:01,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 22:44:01,683 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 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 43 [2025-01-09 22:44:01,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:44:01,684 INFO L225 Difference]: With dead ends: 99 [2025-01-09 22:44:01,684 INFO L226 Difference]: Without dead ends: 99 [2025-01-09 22:44:01,684 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-01-09 22:44:01,684 INFO L435 NwaCegarLoop]: 79 mSDtfsCounter, 10 mSDsluCounter, 199 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 278 SdHoareTripleChecker+Invalid, 161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:44:01,684 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 278 Invalid, 161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:44:01,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2025-01-09 22:44:01,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2025-01-09 22:44:01,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 68 states have (on average 1.5147058823529411) internal successors, (103), 93 states have internal predecessors, (103), 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-01-09 22:44:01,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 109 transitions. [2025-01-09 22:44:01,687 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 109 transitions. Word has length 43 [2025-01-09 22:44:01,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:44:01,687 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 109 transitions. [2025-01-09 22:44:01,687 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 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-01-09 22:44:01,687 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 109 transitions. [2025-01-09 22:44:01,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-01-09 22:44:01,688 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:44:01,688 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:44:01,688 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 22:44:01,688 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2025-01-09 22:44:01,688 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:44:01,689 INFO L85 PathProgramCache]: Analyzing trace with hash 1959149611, now seen corresponding path program 1 times [2025-01-09 22:44:01,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:44:01,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047948186] [2025-01-09 22:44:01,689 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:44:01,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:44:01,702 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-01-09 22:44:01,707 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-01-09 22:44:01,709 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:44:01,709 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:44:01,796 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-01-09 22:44:01,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:44:01,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2047948186] [2025-01-09 22:44:01,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2047948186] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:44:01,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1891020431] [2025-01-09 22:44:01,796 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:44:01,797 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:44:01,797 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:44:01,800 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-01-09 22:44:01,801 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-01-09 22:44:01,880 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-01-09 22:44:01,913 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-01-09 22:44:01,913 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:44:01,913 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:44:01,914 INFO L256 TraceCheckSpWp]: Trace formula consists of 375 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-09 22:44:01,916 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:44:01,950 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-01-09 22:44:01,950 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 22:44:01,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1891020431] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:44:01,951 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 22:44:01,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 5 [2025-01-09 22:44:01,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1821534204] [2025-01-09 22:44:01,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:44:01,951 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 22:44:01,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:44:01,951 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 22:44:01,952 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 22:44:01,952 INFO L87 Difference]: Start difference. First operand 99 states and 109 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-09 22:44:01,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:44:01,966 INFO L93 Difference]: Finished difference Result 102 states and 110 transitions. [2025-01-09 22:44:01,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 22:44:01,966 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 43 [2025-01-09 22:44:01,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:44:01,967 INFO L225 Difference]: With dead ends: 102 [2025-01-09 22:44:01,967 INFO L226 Difference]: Without dead ends: 102 [2025-01-09 22:44:01,967 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-01-09 22:44:01,967 INFO L435 NwaCegarLoop]: 87 mSDtfsCounter, 61 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 22:44:01,967 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 194 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:44:01,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2025-01-09 22:44:01,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 98. [2025-01-09 22:44:01,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 67 states have (on average 1.507462686567164) internal successors, (101), 92 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-01-09 22:44:01,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 107 transitions. [2025-01-09 22:44:01,969 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 107 transitions. Word has length 43 [2025-01-09 22:44:01,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:44:01,969 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 107 transitions. [2025-01-09 22:44:01,969 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-09 22:44:01,970 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 107 transitions. [2025-01-09 22:44:01,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-01-09 22:44:01,970 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:44:01,970 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:44:01,976 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-01-09 22:44:02,170 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-01-09 22:44:02,171 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2025-01-09 22:44:02,171 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:44:02,171 INFO L85 PathProgramCache]: Analyzing trace with hash 598156194, now seen corresponding path program 1 times [2025-01-09 22:44:02,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:44:02,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [917504314] [2025-01-09 22:44:02,171 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:44:02,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:44:02,183 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-01-09 22:44:02,189 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-01-09 22:44:02,189 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:44:02,189 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:44:02,262 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-01-09 22:44:02,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:44:02,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [917504314] [2025-01-09 22:44:02,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [917504314] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:44:02,262 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:44:02,262 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 22:44:02,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [241089635] [2025-01-09 22:44:02,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:44:02,263 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 22:44:02,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:44:02,263 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 22:44:02,263 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 22:44:02,263 INFO L87 Difference]: Start difference. First operand 98 states and 107 transitions. Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-09 22:44:02,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:44:02,283 INFO L93 Difference]: Finished difference Result 99 states and 106 transitions. [2025-01-09 22:44:02,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 22:44:02,283 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 44 [2025-01-09 22:44:02,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:44:02,284 INFO L225 Difference]: With dead ends: 99 [2025-01-09 22:44:02,284 INFO L226 Difference]: Without dead ends: 99 [2025-01-09 22:44:02,284 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-01-09 22:44:02,284 INFO L435 NwaCegarLoop]: 84 mSDtfsCounter, 54 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 273 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 22:44:02,285 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 273 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:44:02,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2025-01-09 22:44:02,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 95. [2025-01-09 22:44:02,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 66 states have (on average 1.4696969696969697) internal successors, (97), 89 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-01-09 22:44:02,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 103 transitions. [2025-01-09 22:44:02,287 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 103 transitions. Word has length 44 [2025-01-09 22:44:02,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:44:02,287 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 103 transitions. [2025-01-09 22:44:02,287 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-09 22:44:02,287 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 103 transitions. [2025-01-09 22:44:02,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-01-09 22:44:02,287 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:44:02,288 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:44:02,288 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 22:44:02,288 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2025-01-09 22:44:02,288 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:44:02,288 INFO L85 PathProgramCache]: Analyzing trace with hash 1362978850, now seen corresponding path program 1 times [2025-01-09 22:44:02,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:44:02,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796943770] [2025-01-09 22:44:02,288 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:44:02,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:44:02,298 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-01-09 22:44:02,302 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-01-09 22:44:02,302 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:44:02,303 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:44:02,331 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-01-09 22:44:02,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:44:02,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1796943770] [2025-01-09 22:44:02,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1796943770] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:44:02,332 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:44:02,332 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 22:44:02,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016587072] [2025-01-09 22:44:02,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:44:02,332 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 22:44:02,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:44:02,333 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 22:44:02,333 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 22:44:02,333 INFO L87 Difference]: Start difference. First operand 95 states and 103 transitions. Second operand has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 22:44:02,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:44:02,385 INFO L93 Difference]: Finished difference Result 94 states and 102 transitions. [2025-01-09 22:44:02,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 22:44:02,385 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 45 [2025-01-09 22:44:02,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:44:02,386 INFO L225 Difference]: With dead ends: 94 [2025-01-09 22:44:02,386 INFO L226 Difference]: Without dead ends: 94 [2025-01-09 22:44:02,386 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 22:44:02,386 INFO L435 NwaCegarLoop]: 84 mSDtfsCounter, 0 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 22:44:02,387 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 182 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:44:02,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2025-01-09 22:44:02,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2025-01-09 22:44:02,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 66 states have (on average 1.4545454545454546) internal successors, (96), 88 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-01-09 22:44:02,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 102 transitions. [2025-01-09 22:44:02,389 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 102 transitions. Word has length 45 [2025-01-09 22:44:02,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:44:02,389 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 102 transitions. [2025-01-09 22:44:02,389 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 22:44:02,389 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 102 transitions. [2025-01-09 22:44:02,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-01-09 22:44:02,390 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:44:02,390 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:44:02,390 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 22:44:02,390 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2025-01-09 22:44:02,390 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:44:02,390 INFO L85 PathProgramCache]: Analyzing trace with hash 1362978851, now seen corresponding path program 1 times [2025-01-09 22:44:02,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:44:02,391 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1632534021] [2025-01-09 22:44:02,391 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:44:02,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:44:02,401 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-01-09 22:44:02,407 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-01-09 22:44:02,407 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:44:02,407 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:44:02,604 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 11 proven. 7 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-01-09 22:44:02,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:44:02,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1632534021] [2025-01-09 22:44:02,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1632534021] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:44:02,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1176111064] [2025-01-09 22:44:02,604 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:44:02,604 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:44:02,605 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:44:02,606 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-01-09 22:44:02,608 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-01-09 22:44:02,695 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-01-09 22:44:02,779 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-01-09 22:44:02,779 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:44:02,779 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:44:02,781 INFO L256 TraceCheckSpWp]: Trace formula consists of 375 conjuncts, 35 conjuncts are in the unsatisfiable core [2025-01-09 22:44:02,783 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:44:02,826 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2025-01-09 22:44:02,874 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-01-09 22:44:02,874 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 22:44:02,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1176111064] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:44:02,874 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 22:44:02,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [12] total 16 [2025-01-09 22:44:02,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [352605731] [2025-01-09 22:44:02,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:44:02,875 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 22:44:02,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:44:02,875 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 22:44:02,875 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=239, Unknown=0, NotChecked=0, Total=272 [2025-01-09 22:44:02,876 INFO L87 Difference]: Start difference. First operand 94 states and 102 transitions. Second operand has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-09 22:44:02,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:44:02,959 INFO L93 Difference]: Finished difference Result 96 states and 104 transitions. [2025-01-09 22:44:02,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 22:44:02,960 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 45 [2025-01-09 22:44:02,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:44:02,960 INFO L225 Difference]: With dead ends: 96 [2025-01-09 22:44:02,960 INFO L226 Difference]: Without dead ends: 96 [2025-01-09 22:44:02,961 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=331, Unknown=0, NotChecked=0, Total=380 [2025-01-09 22:44:02,961 INFO L435 NwaCegarLoop]: 77 mSDtfsCounter, 67 mSDsluCounter, 214 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 291 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:44:02,961 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 291 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:44:02,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2025-01-09 22:44:02,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 93. [2025-01-09 22:44:02,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 66 states have (on average 1.4393939393939394) internal successors, (95), 87 states have internal predecessors, (95), 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-01-09 22:44:02,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 101 transitions. [2025-01-09 22:44:02,963 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 101 transitions. Word has length 45 [2025-01-09 22:44:02,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:44:02,963 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 101 transitions. [2025-01-09 22:44:02,963 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-09 22:44:02,963 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 101 transitions. [2025-01-09 22:44:02,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-01-09 22:44:02,965 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:44:02,965 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:44:02,973 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-01-09 22:44:03,166 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:44:03,166 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2025-01-09 22:44:03,167 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:44:03,167 INFO L85 PathProgramCache]: Analyzing trace with hash -697328594, now seen corresponding path program 1 times [2025-01-09 22:44:03,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:44:03,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1826550059] [2025-01-09 22:44:03,168 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:44:03,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:44:03,184 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-01-09 22:44:03,191 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-01-09 22:44:03,191 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:44:03,191 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:44:03,359 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-01-09 22:44:03,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:44:03,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1826550059] [2025-01-09 22:44:03,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1826550059] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:44:03,359 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:44:03,359 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 22:44:03,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [56838760] [2025-01-09 22:44:03,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:44:03,361 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 22:44:03,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:44:03,361 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 22:44:03,362 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 22:44:03,362 INFO L87 Difference]: Start difference. First operand 93 states and 101 transitions. Second operand has 6 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 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-01-09 22:44:03,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:44:03,471 INFO L93 Difference]: Finished difference Result 92 states and 100 transitions. [2025-01-09 22:44:03,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 22:44:03,472 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 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 46 [2025-01-09 22:44:03,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:44:03,473 INFO L225 Difference]: With dead ends: 92 [2025-01-09 22:44:03,473 INFO L226 Difference]: Without dead ends: 92 [2025-01-09 22:44:03,473 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-01-09 22:44:03,474 INFO L435 NwaCegarLoop]: 77 mSDtfsCounter, 2 mSDsluCounter, 201 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 278 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:44:03,474 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 278 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:44:03,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2025-01-09 22:44:03,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2025-01-09 22:44:03,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 66 states have (on average 1.4242424242424243) internal successors, (94), 86 states have internal predecessors, (94), 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-01-09 22:44:03,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 100 transitions. [2025-01-09 22:44:03,478 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 100 transitions. Word has length 46 [2025-01-09 22:44:03,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:44:03,478 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 100 transitions. [2025-01-09 22:44:03,478 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 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-01-09 22:44:03,479 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 100 transitions. [2025-01-09 22:44:03,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-01-09 22:44:03,479 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:44:03,479 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:44:03,479 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 22:44:03,480 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2025-01-09 22:44:03,480 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:44:03,480 INFO L85 PathProgramCache]: Analyzing trace with hash -117881009, now seen corresponding path program 1 times [2025-01-09 22:44:03,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:44:03,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2061450935] [2025-01-09 22:44:03,480 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:44:03,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:44:03,496 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-01-09 22:44:03,504 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-01-09 22:44:03,505 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:44:03,505 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:44:03,640 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2025-01-09 22:44:03,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:44:03,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2061450935] [2025-01-09 22:44:03,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2061450935] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:44:03,641 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:44:03,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 22:44:03,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767719609] [2025-01-09 22:44:03,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:44:03,641 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 22:44:03,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:44:03,642 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 22:44:03,642 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-01-09 22:44:03,642 INFO L87 Difference]: Start difference. First operand 92 states and 100 transitions. Second operand has 6 states, 4 states have (on average 6.5) internal successors, (26), 6 states have internal predecessors, (26), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-09 22:44:03,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:44:03,718 INFO L93 Difference]: Finished difference Result 92 states and 100 transitions. [2025-01-09 22:44:03,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 22:44:03,718 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 6.5) internal successors, (26), 6 states have internal predecessors, (26), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 48 [2025-01-09 22:44:03,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:44:03,719 INFO L225 Difference]: With dead ends: 92 [2025-01-09 22:44:03,719 INFO L226 Difference]: Without dead ends: 92 [2025-01-09 22:44:03,719 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2025-01-09 22:44:03,720 INFO L435 NwaCegarLoop]: 65 mSDtfsCounter, 62 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:44:03,720 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 154 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:44:03,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2025-01-09 22:44:03,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 90. [2025-01-09 22:44:03,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 66 states have (on average 1.393939393939394) internal successors, (92), 84 states have internal predecessors, (92), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-09 22:44:03,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 98 transitions. [2025-01-09 22:44:03,723 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 98 transitions. Word has length 48 [2025-01-09 22:44:03,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:44:03,724 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 98 transitions. [2025-01-09 22:44:03,724 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 6.5) internal successors, (26), 6 states have internal predecessors, (26), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-09 22:44:03,724 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 98 transitions. [2025-01-09 22:44:03,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-01-09 22:44:03,724 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:44:03,725 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:44:03,725 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-09 22:44:03,725 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2025-01-09 22:44:03,725 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:44:03,725 INFO L85 PathProgramCache]: Analyzing trace with hash 1490102634, now seen corresponding path program 1 times [2025-01-09 22:44:03,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:44:03,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [551755381] [2025-01-09 22:44:03,726 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:44:03,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:44:03,742 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-01-09 22:44:03,749 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-01-09 22:44:03,749 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:44:03,749 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:44:03,924 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-01-09 22:44:03,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:44:03,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [551755381] [2025-01-09 22:44:03,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [551755381] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:44:03,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1746588618] [2025-01-09 22:44:03,924 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:44:03,925 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:44:03,925 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:44:03,927 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-01-09 22:44:03,936 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-01-09 22:44:04,077 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-01-09 22:44:04,130 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-01-09 22:44:04,130 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:44:04,130 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:44:04,133 INFO L256 TraceCheckSpWp]: Trace formula consists of 423 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-01-09 22:44:04,135 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:44:04,341 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-01-09 22:44:04,379 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 19 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-09 22:44:04,380 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:44:04,510 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 12 proven. 6 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-01-09 22:44:04,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1746588618] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 22:44:04,510 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 22:44:04,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 13, 12] total 21 [2025-01-09 22:44:04,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1800216546] [2025-01-09 22:44:04,510 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 22:44:04,510 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-01-09 22:44:04,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:44:04,511 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-01-09 22:44:04,511 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=376, Unknown=0, NotChecked=0, Total=420 [2025-01-09 22:44:04,511 INFO L87 Difference]: Start difference. First operand 90 states and 98 transitions. Second operand has 21 states, 21 states have (on average 3.238095238095238) internal successors, (68), 20 states have internal predecessors, (68), 4 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2025-01-09 22:44:08,544 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-01-09 22:44:12,555 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-01-09 22:44:16,586 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-01-09 22:44:20,626 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-01-09 22:44:24,903 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-01-09 22:44:25,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:44:25,235 INFO L93 Difference]: Finished difference Result 151 states and 163 transitions. [2025-01-09 22:44:25,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-01-09 22:44:25,236 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 3.238095238095238) internal successors, (68), 20 states have internal predecessors, (68), 4 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) Word has length 51 [2025-01-09 22:44:25,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:44:25,236 INFO L225 Difference]: With dead ends: 151 [2025-01-09 22:44:25,236 INFO L226 Difference]: Without dead ends: 151 [2025-01-09 22:44:25,237 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 87 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=163, Invalid=1169, Unknown=0, NotChecked=0, Total=1332 [2025-01-09 22:44:25,237 INFO L435 NwaCegarLoop]: 90 mSDtfsCounter, 160 mSDsluCounter, 1367 mSDsCounter, 0 mSdLazyCounter, 971 mSolverCounterSat, 9 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 20.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 1457 SdHoareTripleChecker+Invalid, 985 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 971 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 20.5s IncrementalHoareTripleChecker+Time [2025-01-09 22:44:25,237 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [161 Valid, 1457 Invalid, 985 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 971 Invalid, 5 Unknown, 0 Unchecked, 20.5s Time] [2025-01-09 22:44:25,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2025-01-09 22:44:25,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 93. [2025-01-09 22:44:25,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 72 states have (on average 1.3333333333333333) internal successors, (96), 87 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-01-09 22:44:25,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 102 transitions. [2025-01-09 22:44:25,240 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 102 transitions. Word has length 51 [2025-01-09 22:44:25,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:44:25,240 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 102 transitions. [2025-01-09 22:44:25,240 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 3.238095238095238) internal successors, (68), 20 states have internal predecessors, (68), 4 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2025-01-09 22:44:25,240 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 102 transitions. [2025-01-09 22:44:25,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-01-09 22:44:25,241 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:44:25,241 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:44:25,248 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-01-09 22:44:25,445 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:44:25,445 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2025-01-09 22:44:25,445 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:44:25,445 INFO L85 PathProgramCache]: Analyzing trace with hash 1490102187, now seen corresponding path program 1 times [2025-01-09 22:44:25,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:44:25,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [588330053] [2025-01-09 22:44:25,445 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:44:25,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:44:25,458 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-01-09 22:44:25,469 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-01-09 22:44:25,470 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:44:25,470 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:44:25,814 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 11 proven. 7 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-01-09 22:44:25,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:44:25,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [588330053] [2025-01-09 22:44:25,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [588330053] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:44:25,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1633167084] [2025-01-09 22:44:25,815 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:44:25,815 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:44:25,815 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:44:25,817 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-01-09 22:44:25,821 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-01-09 22:44:25,930 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-01-09 22:44:25,968 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-01-09 22:44:25,968 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:44:25,968 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:44:25,975 INFO L256 TraceCheckSpWp]: Trace formula consists of 424 conjuncts, 44 conjuncts are in the unsatisfiable core [2025-01-09 22:44:25,978 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:44:25,988 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-01-09 22:44:25,991 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-01-09 22:44:26,225 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-01-09 22:44:26,233 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-01-09 22:44:26,287 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((|node_create_~temp~0#1.base| Int)) (and (= (store |c_old(#length)| |node_create_~temp~0#1.base| (select |c_#length| |node_create_~temp~0#1.base|)) |c_#length|) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) (exists ((|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_8| Int) (|v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_11| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_8|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_11|))) (and (<= 0 (+ .cse0 4)) (<= .cse0 0))))) is different from true [2025-01-09 22:44:26,347 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 22:44:26,348 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-01-09 22:44:26,357 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2025-01-09 22:44:26,358 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-01-09 22:44:26,511 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:44:26,511 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 40 treesize of output 32 [2025-01-09 22:44:26,518 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-01-09 22:44:26,573 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 6 not checked. [2025-01-09 22:44:26,573 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:44:26,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1633167084] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:44:26,788 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 22:44:26,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14] total 28 [2025-01-09 22:44:26,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [677346214] [2025-01-09 22:44:26,788 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 22:44:26,788 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-01-09 22:44:26,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:44:26,788 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-01-09 22:44:26,789 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=918, Unknown=1, NotChecked=60, Total=1056 [2025-01-09 22:44:26,789 INFO L87 Difference]: Start difference. First operand 93 states and 102 transitions. Second operand has 29 states, 27 states have (on average 2.5925925925925926) internal successors, (70), 26 states have internal predecessors, (70), 3 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2025-01-09 22:44:27,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:44:27,789 INFO L93 Difference]: Finished difference Result 124 states and 137 transitions. [2025-01-09 22:44:27,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-01-09 22:44:27,789 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 27 states have (on average 2.5925925925925926) internal successors, (70), 26 states have internal predecessors, (70), 3 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Word has length 51 [2025-01-09 22:44:27,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:44:27,790 INFO L225 Difference]: With dead ends: 124 [2025-01-09 22:44:27,791 INFO L226 Difference]: Without dead ends: 124 [2025-01-09 22:44:27,791 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 209 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=204, Invalid=2249, Unknown=1, NotChecked=96, Total=2550 [2025-01-09 22:44:27,791 INFO L435 NwaCegarLoop]: 76 mSDtfsCounter, 110 mSDsluCounter, 1310 mSDsCounter, 0 mSdLazyCounter, 1304 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 1386 SdHoareTripleChecker+Invalid, 1437 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1304 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 127 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 22:44:27,792 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 1386 Invalid, 1437 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1304 Invalid, 0 Unknown, 127 Unchecked, 0.6s Time] [2025-01-09 22:44:27,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2025-01-09 22:44:27,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 95. [2025-01-09 22:44:27,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 74 states have (on average 1.3108108108108107) internal successors, (97), 89 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-01-09 22:44:27,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 103 transitions. [2025-01-09 22:44:27,794 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 103 transitions. Word has length 51 [2025-01-09 22:44:27,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:44:27,794 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 103 transitions. [2025-01-09 22:44:27,794 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 27 states have (on average 2.5925925925925926) internal successors, (70), 26 states have internal predecessors, (70), 3 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2025-01-09 22:44:27,794 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 103 transitions. [2025-01-09 22:44:27,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-01-09 22:44:27,794 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:44:27,795 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:44:27,804 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-01-09 22:44:27,995 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:44:27,995 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2025-01-09 22:44:27,996 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:44:27,996 INFO L85 PathProgramCache]: Analyzing trace with hash 1756770826, now seen corresponding path program 1 times [2025-01-09 22:44:27,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:44:27,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2018725837] [2025-01-09 22:44:27,996 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:44:27,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:44:28,012 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-01-09 22:44:28,017 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-01-09 22:44:28,018 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:44:28,018 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:44:28,200 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-01-09 22:44:28,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:44:28,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2018725837] [2025-01-09 22:44:28,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2018725837] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:44:28,201 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:44:28,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 22:44:28,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2082783853] [2025-01-09 22:44:28,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:44:28,201 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 22:44:28,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:44:28,202 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 22:44:28,202 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-01-09 22:44:28,202 INFO L87 Difference]: Start difference. First operand 95 states and 103 transitions. Second operand has 10 states, 8 states have (on average 4.125) internal successors, (33), 9 states have internal predecessors, (33), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-09 22:44:28,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:44:28,398 INFO L93 Difference]: Finished difference Result 135 states and 149 transitions. [2025-01-09 22:44:28,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 22:44:28,399 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 4.125) internal successors, (33), 9 states have internal predecessors, (33), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 51 [2025-01-09 22:44:28,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:44:28,400 INFO L225 Difference]: With dead ends: 135 [2025-01-09 22:44:28,400 INFO L226 Difference]: Without dead ends: 135 [2025-01-09 22:44:28,400 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-01-09 22:44:28,400 INFO L435 NwaCegarLoop]: 63 mSDtfsCounter, 63 mSDsluCounter, 317 mSDsCounter, 0 mSdLazyCounter, 338 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 380 SdHoareTripleChecker+Invalid, 344 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 338 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 22:44:28,401 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 380 Invalid, 344 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 338 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 22:44:28,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2025-01-09 22:44:28,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 98. [2025-01-09 22:44:28,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 77 states have (on average 1.3376623376623376) internal successors, (103), 92 states have internal predecessors, (103), 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-01-09 22:44:28,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 109 transitions. [2025-01-09 22:44:28,405 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 109 transitions. Word has length 51 [2025-01-09 22:44:28,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:44:28,405 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 109 transitions. [2025-01-09 22:44:28,405 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 4.125) internal successors, (33), 9 states have internal predecessors, (33), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-09 22:44:28,405 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 109 transitions. [2025-01-09 22:44:28,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-01-09 22:44:28,406 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:44:28,406 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:44:28,406 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-01-09 22:44:28,406 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2025-01-09 22:44:28,406 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:44:28,406 INFO L85 PathProgramCache]: Analyzing trace with hash 1756770827, now seen corresponding path program 1 times [2025-01-09 22:44:28,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:44:28,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1493099702] [2025-01-09 22:44:28,406 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:44:28,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:44:28,418 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-01-09 22:44:28,424 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-01-09 22:44:28,424 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:44:28,425 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:44:28,649 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 11 proven. 7 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-01-09 22:44:28,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:44:28,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1493099702] [2025-01-09 22:44:28,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1493099702] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:44:28,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [205155841] [2025-01-09 22:44:28,650 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:44:28,650 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:44:28,650 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:44:28,652 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-01-09 22:44:28,654 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-01-09 22:44:28,805 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-01-09 22:44:28,852 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-01-09 22:44:28,852 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:44:28,852 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:44:28,855 INFO L256 TraceCheckSpWp]: Trace formula consists of 426 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-01-09 22:44:28,872 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:44:29,092 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 22:44:29,095 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:44:29,095 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 11 [2025-01-09 22:44:29,145 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 19 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-09 22:44:29,145 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:44:29,187 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:44:29,188 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 17 [2025-01-09 22:44:29,314 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 11 proven. 7 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-01-09 22:44:29,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [205155841] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 22:44:29,314 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 22:44:29,314 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14, 13] total 27 [2025-01-09 22:44:29,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2094923037] [2025-01-09 22:44:29,314 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 22:44:29,315 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-01-09 22:44:29,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:44:29,315 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-01-09 22:44:29,315 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=629, Unknown=0, NotChecked=0, Total=702 [2025-01-09 22:44:29,315 INFO L87 Difference]: Start difference. First operand 98 states and 109 transitions. Second operand has 27 states, 27 states have (on average 2.5555555555555554) internal successors, (69), 24 states have internal predecessors, (69), 5 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (8), 8 states have call predecessors, (8), 5 states have call successors, (8) [2025-01-09 22:44:33,342 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-01-09 22:44:37,356 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-01-09 22:44:41,385 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-01-09 22:44:45,437 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-01-09 22:44:45,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:44:45,705 INFO L93 Difference]: Finished difference Result 90 states and 97 transitions. [2025-01-09 22:44:45,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-01-09 22:44:45,705 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 2.5555555555555554) internal successors, (69), 24 states have internal predecessors, (69), 5 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (8), 8 states have call predecessors, (8), 5 states have call successors, (8) Word has length 51 [2025-01-09 22:44:45,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:44:45,705 INFO L225 Difference]: With dead ends: 90 [2025-01-09 22:44:45,705 INFO L226 Difference]: Without dead ends: 90 [2025-01-09 22:44:45,706 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 86 SyntacticMatches, 2 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 190 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=159, Invalid=1173, Unknown=0, NotChecked=0, Total=1332 [2025-01-09 22:44:45,707 INFO L435 NwaCegarLoop]: 67 mSDtfsCounter, 121 mSDsluCounter, 1307 mSDsCounter, 0 mSdLazyCounter, 520 mSolverCounterSat, 1 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 1374 SdHoareTripleChecker+Invalid, 525 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 520 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 16.2s IncrementalHoareTripleChecker+Time [2025-01-09 22:44:45,707 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 1374 Invalid, 525 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 520 Invalid, 4 Unknown, 0 Unchecked, 16.2s Time] [2025-01-09 22:44:45,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2025-01-09 22:44:45,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2025-01-09 22:44:45,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 69 states have (on average 1.318840579710145) internal successors, (91), 84 states have internal predecessors, (91), 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-01-09 22:44:45,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 97 transitions. [2025-01-09 22:44:45,713 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 97 transitions. Word has length 51 [2025-01-09 22:44:45,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:44:45,713 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 97 transitions. [2025-01-09 22:44:45,713 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 2.5555555555555554) internal successors, (69), 24 states have internal predecessors, (69), 5 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (8), 8 states have call predecessors, (8), 5 states have call successors, (8) [2025-01-09 22:44:45,713 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 97 transitions. [2025-01-09 22:44:45,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-01-09 22:44:45,714 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:44:45,714 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:44:45,726 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-01-09 22:44:45,914 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,11 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:44:45,914 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2025-01-09 22:44:45,915 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:44:45,915 INFO L85 PathProgramCache]: Analyzing trace with hash 850071197, now seen corresponding path program 1 times [2025-01-09 22:44:45,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:44:45,915 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [411873761] [2025-01-09 22:44:45,915 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:44:45,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:44:45,926 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-01-09 22:44:45,946 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-01-09 22:44:45,947 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:44:45,947 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:44:47,295 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 22 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:44:47,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:44:47,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [411873761] [2025-01-09 22:44:47,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [411873761] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:44:47,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [633912656] [2025-01-09 22:44:47,296 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:44:47,296 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:44:47,296 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:44:47,298 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-01-09 22:44:47,299 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-01-09 22:44:47,416 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-01-09 22:44:47,460 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-01-09 22:44:47,460 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:44:47,460 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:44:47,468 INFO L256 TraceCheckSpWp]: Trace formula consists of 451 conjuncts, 72 conjuncts are in the unsatisfiable core [2025-01-09 22:44:47,474 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:44:47,554 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-01-09 22:44:47,554 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-01-09 22:44:47,624 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-01-09 22:44:47,745 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 5 [2025-01-09 22:44:47,748 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2025-01-09 22:44:47,748 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 7 [2025-01-09 22:44:47,839 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 22:44:47,840 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2025-01-09 22:44:47,863 INFO L349 Elim1Store]: treesize reduction 116, result has 32.2 percent of original size [2025-01-09 22:44:47,863 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 40 treesize of output 69 [2025-01-09 22:44:48,041 INFO L349 Elim1Store]: treesize reduction 35, result has 48.5 percent of original size [2025-01-09 22:44:48,041 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 52 [2025-01-09 22:44:48,163 INFO L349 Elim1Store]: treesize reduction 25, result has 26.5 percent of original size [2025-01-09 22:44:48,163 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 84 treesize of output 74 [2025-01-09 22:44:48,187 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2025-01-09 22:44:48,300 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 134 treesize of output 98 [2025-01-09 22:44:48,303 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 97 treesize of output 73 [2025-01-09 22:44:48,471 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 43 [2025-01-09 22:44:48,771 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 28 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 22:44:48,771 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:44:48,917 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1825 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_1825) (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) 1)) is different from false [2025-01-09 22:44:49,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [633912656] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:44:49,238 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 22:44:49,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 25] total 53 [2025-01-09 22:44:49,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1698113141] [2025-01-09 22:44:49,238 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 22:44:49,239 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2025-01-09 22:44:49,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:44:49,239 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2025-01-09 22:44:49,240 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=218, Invalid=3406, Unknown=40, NotChecked=118, Total=3782 [2025-01-09 22:44:49,240 INFO L87 Difference]: Start difference. First operand 90 states and 97 transitions. Second operand has 54 states, 51 states have (on average 1.803921568627451) internal successors, (92), 47 states have internal predecessors, (92), 4 states have call successors, (4), 3 states have call predecessors, (4), 6 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2025-01-09 22:44:55,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:44:55,006 INFO L93 Difference]: Finished difference Result 105 states and 115 transitions. [2025-01-09 22:44:55,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2025-01-09 22:44:55,006 INFO L78 Accepts]: Start accepts. Automaton has has 54 states, 51 states have (on average 1.803921568627451) internal successors, (92), 47 states have internal predecessors, (92), 4 states have call successors, (4), 3 states have call predecessors, (4), 6 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 56 [2025-01-09 22:44:55,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:44:55,007 INFO L225 Difference]: With dead ends: 105 [2025-01-09 22:44:55,007 INFO L226 Difference]: Without dead ends: 105 [2025-01-09 22:44:55,008 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1403 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=467, Invalid=5976, Unknown=41, NotChecked=158, Total=6642 [2025-01-09 22:44:55,009 INFO L435 NwaCegarLoop]: 47 mSDtfsCounter, 207 mSDsluCounter, 928 mSDsCounter, 0 mSdLazyCounter, 1654 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 207 SdHoareTripleChecker+Valid, 975 SdHoareTripleChecker+Invalid, 1667 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 1654 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 22:44:55,009 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [207 Valid, 975 Invalid, 1667 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 1654 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 22:44:55,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2025-01-09 22:44:55,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 94. [2025-01-09 22:44:55,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 73 states have (on average 1.356164383561644) internal successors, (99), 88 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-01-09 22:44:55,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 105 transitions. [2025-01-09 22:44:55,011 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 105 transitions. Word has length 56 [2025-01-09 22:44:55,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:44:55,011 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 105 transitions. [2025-01-09 22:44:55,011 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 51 states have (on average 1.803921568627451) internal successors, (92), 47 states have internal predecessors, (92), 4 states have call successors, (4), 3 states have call predecessors, (4), 6 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2025-01-09 22:44:55,011 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 105 transitions. [2025-01-09 22:44:55,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-01-09 22:44:55,012 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:44:55,012 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:44:55,019 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-01-09 22:44:55,216 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,SelfDestructingSolverStorable22 [2025-01-09 22:44:55,216 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2025-01-09 22:44:55,216 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:44:55,216 INFO L85 PathProgramCache]: Analyzing trace with hash 850071198, now seen corresponding path program 1 times [2025-01-09 22:44:55,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:44:55,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [677204471] [2025-01-09 22:44:55,216 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:44:55,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:44:55,228 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-01-09 22:44:55,237 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-01-09 22:44:55,238 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:44:55,238 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:44:56,093 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 21 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-09 22:44:56,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:44:56,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [677204471] [2025-01-09 22:44:56,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [677204471] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:44:56,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [34017526] [2025-01-09 22:44:56,094 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:44:56,094 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:44:56,094 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:44:56,096 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-01-09 22:44:56,096 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-01-09 22:44:56,219 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-01-09 22:44:56,267 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-01-09 22:44:56,268 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:44:56,268 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:44:56,271 INFO L256 TraceCheckSpWp]: Trace formula consists of 451 conjuncts, 115 conjuncts are in the unsatisfiable core [2025-01-09 22:44:56,275 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:44:56,279 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-01-09 22:44:56,455 INFO L349 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2025-01-09 22:44:56,455 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 18 [2025-01-09 22:44:56,474 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-01-09 22:44:56,474 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2025-01-09 22:44:56,549 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-01-09 22:44:56,556 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-01-09 22:44:56,746 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 19 [2025-01-09 22:44:56,750 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-01-09 22:44:56,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-01-09 22:44:56,757 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-01-09 22:44:56,989 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2025-01-09 22:44:56,989 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 29 [2025-01-09 22:44:56,994 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2025-01-09 22:44:57,002 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 22:44:57,003 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 52 [2025-01-09 22:44:57,031 INFO L349 Elim1Store]: treesize reduction 8, result has 77.1 percent of original size [2025-01-09 22:44:57,031 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 36 [2025-01-09 22:44:57,038 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 37 treesize of output 35 [2025-01-09 22:44:57,260 INFO L349 Elim1Store]: treesize reduction 35, result has 48.5 percent of original size [2025-01-09 22:44:57,260 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 60 [2025-01-09 22:44:57,274 INFO L349 Elim1Store]: treesize reduction 51, result has 25.0 percent of original size [2025-01-09 22:44:57,274 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 30 [2025-01-09 22:44:57,403 INFO L349 Elim1Store]: treesize reduction 25, result has 26.5 percent of original size [2025-01-09 22:44:57,403 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 123 treesize of output 107 [2025-01-09 22:44:57,416 INFO L349 Elim1Store]: treesize reduction 25, result has 26.5 percent of original size [2025-01-09 22:44:57,417 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 138 treesize of output 140 [2025-01-09 22:44:57,444 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 7 treesize of output 3 [2025-01-09 22:44:57,483 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 7 treesize of output 3 [2025-01-09 22:45:01,736 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 263 treesize of output 191 [2025-01-09 22:45:01,740 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 190 treesize of output 146 [2025-01-09 22:45:02,028 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:45:02,028 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 143 treesize of output 89 [2025-01-09 22:45:02,036 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 9 treesize of output 3 [2025-01-09 22:45:02,504 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 23 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 22:45:02,504 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:45:09,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [34017526] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:45:09,482 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 22:45:09,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 29] total 49 [2025-01-09 22:45:09,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1413616225] [2025-01-09 22:45:09,482 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 22:45:09,482 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2025-01-09 22:45:09,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:45:09,482 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2025-01-09 22:45:09,483 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=161, Invalid=3308, Unknown=71, NotChecked=0, Total=3540 [2025-01-09 22:45:09,483 INFO L87 Difference]: Start difference. First operand 94 states and 105 transitions. Second operand has 50 states, 47 states have (on average 1.9574468085106382) internal successors, (92), 43 states have internal predecessors, (92), 4 states have call successors, (4), 4 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2025-01-09 22:45:13,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:45:13,231 INFO L93 Difference]: Finished difference Result 109 states and 118 transitions. [2025-01-09 22:45:13,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2025-01-09 22:45:13,232 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 47 states have (on average 1.9574468085106382) internal successors, (92), 43 states have internal predecessors, (92), 4 states have call successors, (4), 4 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) Word has length 56 [2025-01-09 22:45:13,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:45:13,232 INFO L225 Difference]: With dead ends: 109 [2025-01-09 22:45:13,232 INFO L226 Difference]: Without dead ends: 109 [2025-01-09 22:45:13,233 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1008 ImplicationChecksByTransitivity, 14.5s TimeCoverageRelationStatistics Valid=420, Invalid=6815, Unknown=75, NotChecked=0, Total=7310 [2025-01-09 22:45:13,234 INFO L435 NwaCegarLoop]: 49 mSDtfsCounter, 177 mSDsluCounter, 1418 mSDsCounter, 0 mSdLazyCounter, 2183 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 177 SdHoareTripleChecker+Valid, 1467 SdHoareTripleChecker+Invalid, 2193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 2183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-01-09 22:45:13,234 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [177 Valid, 1467 Invalid, 2193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 2183 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-01-09 22:45:13,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2025-01-09 22:45:13,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 98. [2025-01-09 22:45:13,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 77 states have (on average 1.3246753246753247) internal successors, (102), 92 states have internal predecessors, (102), 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-01-09 22:45:13,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 108 transitions. [2025-01-09 22:45:13,236 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 108 transitions. Word has length 56 [2025-01-09 22:45:13,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:45:13,236 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 108 transitions. [2025-01-09 22:45:13,236 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 47 states have (on average 1.9574468085106382) internal successors, (92), 43 states have internal predecessors, (92), 4 states have call successors, (4), 4 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2025-01-09 22:45:13,237 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 108 transitions. [2025-01-09 22:45:13,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-01-09 22:45:13,237 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:45:13,237 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:45:13,244 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-01-09 22:45:13,437 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,13 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:45:13,438 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2025-01-09 22:45:13,438 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:45:13,438 INFO L85 PathProgramCache]: Analyzing trace with hash 582402506, now seen corresponding path program 1 times [2025-01-09 22:45:13,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:45:13,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595819788] [2025-01-09 22:45:13,438 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:45:13,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:45:13,448 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-01-09 22:45:13,454 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-01-09 22:45:13,454 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:45:13,454 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:45:14,319 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 14 proven. 12 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-09 22:45:14,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:45:14,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [595819788] [2025-01-09 22:45:14,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [595819788] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:45:14,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [193986685] [2025-01-09 22:45:14,320 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:45:14,320 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:45:14,320 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:45:14,322 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-01-09 22:45:14,322 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-01-09 22:45:14,442 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-01-09 22:45:14,493 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-01-09 22:45:14,493 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:45:14,493 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:45:14,495 INFO L256 TraceCheckSpWp]: Trace formula consists of 445 conjuncts, 85 conjuncts are in the unsatisfiable core [2025-01-09 22:45:14,498 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:45:14,556 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-01-09 22:45:14,705 INFO L349 Elim1Store]: treesize reduction 21, result has 38.2 percent of original size [2025-01-09 22:45:14,705 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 17 [2025-01-09 22:45:14,919 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2025-01-09 22:45:14,923 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-01-09 22:45:15,162 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2025-01-09 22:45:15,162 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-01-09 22:45:15,170 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 33 [2025-01-09 22:45:15,694 INFO L349 Elim1Store]: treesize reduction 29, result has 37.0 percent of original size [2025-01-09 22:45:15,694 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 61 treesize of output 39 [2025-01-09 22:45:15,773 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 33 [2025-01-09 22:45:15,860 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 37 treesize of output 29 [2025-01-09 22:45:15,871 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:45:15,871 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 50 treesize of output 54 [2025-01-09 22:45:16,031 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 14 proven. 12 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-09 22:45:16,032 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:45:16,342 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~ptr~0#1.offset_33| Int) (v_ArrVal_2135 (Array Int Int)) (v_ArrVal_2134 (Array Int Int))) (or (< (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) |v_ULTIMATE.start_main_~ptr~0#1.offset_33|) (< |v_ULTIMATE.start_main_~ptr~0#1.offset_33| 0) (not (= (let ((.cse0 (+ |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.offset| 4))) (store (select |c_#memory_int#1| |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base|) .cse0 (select v_ArrVal_2134 .cse0))) v_ArrVal_2134)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base| v_ArrVal_2134) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_2135) (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) |v_ULTIMATE.start_main_~ptr~0#1.offset_33|)))) is different from false [2025-01-09 22:45:16,391 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~ptr~0#1.offset_33| Int) (|v_ULTIMATE.start_sll_insert_~snd_to_last~0#1.offset_38| Int) (v_ArrVal_2135 (Array Int Int)) (v_ArrVal_2134 (Array Int Int))) (or (< (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) |v_ULTIMATE.start_main_~ptr~0#1.offset_33|) (< |v_ULTIMATE.start_main_~ptr~0#1.offset_33| 0) (not (= v_ArrVal_2134 (let ((.cse0 (+ |v_ULTIMATE.start_sll_insert_~snd_to_last~0#1.offset_38| 4))) (store (select |c_#memory_int#1| |c_ULTIMATE.start_sll_insert_~last~0#1.base|) .cse0 (select v_ArrVal_2134 .cse0))))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_insert_~last~0#1.base| v_ArrVal_2134) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_2135) (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) |v_ULTIMATE.start_main_~ptr~0#1.offset_33|)) (< |v_ULTIMATE.start_sll_insert_~snd_to_last~0#1.offset_38| |c_ULTIMATE.start_sll_insert_~last~0#1.offset|))) is different from false [2025-01-09 22:45:16,405 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~ptr~0#1.offset_33| Int) (|v_ULTIMATE.start_sll_insert_~snd_to_last~0#1.offset_38| Int) (v_ArrVal_2135 (Array Int Int)) (v_ArrVal_2134 (Array Int Int))) (or (< (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) |v_ULTIMATE.start_main_~ptr~0#1.offset_33|) (< |v_ULTIMATE.start_main_~ptr~0#1.offset_33| 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_insert_#t~mem8#1.base| v_ArrVal_2134) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_2135) (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) |v_ULTIMATE.start_main_~ptr~0#1.offset_33|)) (< |v_ULTIMATE.start_sll_insert_~snd_to_last~0#1.offset_38| |c_ULTIMATE.start_sll_insert_#t~mem8#1.offset|) (not (= (let ((.cse0 (+ |v_ULTIMATE.start_sll_insert_~snd_to_last~0#1.offset_38| 4))) (store (select |c_#memory_int#1| |c_ULTIMATE.start_sll_insert_#t~mem8#1.base|) .cse0 (select v_ArrVal_2134 .cse0))) v_ArrVal_2134)))) is different from false [2025-01-09 22:45:16,420 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~ptr~0#1.offset_33| Int) (|v_ULTIMATE.start_sll_insert_~snd_to_last~0#1.offset_38| Int) (v_ArrVal_2135 (Array Int Int)) (v_ArrVal_2134 (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|))) (or (< (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) |v_ULTIMATE.start_main_~ptr~0#1.offset_33|) (< |v_ULTIMATE.start_main_~ptr~0#1.offset_33| 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#1| .cse0 v_ArrVal_2134) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_2135) (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) |v_ULTIMATE.start_main_~ptr~0#1.offset_33|)) (not (= (let ((.cse1 (+ |v_ULTIMATE.start_sll_insert_~snd_to_last~0#1.offset_38| 4))) (store (select |c_#memory_int#1| .cse0) .cse1 (select v_ArrVal_2134 .cse1))) v_ArrVal_2134)) (< |v_ULTIMATE.start_sll_insert_~snd_to_last~0#1.offset_38| (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|))))) is different from false [2025-01-09 22:45:16,434 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~ptr~0#1.offset_33| Int) (|v_ULTIMATE.start_sll_insert_~snd_to_last~0#1.offset_38| Int) (v_ArrVal_2135 (Array Int Int)) (v_ArrVal_2134 (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|))) (or (< (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) |v_ULTIMATE.start_main_~ptr~0#1.offset_33|) (< |v_ULTIMATE.start_main_~ptr~0#1.offset_33| 0) (not (= (let ((.cse1 (+ |v_ULTIMATE.start_sll_insert_~snd_to_last~0#1.offset_38| 4))) (store (select |c_#memory_int#1| .cse0) .cse1 (select v_ArrVal_2134 .cse1))) v_ArrVal_2134)) (< |v_ULTIMATE.start_sll_insert_~snd_to_last~0#1.offset_38| (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#1| .cse0 v_ArrVal_2134) |c_ULTIMATE.start_sll_insert_#t~ret7#1.base| v_ArrVal_2135) (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) |v_ULTIMATE.start_main_~ptr~0#1.offset_33|))))) is different from false [2025-01-09 22:45:16,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [193986685] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:45:16,563 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 22:45:16,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 49 [2025-01-09 22:45:16,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1519162354] [2025-01-09 22:45:16,563 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 22:45:16,564 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2025-01-09 22:45:16,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:45:16,564 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2025-01-09 22:45:16,565 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=2701, Unknown=6, NotChecked=540, Total=3422 [2025-01-09 22:45:16,565 INFO L87 Difference]: Start difference. First operand 98 states and 108 transitions. Second operand has 49 states, 47 states have (on average 1.872340425531915) internal successors, (88), 43 states have internal predecessors, (88), 4 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2025-01-09 22:45:18,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:45:18,377 INFO L93 Difference]: Finished difference Result 102 states and 110 transitions. [2025-01-09 22:45:18,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2025-01-09 22:45:18,377 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 47 states have (on average 1.872340425531915) internal successors, (88), 43 states have internal predecessors, (88), 4 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 57 [2025-01-09 22:45:18,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:45:18,378 INFO L225 Difference]: With dead ends: 102 [2025-01-09 22:45:18,378 INFO L226 Difference]: Without dead ends: 102 [2025-01-09 22:45:18,379 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 754 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=393, Invalid=5627, Unknown=6, NotChecked=780, Total=6806 [2025-01-09 22:45:18,379 INFO L435 NwaCegarLoop]: 51 mSDtfsCounter, 103 mSDsluCounter, 1404 mSDsCounter, 0 mSdLazyCounter, 1494 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 1455 SdHoareTripleChecker+Invalid, 1506 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 1494 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 22:45:18,379 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 1455 Invalid, 1506 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 1494 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 22:45:18,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2025-01-09 22:45:18,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 98. [2025-01-09 22:45:18,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 77 states have (on average 1.3116883116883118) internal successors, (101), 92 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-01-09 22:45:18,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 107 transitions. [2025-01-09 22:45:18,382 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 107 transitions. Word has length 57 [2025-01-09 22:45:18,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:45:18,382 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 107 transitions. [2025-01-09 22:45:18,382 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 47 states have (on average 1.872340425531915) internal successors, (88), 43 states have internal predecessors, (88), 4 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2025-01-09 22:45:18,382 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 107 transitions. [2025-01-09 22:45:18,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-01-09 22:45:18,382 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:45:18,382 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:45:18,391 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2025-01-09 22:45:18,583 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,14 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:45:18,583 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2025-01-09 22:45:18,583 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:45:18,583 INFO L85 PathProgramCache]: Analyzing trace with hash -1288742382, now seen corresponding path program 1 times [2025-01-09 22:45:18,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:45:18,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [95552360] [2025-01-09 22:45:18,584 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:45:18,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:45:18,595 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-01-09 22:45:18,605 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-01-09 22:45:18,606 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:45:18,606 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:45:19,554 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 21 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-09 22:45:19,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:45:19,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [95552360] [2025-01-09 22:45:19,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [95552360] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:45:19,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1418653310] [2025-01-09 22:45:19,554 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:45:19,554 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:45:19,554 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:45:19,557 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-01-09 22:45:19,557 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-01-09 22:45:19,678 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-01-09 22:45:19,716 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-01-09 22:45:19,716 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:45:19,716 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:45:19,719 INFO L256 TraceCheckSpWp]: Trace formula consists of 460 conjuncts, 99 conjuncts are in the unsatisfiable core [2025-01-09 22:45:19,722 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:45:19,748 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-01-09 22:45:19,939 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-01-09 22:45:19,954 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-01-09 22:45:19,974 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2025-01-09 22:45:19,974 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-01-09 22:45:20,240 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 25 treesize of output 17 [2025-01-09 22:45:20,247 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 25 treesize of output 17 [2025-01-09 22:45:20,252 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-01-09 22:45:20,314 INFO L349 Elim1Store]: treesize reduction 37, result has 19.6 percent of original size [2025-01-09 22:45:20,314 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 173 treesize of output 130 [2025-01-09 22:45:20,318 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 79 treesize of output 25 [2025-01-09 22:45:20,323 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 54 treesize of output 21 [2025-01-09 22:45:20,386 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 48 [2025-01-09 22:45:20,388 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 36 [2025-01-09 22:45:20,473 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 33 treesize of output 15 [2025-01-09 22:45:20,476 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 9 treesize of output 3 [2025-01-09 22:45:20,587 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-01-09 22:45:20,588 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 19 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-09 22:45:20,588 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:45:20,984 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~ptr~0#1.offset_34| Int) (v_ArrVal_2285 (Array Int Int)) (v_ArrVal_2284 (Array Int Int)) (v_ArrVal_2283 (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse1 (+ (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (or (< (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_2285) .cse0) .cse1) |v_ULTIMATE.start_main_~ptr~0#1.offset_34|) (< |v_ULTIMATE.start_main_~ptr~0#1.offset_34| 0) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_2284) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_2283) .cse0) .cse1)) |v_ULTIMATE.start_main_~ptr~0#1.offset_34|)) (not (= (let ((.cse2 (+ |c_ULTIMATE.start_sll_insert_~new_node~0#1.offset| 4))) (store (select |c_#memory_int#1| |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) .cse2 (select v_ArrVal_2284 .cse2))) v_ArrVal_2284))))) is different from false [2025-01-09 22:45:20,993 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:45:20,993 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 40 treesize of output 41 [2025-01-09 22:45:21,006 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:45:21,007 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 76 treesize of output 75 [2025-01-09 22:45:21,012 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 29 treesize of output 21 [2025-01-09 22:45:21,021 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:45:21,021 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 30 treesize of output 31 [2025-01-09 22:45:21,033 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:45:21,033 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 56 treesize of output 55 [2025-01-09 22:45:21,039 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 21 treesize of output 13 [2025-01-09 22:45:21,439 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse26 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse4 (select |c_#memory_int#1| |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|)) (.cse5 (+ |c_ULTIMATE.start_sll_insert_~new_node~0#1.offset| 4)) (.cse18 (= |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| .cse26))) (let ((.cse7 (or (forall ((v_ArrVal_2281 (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.offset_34| Int) (v_arrayElimCell_104 Int) (v_ArrVal_2284 (Array Int Int))) (let ((.cse27 (store |c_#memory_int#1| |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base| v_ArrVal_2281))) (or (< |v_ULTIMATE.start_main_~ptr~0#1.offset_34| 0) (= (select (select (store .cse27 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_2284) v_arrayElimCell_104) |v_ULTIMATE.start_main_~ptr~0#1.offset_34|) |c_ULTIMATE.start_main_~uneq~0#1|) (not (= (store (select .cse27 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) .cse5 (select v_ArrVal_2284 .cse5)) v_ArrVal_2284))))) .cse18)) (.cse0 (= |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base| .cse26)) (.cse11 (forall ((v_ArrVal_2281 (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.offset_34| Int) (v_arrayElimCell_106 Int) (v_ArrVal_2284 (Array Int Int))) (or (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base| v_ArrVal_2281) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_2284) v_arrayElimCell_106) |v_ULTIMATE.start_main_~ptr~0#1.offset_34|) |c_ULTIMATE.start_main_~uneq~0#1|) (< |v_ULTIMATE.start_main_~ptr~0#1.offset_34| 0) (not (= (store .cse4 .cse5 (select v_ArrVal_2284 .cse5)) v_ArrVal_2284))))) (.cse3 (not .cse18)) (.cse8 (or (forall ((v_ArrVal_2281 (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.offset_34| Int) (v_DerPreprocessor_5 Int)) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select (store (select (store |c_#memory_int#1| |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base| v_ArrVal_2281) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) .cse5 v_DerPreprocessor_5) |v_ULTIMATE.start_main_~ptr~0#1.offset_34|)) (< |v_ULTIMATE.start_main_~ptr~0#1.offset_34| 0))) .cse18)) (.cse9 (forall ((|v_ULTIMATE.start_main_~ptr~0#1.offset_34| Int)) (or (forall ((v_ArrVal_2281 (Array Int Int)) (v_arrayElimCell_104 Int) (v_ArrVal_2284 (Array Int Int))) (let ((.cse25 (store |c_#memory_int#1| |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base| v_ArrVal_2281))) (let ((.cse24 (store .cse25 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_2284))) (or (forall ((v_arrayElimCell_106 Int)) (= (select (select .cse24 v_arrayElimCell_106) |v_ULTIMATE.start_main_~ptr~0#1.offset_34|) |c_ULTIMATE.start_main_~uneq~0#1|)) (= (select (select .cse24 v_arrayElimCell_104) |v_ULTIMATE.start_main_~ptr~0#1.offset_34|) |c_ULTIMATE.start_main_~uneq~0#1|) (not (= (store (select .cse25 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) .cse5 (select v_ArrVal_2284 .cse5)) v_ArrVal_2284)))))) (< |v_ULTIMATE.start_main_~ptr~0#1.offset_34| 0)))) (.cse10 (forall ((|v_ULTIMATE.start_main_~ptr~0#1.offset_34| Int)) (or (forall ((v_ArrVal_2281 (Array Int Int)) (v_ArrVal_2284 (Array Int Int))) (let ((.cse23 (store |c_#memory_int#1| |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base| v_ArrVal_2281))) (or (forall ((v_arrayElimCell_106 Int)) (= (select (select (store .cse23 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_2284) v_arrayElimCell_106) |v_ULTIMATE.start_main_~ptr~0#1.offset_34|) |c_ULTIMATE.start_main_~uneq~0#1|)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select v_ArrVal_2284 |v_ULTIMATE.start_main_~ptr~0#1.offset_34|)) (not (= (store (select .cse23 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) .cse5 (select v_ArrVal_2284 .cse5)) v_ArrVal_2284))))) (< |v_ULTIMATE.start_main_~ptr~0#1.offset_34| 0)))) (.cse15 (= |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.offset| (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (.cse1 (or (forall ((v_ArrVal_2281 (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.offset_34| Int) (v_arrayElimCell_104 Int) (v_ArrVal_2284 (Array Int Int))) (let ((.cse22 (store |c_#memory_int#1| |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base| v_ArrVal_2281))) (or (< |v_ULTIMATE.start_main_~ptr~0#1.offset_34| 0) (< |c_ULTIMATE.start_sll_insert_~new_node~0#1.offset| |v_ULTIMATE.start_main_~ptr~0#1.offset_34|) (= (select (select (store .cse22 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_2284) v_arrayElimCell_104) |v_ULTIMATE.start_main_~ptr~0#1.offset_34|) |c_ULTIMATE.start_main_~uneq~0#1|) (not (= (store (select .cse22 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) .cse5 (select v_ArrVal_2284 .cse5)) v_ArrVal_2284))))) .cse18)) (.cse2 (forall ((|v_ULTIMATE.start_main_~ptr~0#1.offset_34| Int)) (or (forall ((v_ArrVal_2281 (Array Int Int)) (v_arrayElimCell_104 Int) (v_ArrVal_2284 (Array Int Int))) (let ((.cse21 (store |c_#memory_int#1| |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base| v_ArrVal_2281))) (let ((.cse20 (store .cse21 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_2284))) (or (forall ((v_arrayElimCell_106 Int)) (= (select (select .cse20 v_arrayElimCell_106) |v_ULTIMATE.start_main_~ptr~0#1.offset_34|) |c_ULTIMATE.start_main_~uneq~0#1|)) (= (select (select .cse20 v_arrayElimCell_104) |v_ULTIMATE.start_main_~ptr~0#1.offset_34|) |c_ULTIMATE.start_main_~uneq~0#1|) (not (= (store (select .cse21 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) .cse5 (select v_ArrVal_2284 .cse5)) v_ArrVal_2284)))))) (< |v_ULTIMATE.start_main_~ptr~0#1.offset_34| 0) (< |c_ULTIMATE.start_sll_insert_~new_node~0#1.offset| |v_ULTIMATE.start_main_~ptr~0#1.offset_34|))))) (and (or .cse0 (and .cse1 .cse2 (or .cse3 (forall ((v_ArrVal_2281 (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.offset_34| Int) (v_arrayElimCell_106 Int) (v_ArrVal_2284 (Array Int Int))) (or (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base| v_ArrVal_2281) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_2284) v_arrayElimCell_106) |v_ULTIMATE.start_main_~ptr~0#1.offset_34|) |c_ULTIMATE.start_main_~uneq~0#1|) (< |v_ULTIMATE.start_main_~ptr~0#1.offset_34| 0) (< |c_ULTIMATE.start_sll_insert_~new_node~0#1.offset| |v_ULTIMATE.start_main_~ptr~0#1.offset_34|) (not (= (store .cse4 .cse5 (select v_ArrVal_2284 .cse5)) v_ArrVal_2284))))))) (or (forall ((v_ArrVal_2281 (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.offset_34| Int) (v_arrayElimCell_106 Int) (v_ArrVal_2284 (Array Int Int))) (let ((.cse6 (store |c_#memory_int#1| |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base| v_ArrVal_2281))) (or (= (select (select (store .cse6 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_2284) v_arrayElimCell_106) |v_ULTIMATE.start_main_~ptr~0#1.offset_34|) |c_ULTIMATE.start_main_~uneq~0#1|) (< |v_ULTIMATE.start_main_~ptr~0#1.offset_34| 0) (< |c_ULTIMATE.start_sll_insert_~new_node~0#1.offset| |v_ULTIMATE.start_main_~ptr~0#1.offset_34|) (not (= (store (select .cse6 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) .cse5 (select v_ArrVal_2284 .cse5)) v_ArrVal_2284))))) .cse3) (or .cse0 (and .cse7 .cse8 .cse9 .cse10 (or .cse3 .cse11))) (forall ((|v_ULTIMATE.start_main_~ptr~0#1.offset_34| Int)) (or (forall ((v_ArrVal_2281 (Array Int Int)) (v_ArrVal_2284 (Array Int Int))) (let ((.cse12 (store |c_#memory_int#1| |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base| v_ArrVal_2281))) (or (forall ((v_arrayElimCell_106 Int)) (= (select (select (store .cse12 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_2284) v_arrayElimCell_106) |v_ULTIMATE.start_main_~ptr~0#1.offset_34|) |c_ULTIMATE.start_main_~uneq~0#1|)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select v_ArrVal_2284 |v_ULTIMATE.start_main_~ptr~0#1.offset_34|)) (not (= (store (select .cse12 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) .cse5 (select v_ArrVal_2284 .cse5)) v_ArrVal_2284))))) (< |v_ULTIMATE.start_main_~ptr~0#1.offset_34| 0) (< |c_ULTIMATE.start_sll_insert_~new_node~0#1.offset| |v_ULTIMATE.start_main_~ptr~0#1.offset_34|))) (or .cse3 (and (or (forall ((v_ArrVal_2281 (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.offset_34| Int) (v_arrayElimCell_104 Int) (v_arrayElimCell_106 Int) (v_ArrVal_2284 (Array Int Int))) (let ((.cse14 (store |c_#memory_int#1| |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base| v_ArrVal_2281))) (let ((.cse13 (store .cse14 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_2284))) (or (= (select (select .cse13 v_arrayElimCell_106) |v_ULTIMATE.start_main_~ptr~0#1.offset_34|) |c_ULTIMATE.start_main_~uneq~0#1|) (< |v_ULTIMATE.start_main_~ptr~0#1.offset_34| 0) (= (select (select .cse13 v_arrayElimCell_104) |v_ULTIMATE.start_main_~ptr~0#1.offset_34|) |c_ULTIMATE.start_main_~uneq~0#1|) (not (= (store (select .cse14 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) .cse5 (select v_ArrVal_2284 .cse5)) v_ArrVal_2284)))))) .cse15) .cse10 (or (and (forall ((|v_ULTIMATE.start_main_~ptr~0#1.offset_34| Int)) (or (forall ((v_ArrVal_2281 (Array Int Int)) (v_arrayElimCell_106 Int) (v_ArrVal_2284 (Array Int Int))) (or (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base| v_ArrVal_2281) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_2284) v_arrayElimCell_106) |v_ULTIMATE.start_main_~ptr~0#1.offset_34|) |c_ULTIMATE.start_main_~uneq~0#1|) (not (= (store .cse4 .cse5 (select v_ArrVal_2284 .cse5)) v_ArrVal_2284)))) (< |v_ULTIMATE.start_main_~ptr~0#1.offset_34| 0))) (forall ((|v_ULTIMATE.start_main_~ptr~0#1.offset_34| Int)) (or (< |v_ULTIMATE.start_main_~ptr~0#1.offset_34| 0) (forall ((v_ArrVal_2281 (Array Int Int)) (v_arrayElimCell_104 Int) (v_ArrVal_2284 (Array Int Int))) (let ((.cse16 (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base| v_ArrVal_2281) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_2284))) (or (forall ((v_arrayElimCell_106 Int)) (= (select (select .cse16 v_arrayElimCell_106) |v_ULTIMATE.start_main_~ptr~0#1.offset_34|) |c_ULTIMATE.start_main_~uneq~0#1|)) (= (select (select .cse16 v_arrayElimCell_104) |v_ULTIMATE.start_main_~ptr~0#1.offset_34|) |c_ULTIMATE.start_main_~uneq~0#1|) (not (= (store .cse4 .cse5 (select v_ArrVal_2284 .cse5)) v_ArrVal_2284)))))))) .cse0) (forall ((|v_ULTIMATE.start_main_~ptr~0#1.offset_34| Int)) (or (< |v_ULTIMATE.start_main_~ptr~0#1.offset_34| 0) (forall ((v_ArrVal_2281 (Array Int Int)) (v_arrayElimCell_106 Int) (v_ArrVal_2284 (Array Int Int))) (let ((.cse17 (store |c_#memory_int#1| |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base| v_ArrVal_2281))) (or (= (select (select (store .cse17 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_2284) v_arrayElimCell_106) |v_ULTIMATE.start_main_~ptr~0#1.offset_34|) |c_ULTIMATE.start_main_~uneq~0#1|) (not (= (store (select .cse17 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) .cse5 (select v_ArrVal_2284 .cse5)) v_ArrVal_2284))))))))) (or (forall ((v_ArrVal_2281 (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.offset_34| Int)) (or (< |v_ULTIMATE.start_main_~ptr~0#1.offset_34| 0) (< |c_ULTIMATE.start_sll_insert_~new_node~0#1.offset| |v_ULTIMATE.start_main_~ptr~0#1.offset_34|) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base| v_ArrVal_2281) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) |v_ULTIMATE.start_main_~ptr~0#1.offset_34|)))) .cse18) (or .cse15 (and .cse7 (or .cse0 .cse3 .cse11) (or .cse3 (forall ((v_ArrVal_2281 (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.offset_34| Int) (v_arrayElimCell_106 Int) (v_ArrVal_2284 (Array Int Int))) (let ((.cse19 (store |c_#memory_int#1| |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base| v_ArrVal_2281))) (or (= (select (select (store .cse19 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_2284) v_arrayElimCell_106) |v_ULTIMATE.start_main_~ptr~0#1.offset_34|) |c_ULTIMATE.start_main_~uneq~0#1|) (< |v_ULTIMATE.start_main_~ptr~0#1.offset_34| 0) (not (= (store (select .cse19 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) .cse5 (select v_ArrVal_2284 .cse5)) v_ArrVal_2284)))))) .cse8 .cse9 .cse10)) (or .cse15 (and .cse1 .cse2)))))) is different from false [2025-01-09 22:45:22,978 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse23 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse18 (= |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| .cse23)) (.cse6 (select |c_#memory_int#1| |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|)) (.cse1 (+ |c_ULTIMATE.start_sll_insert_~new_node~0#1.offset| 4))) (let ((.cse7 (= |c_ULTIMATE.start_sll_insert_~last~0#1.offset| (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (.cse14 (forall ((v_ArrVal_2281 (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.offset_34| Int) (v_arrayElimCell_106 Int) (v_ArrVal_2284 (Array Int Int))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_insert_~last~0#1.base| v_ArrVal_2281) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_2284) v_arrayElimCell_106) |v_ULTIMATE.start_main_~ptr~0#1.offset_34|)) (< |v_ULTIMATE.start_main_~ptr~0#1.offset_34| 0) (not (= (store .cse6 .cse1 (select v_ArrVal_2284 .cse1)) v_ArrVal_2284))))) (.cse11 (or (forall ((v_ArrVal_2281 (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.offset_34| Int) (v_DerPreprocessor_5 Int)) (or (< |v_ULTIMATE.start_main_~ptr~0#1.offset_34| 0) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (store (select (store |c_#memory_int#1| |c_ULTIMATE.start_sll_insert_~last~0#1.base| v_ArrVal_2281) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) .cse1 v_DerPreprocessor_5) |v_ULTIMATE.start_main_~ptr~0#1.offset_34|)))) .cse18)) (.cse3 (forall ((|v_ULTIMATE.start_main_~ptr~0#1.offset_34| Int)) (or (< |v_ULTIMATE.start_main_~ptr~0#1.offset_34| 0) (forall ((v_ArrVal_2281 (Array Int Int)) (v_ArrVal_2284 (Array Int Int))) (let ((.cse27 (store |c_#memory_int#1| |c_ULTIMATE.start_sll_insert_~last~0#1.base| v_ArrVal_2281))) (or (forall ((v_arrayElimCell_106 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store .cse27 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_2284) v_arrayElimCell_106) |v_ULTIMATE.start_main_~ptr~0#1.offset_34|))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select v_ArrVal_2284 |v_ULTIMATE.start_main_~ptr~0#1.offset_34|)) (not (= v_ArrVal_2284 (store (select .cse27 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) .cse1 (select v_ArrVal_2284 .cse1)))))))))) (.cse12 (forall ((|v_ULTIMATE.start_main_~ptr~0#1.offset_34| Int)) (or (forall ((v_ArrVal_2281 (Array Int Int)) (v_arrayElimCell_104 Int) (v_ArrVal_2284 (Array Int Int))) (let ((.cse26 (store |c_#memory_int#1| |c_ULTIMATE.start_sll_insert_~last~0#1.base| v_ArrVal_2281))) (let ((.cse25 (store .cse26 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_2284))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse25 v_arrayElimCell_104) |v_ULTIMATE.start_main_~ptr~0#1.offset_34|)) (forall ((v_arrayElimCell_106 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse25 v_arrayElimCell_106) |v_ULTIMATE.start_main_~ptr~0#1.offset_34|))) (not (= v_ArrVal_2284 (store (select .cse26 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) .cse1 (select v_ArrVal_2284 .cse1)))))))) (< |v_ULTIMATE.start_main_~ptr~0#1.offset_34| 0)))) (.cse13 (or (forall ((v_ArrVal_2281 (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.offset_34| Int) (v_arrayElimCell_104 Int) (v_ArrVal_2284 (Array Int Int))) (let ((.cse24 (store |c_#memory_int#1| |c_ULTIMATE.start_sll_insert_~last~0#1.base| v_ArrVal_2281))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store .cse24 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_2284) v_arrayElimCell_104) |v_ULTIMATE.start_main_~ptr~0#1.offset_34|)) (< |v_ULTIMATE.start_main_~ptr~0#1.offset_34| 0) (not (= v_ArrVal_2284 (store (select .cse24 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) .cse1 (select v_ArrVal_2284 .cse1))))))) .cse18)) (.cse4 (= |c_ULTIMATE.start_sll_insert_~last~0#1.base| .cse23)) (.cse2 (not .cse18)) (.cse15 (or (forall ((v_ArrVal_2281 (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.offset_34| Int) (v_arrayElimCell_104 Int) (v_ArrVal_2284 (Array Int Int))) (let ((.cse22 (store |c_#memory_int#1| |c_ULTIMATE.start_sll_insert_~last~0#1.base| v_ArrVal_2281))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store .cse22 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_2284) v_arrayElimCell_104) |v_ULTIMATE.start_main_~ptr~0#1.offset_34|)) (< |v_ULTIMATE.start_main_~ptr~0#1.offset_34| 0) (< |c_ULTIMATE.start_sll_insert_~new_node~0#1.offset| |v_ULTIMATE.start_main_~ptr~0#1.offset_34|) (not (= v_ArrVal_2284 (store (select .cse22 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) .cse1 (select v_ArrVal_2284 .cse1))))))) .cse18)) (.cse16 (forall ((|v_ULTIMATE.start_main_~ptr~0#1.offset_34| Int)) (or (forall ((v_ArrVal_2281 (Array Int Int)) (v_arrayElimCell_104 Int) (v_ArrVal_2284 (Array Int Int))) (let ((.cse21 (store |c_#memory_int#1| |c_ULTIMATE.start_sll_insert_~last~0#1.base| v_ArrVal_2281))) (let ((.cse20 (store .cse21 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_2284))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse20 v_arrayElimCell_104) |v_ULTIMATE.start_main_~ptr~0#1.offset_34|)) (forall ((v_arrayElimCell_106 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse20 v_arrayElimCell_106) |v_ULTIMATE.start_main_~ptr~0#1.offset_34|))) (not (= v_ArrVal_2284 (store (select .cse21 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) .cse1 (select v_ArrVal_2284 .cse1)))))))) (< |v_ULTIMATE.start_main_~ptr~0#1.offset_34| 0) (< |c_ULTIMATE.start_sll_insert_~new_node~0#1.offset| |v_ULTIMATE.start_main_~ptr~0#1.offset_34|))))) (and (forall ((|v_ULTIMATE.start_main_~ptr~0#1.offset_34| Int)) (or (< |v_ULTIMATE.start_main_~ptr~0#1.offset_34| 0) (< |c_ULTIMATE.start_sll_insert_~new_node~0#1.offset| |v_ULTIMATE.start_main_~ptr~0#1.offset_34|) (forall ((v_ArrVal_2281 (Array Int Int)) (v_ArrVal_2284 (Array Int Int))) (let ((.cse0 (store |c_#memory_int#1| |c_ULTIMATE.start_sll_insert_~last~0#1.base| v_ArrVal_2281))) (or (forall ((v_arrayElimCell_106 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store .cse0 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_2284) v_arrayElimCell_106) |v_ULTIMATE.start_main_~ptr~0#1.offset_34|))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select v_ArrVal_2284 |v_ULTIMATE.start_main_~ptr~0#1.offset_34|)) (not (= v_ArrVal_2284 (store (select .cse0 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) .cse1 (select v_ArrVal_2284 .cse1))))))))) (or .cse2 (and .cse3 (or .cse4 (and (forall ((|v_ULTIMATE.start_main_~ptr~0#1.offset_34| Int)) (or (< |v_ULTIMATE.start_main_~ptr~0#1.offset_34| 0) (forall ((v_ArrVal_2281 (Array Int Int)) (v_arrayElimCell_104 Int) (v_ArrVal_2284 (Array Int Int))) (let ((.cse5 (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_insert_~last~0#1.base| v_ArrVal_2281) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_2284))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse5 v_arrayElimCell_104) |v_ULTIMATE.start_main_~ptr~0#1.offset_34|)) (forall ((v_arrayElimCell_106 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse5 v_arrayElimCell_106) |v_ULTIMATE.start_main_~ptr~0#1.offset_34|))) (not (= (store .cse6 .cse1 (select v_ArrVal_2284 .cse1)) v_ArrVal_2284))))))) (forall ((|v_ULTIMATE.start_main_~ptr~0#1.offset_34| Int)) (or (< |v_ULTIMATE.start_main_~ptr~0#1.offset_34| 0) (forall ((v_ArrVal_2281 (Array Int Int)) (v_arrayElimCell_106 Int) (v_ArrVal_2284 (Array Int Int))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_insert_~last~0#1.base| v_ArrVal_2281) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_2284) v_arrayElimCell_106) |v_ULTIMATE.start_main_~ptr~0#1.offset_34|)) (not (= (store .cse6 .cse1 (select v_ArrVal_2284 .cse1)) v_ArrVal_2284)))))))) (or .cse7 (forall ((v_ArrVal_2281 (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.offset_34| Int) (v_arrayElimCell_104 Int) (v_arrayElimCell_106 Int) (v_ArrVal_2284 (Array Int Int))) (let ((.cse9 (store |c_#memory_int#1| |c_ULTIMATE.start_sll_insert_~last~0#1.base| v_ArrVal_2281))) (let ((.cse8 (store .cse9 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_2284))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse8 v_arrayElimCell_104) |v_ULTIMATE.start_main_~ptr~0#1.offset_34|)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse8 v_arrayElimCell_106) |v_ULTIMATE.start_main_~ptr~0#1.offset_34|)) (< |v_ULTIMATE.start_main_~ptr~0#1.offset_34| 0) (not (= v_ArrVal_2284 (store (select .cse9 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) .cse1 (select v_ArrVal_2284 .cse1))))))))) (forall ((|v_ULTIMATE.start_main_~ptr~0#1.offset_34| Int)) (or (< |v_ULTIMATE.start_main_~ptr~0#1.offset_34| 0) (forall ((v_ArrVal_2281 (Array Int Int)) (v_arrayElimCell_106 Int) (v_ArrVal_2284 (Array Int Int))) (let ((.cse10 (store |c_#memory_int#1| |c_ULTIMATE.start_sll_insert_~last~0#1.base| v_ArrVal_2281))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store .cse10 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_2284) v_arrayElimCell_106) |v_ULTIMATE.start_main_~ptr~0#1.offset_34|)) (not (= v_ArrVal_2284 (store (select .cse10 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) .cse1 (select v_ArrVal_2284 .cse1))))))))))) (or .cse4 (and .cse11 .cse3 .cse12 .cse13 (or .cse14 .cse2))) (or (and .cse15 .cse16) .cse7) (or .cse7 (and (or .cse14 .cse2 .cse4) .cse11 .cse3 .cse12 (or .cse2 (forall ((v_ArrVal_2281 (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.offset_34| Int) (v_arrayElimCell_106 Int) (v_ArrVal_2284 (Array Int Int))) (let ((.cse17 (store |c_#memory_int#1| |c_ULTIMATE.start_sll_insert_~last~0#1.base| v_ArrVal_2281))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store .cse17 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_2284) v_arrayElimCell_106) |v_ULTIMATE.start_main_~ptr~0#1.offset_34|)) (< |v_ULTIMATE.start_main_~ptr~0#1.offset_34| 0) (not (= v_ArrVal_2284 (store (select .cse17 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) .cse1 (select v_ArrVal_2284 .cse1)))))))) .cse13)) (or (forall ((v_ArrVal_2281 (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.offset_34| Int)) (or (< |v_ULTIMATE.start_main_~ptr~0#1.offset_34| 0) (< |c_ULTIMATE.start_sll_insert_~new_node~0#1.offset| |v_ULTIMATE.start_main_~ptr~0#1.offset_34|) (= (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_sll_insert_~last~0#1.base| v_ArrVal_2281) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) |v_ULTIMATE.start_main_~ptr~0#1.offset_34|) |c_ULTIMATE.start_main_~uneq~0#1|))) .cse18) (or .cse2 (forall ((v_ArrVal_2281 (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.offset_34| Int) (v_arrayElimCell_106 Int) (v_ArrVal_2284 (Array Int Int))) (let ((.cse19 (store |c_#memory_int#1| |c_ULTIMATE.start_sll_insert_~last~0#1.base| v_ArrVal_2281))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store .cse19 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_2284) v_arrayElimCell_106) |v_ULTIMATE.start_main_~ptr~0#1.offset_34|)) (< |v_ULTIMATE.start_main_~ptr~0#1.offset_34| 0) (< |c_ULTIMATE.start_sll_insert_~new_node~0#1.offset| |v_ULTIMATE.start_main_~ptr~0#1.offset_34|) (not (= v_ArrVal_2284 (store (select .cse19 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) .cse1 (select v_ArrVal_2284 .cse1)))))))) (or .cse4 (and (or .cse2 (forall ((v_ArrVal_2281 (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.offset_34| Int) (v_arrayElimCell_106 Int) (v_ArrVal_2284 (Array Int Int))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_insert_~last~0#1.base| v_ArrVal_2281) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_2284) v_arrayElimCell_106) |v_ULTIMATE.start_main_~ptr~0#1.offset_34|)) (< |v_ULTIMATE.start_main_~ptr~0#1.offset_34| 0) (< |c_ULTIMATE.start_sll_insert_~new_node~0#1.offset| |v_ULTIMATE.start_main_~ptr~0#1.offset_34|) (not (= (store .cse6 .cse1 (select v_ArrVal_2284 .cse1)) v_ArrVal_2284))))) .cse15 .cse16)))))) is different from false [2025-01-09 22:45:23,275 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse23 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse16 (= |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| .cse23)) (.cse10 (select |c_#memory_int#1| |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|)) (.cse4 (+ |c_ULTIMATE.start_sll_insert_~new_node~0#1.offset| 4))) (let ((.cse9 (= |c_ULTIMATE.start_sll_insert_#t~mem8#1.offset| (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (.cse0 (forall ((|v_ULTIMATE.start_main_~ptr~0#1.offset_34| Int)) (or (< |v_ULTIMATE.start_main_~ptr~0#1.offset_34| 0) (forall ((v_ArrVal_2281 (Array Int Int)) (v_ArrVal_2284 (Array Int Int))) (let ((.cse27 (store |c_#memory_int#1| |c_ULTIMATE.start_sll_insert_#t~mem8#1.base| v_ArrVal_2281))) (or (not (= (store (select .cse27 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) .cse4 (select v_ArrVal_2284 .cse4)) v_ArrVal_2284)) (forall ((v_arrayElimCell_106 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store .cse27 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_2284) v_arrayElimCell_106) |v_ULTIMATE.start_main_~ptr~0#1.offset_34|))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select v_ArrVal_2284 |v_ULTIMATE.start_main_~ptr~0#1.offset_34|)))))))) (.cse1 (forall ((|v_ULTIMATE.start_main_~ptr~0#1.offset_34| Int)) (or (forall ((v_ArrVal_2281 (Array Int Int)) (v_arrayElimCell_104 Int) (v_ArrVal_2284 (Array Int Int))) (let ((.cse26 (store |c_#memory_int#1| |c_ULTIMATE.start_sll_insert_#t~mem8#1.base| v_ArrVal_2281))) (let ((.cse25 (store .cse26 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_2284))) (or (= (select (select .cse25 v_arrayElimCell_104) |v_ULTIMATE.start_main_~ptr~0#1.offset_34|) |c_ULTIMATE.start_main_~uneq~0#1|) (not (= (store (select .cse26 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) .cse4 (select v_ArrVal_2284 .cse4)) v_ArrVal_2284)) (forall ((v_arrayElimCell_106 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse25 v_arrayElimCell_106) |v_ULTIMATE.start_main_~ptr~0#1.offset_34|))))))) (< |v_ULTIMATE.start_main_~ptr~0#1.offset_34| 0)))) (.cse7 (forall ((v_ArrVal_2281 (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.offset_34| Int) (v_arrayElimCell_106 Int) (v_ArrVal_2284 (Array Int Int))) (or (< |v_ULTIMATE.start_main_~ptr~0#1.offset_34| 0) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_insert_#t~mem8#1.base| v_ArrVal_2281) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_2284) v_arrayElimCell_106) |v_ULTIMATE.start_main_~ptr~0#1.offset_34|)) (not (= (store .cse10 .cse4 (select v_ArrVal_2284 .cse4)) v_ArrVal_2284))))) (.cse5 (or (forall ((v_ArrVal_2281 (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.offset_34| Int) (v_arrayElimCell_104 Int) (v_ArrVal_2284 (Array Int Int))) (let ((.cse24 (store |c_#memory_int#1| |c_ULTIMATE.start_sll_insert_#t~mem8#1.base| v_ArrVal_2281))) (or (= (select (select (store .cse24 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_2284) v_arrayElimCell_104) |v_ULTIMATE.start_main_~ptr~0#1.offset_34|) |c_ULTIMATE.start_main_~uneq~0#1|) (not (= (store (select .cse24 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) .cse4 (select v_ArrVal_2284 .cse4)) v_ArrVal_2284)) (< |v_ULTIMATE.start_main_~ptr~0#1.offset_34| 0)))) .cse16)) (.cse8 (or (forall ((v_ArrVal_2281 (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.offset_34| Int) (v_DerPreprocessor_5 Int)) (or (< |v_ULTIMATE.start_main_~ptr~0#1.offset_34| 0) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (store (select (store |c_#memory_int#1| |c_ULTIMATE.start_sll_insert_#t~mem8#1.base| v_ArrVal_2281) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) .cse4 v_DerPreprocessor_5) |v_ULTIMATE.start_main_~ptr~0#1.offset_34|)))) .cse16)) (.cse6 (= |c_ULTIMATE.start_sll_insert_#t~mem8#1.base| .cse23)) (.cse17 (or (forall ((v_ArrVal_2281 (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.offset_34| Int) (v_arrayElimCell_104 Int) (v_ArrVal_2284 (Array Int Int))) (let ((.cse22 (store |c_#memory_int#1| |c_ULTIMATE.start_sll_insert_#t~mem8#1.base| v_ArrVal_2281))) (or (= (select (select (store .cse22 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_2284) v_arrayElimCell_104) |v_ULTIMATE.start_main_~ptr~0#1.offset_34|) |c_ULTIMATE.start_main_~uneq~0#1|) (not (= (store (select .cse22 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) .cse4 (select v_ArrVal_2284 .cse4)) v_ArrVal_2284)) (< |v_ULTIMATE.start_main_~ptr~0#1.offset_34| 0) (< |c_ULTIMATE.start_sll_insert_~new_node~0#1.offset| |v_ULTIMATE.start_main_~ptr~0#1.offset_34|)))) .cse16)) (.cse2 (not .cse16)) (.cse18 (forall ((|v_ULTIMATE.start_main_~ptr~0#1.offset_34| Int)) (or (forall ((v_ArrVal_2281 (Array Int Int)) (v_arrayElimCell_104 Int) (v_ArrVal_2284 (Array Int Int))) (let ((.cse21 (store |c_#memory_int#1| |c_ULTIMATE.start_sll_insert_#t~mem8#1.base| v_ArrVal_2281))) (let ((.cse20 (store .cse21 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_2284))) (or (= (select (select .cse20 v_arrayElimCell_104) |v_ULTIMATE.start_main_~ptr~0#1.offset_34|) |c_ULTIMATE.start_main_~uneq~0#1|) (not (= (store (select .cse21 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) .cse4 (select v_ArrVal_2284 .cse4)) v_ArrVal_2284)) (forall ((v_arrayElimCell_106 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse20 v_arrayElimCell_106) |v_ULTIMATE.start_main_~ptr~0#1.offset_34|))))))) (< |v_ULTIMATE.start_main_~ptr~0#1.offset_34| 0) (< |c_ULTIMATE.start_sll_insert_~new_node~0#1.offset| |v_ULTIMATE.start_main_~ptr~0#1.offset_34|))))) (and (or (and .cse0 .cse1 (or .cse2 (forall ((v_ArrVal_2281 (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.offset_34| Int) (v_arrayElimCell_106 Int) (v_ArrVal_2284 (Array Int Int))) (let ((.cse3 (store |c_#memory_int#1| |c_ULTIMATE.start_sll_insert_#t~mem8#1.base| v_ArrVal_2281))) (or (not (= (store (select .cse3 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) .cse4 (select v_ArrVal_2284 .cse4)) v_ArrVal_2284)) (< |v_ULTIMATE.start_main_~ptr~0#1.offset_34| 0) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store .cse3 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_2284) v_arrayElimCell_106) |v_ULTIMATE.start_main_~ptr~0#1.offset_34|)))))) .cse5 (or .cse6 .cse2 .cse7) .cse8) .cse9) (or .cse2 (and .cse0 (or .cse6 (and (forall ((|v_ULTIMATE.start_main_~ptr~0#1.offset_34| Int)) (or (forall ((v_ArrVal_2281 (Array Int Int)) (v_arrayElimCell_106 Int) (v_ArrVal_2284 (Array Int Int))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_insert_#t~mem8#1.base| v_ArrVal_2281) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_2284) v_arrayElimCell_106) |v_ULTIMATE.start_main_~ptr~0#1.offset_34|)) (not (= (store .cse10 .cse4 (select v_ArrVal_2284 .cse4)) v_ArrVal_2284)))) (< |v_ULTIMATE.start_main_~ptr~0#1.offset_34| 0))) (forall ((|v_ULTIMATE.start_main_~ptr~0#1.offset_34| Int)) (or (< |v_ULTIMATE.start_main_~ptr~0#1.offset_34| 0) (forall ((v_ArrVal_2281 (Array Int Int)) (v_arrayElimCell_104 Int) (v_ArrVal_2284 (Array Int Int))) (let ((.cse11 (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_insert_#t~mem8#1.base| v_ArrVal_2281) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_2284))) (or (= (select (select .cse11 v_arrayElimCell_104) |v_ULTIMATE.start_main_~ptr~0#1.offset_34|) |c_ULTIMATE.start_main_~uneq~0#1|) (forall ((v_arrayElimCell_106 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse11 v_arrayElimCell_106) |v_ULTIMATE.start_main_~ptr~0#1.offset_34|))) (not (= (store .cse10 .cse4 (select v_ArrVal_2284 .cse4)) v_ArrVal_2284))))))))) (or .cse9 (forall ((v_ArrVal_2281 (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.offset_34| Int) (v_arrayElimCell_104 Int) (v_arrayElimCell_106 Int) (v_ArrVal_2284 (Array Int Int))) (let ((.cse13 (store |c_#memory_int#1| |c_ULTIMATE.start_sll_insert_#t~mem8#1.base| v_ArrVal_2281))) (let ((.cse12 (store .cse13 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_2284))) (or (= (select (select .cse12 v_arrayElimCell_104) |v_ULTIMATE.start_main_~ptr~0#1.offset_34|) |c_ULTIMATE.start_main_~uneq~0#1|) (not (= (store (select .cse13 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) .cse4 (select v_ArrVal_2284 .cse4)) v_ArrVal_2284)) (< |v_ULTIMATE.start_main_~ptr~0#1.offset_34| 0) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse12 v_arrayElimCell_106) |v_ULTIMATE.start_main_~ptr~0#1.offset_34|))))))) (forall ((|v_ULTIMATE.start_main_~ptr~0#1.offset_34| Int)) (or (forall ((v_ArrVal_2281 (Array Int Int)) (v_arrayElimCell_106 Int) (v_ArrVal_2284 (Array Int Int))) (let ((.cse14 (store |c_#memory_int#1| |c_ULTIMATE.start_sll_insert_#t~mem8#1.base| v_ArrVal_2281))) (or (not (= (store (select .cse14 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) .cse4 (select v_ArrVal_2284 .cse4)) v_ArrVal_2284)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store .cse14 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_2284) v_arrayElimCell_106) |v_ULTIMATE.start_main_~ptr~0#1.offset_34|))))) (< |v_ULTIMATE.start_main_~ptr~0#1.offset_34| 0))))) (or .cse2 (forall ((v_ArrVal_2281 (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.offset_34| Int) (v_arrayElimCell_106 Int) (v_ArrVal_2284 (Array Int Int))) (let ((.cse15 (store |c_#memory_int#1| |c_ULTIMATE.start_sll_insert_#t~mem8#1.base| v_ArrVal_2281))) (or (not (= (store (select .cse15 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) .cse4 (select v_ArrVal_2284 .cse4)) v_ArrVal_2284)) (< |v_ULTIMATE.start_main_~ptr~0#1.offset_34| 0) (< |c_ULTIMATE.start_sll_insert_~new_node~0#1.offset| |v_ULTIMATE.start_main_~ptr~0#1.offset_34|) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store .cse15 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_2284) v_arrayElimCell_106) |v_ULTIMATE.start_main_~ptr~0#1.offset_34|)))))) (or (forall ((v_ArrVal_2281 (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.offset_34| Int)) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_sll_insert_#t~mem8#1.base| v_ArrVal_2281) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) |v_ULTIMATE.start_main_~ptr~0#1.offset_34|)) (< |v_ULTIMATE.start_main_~ptr~0#1.offset_34| 0) (< |c_ULTIMATE.start_sll_insert_~new_node~0#1.offset| |v_ULTIMATE.start_main_~ptr~0#1.offset_34|))) .cse16) (or (and .cse17 .cse18) .cse9) (forall ((|v_ULTIMATE.start_main_~ptr~0#1.offset_34| Int)) (or (< |v_ULTIMATE.start_main_~ptr~0#1.offset_34| 0) (< |c_ULTIMATE.start_sll_insert_~new_node~0#1.offset| |v_ULTIMATE.start_main_~ptr~0#1.offset_34|) (forall ((v_ArrVal_2281 (Array Int Int)) (v_ArrVal_2284 (Array Int Int))) (let ((.cse19 (store |c_#memory_int#1| |c_ULTIMATE.start_sll_insert_#t~mem8#1.base| v_ArrVal_2281))) (or (not (= (store (select .cse19 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) .cse4 (select v_ArrVal_2284 .cse4)) v_ArrVal_2284)) (forall ((v_arrayElimCell_106 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store .cse19 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_2284) v_arrayElimCell_106) |v_ULTIMATE.start_main_~ptr~0#1.offset_34|))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select v_ArrVal_2284 |v_ULTIMATE.start_main_~ptr~0#1.offset_34|))))))) (or .cse6 (and .cse0 .cse1 (or .cse2 .cse7) .cse5 .cse8)) (or .cse6 (and .cse17 (or .cse2 (forall ((v_ArrVal_2281 (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.offset_34| Int) (v_arrayElimCell_106 Int) (v_ArrVal_2284 (Array Int Int))) (or (< |v_ULTIMATE.start_main_~ptr~0#1.offset_34| 0) (< |c_ULTIMATE.start_sll_insert_~new_node~0#1.offset| |v_ULTIMATE.start_main_~ptr~0#1.offset_34|) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_insert_#t~mem8#1.base| v_ArrVal_2281) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_2284) v_arrayElimCell_106) |v_ULTIMATE.start_main_~ptr~0#1.offset_34|)) (not (= (store .cse10 .cse4 (select v_ArrVal_2284 .cse4)) v_ArrVal_2284))))) .cse18)))))) is different from false [2025-01-09 22:45:23,520 INFO L349 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2025-01-09 22:45:23,521 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 11 treesize of output 11 [2025-01-09 22:45:23,559 INFO L349 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2025-01-09 22:45:23,559 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 11 treesize of output 11 [2025-01-09 22:45:23,605 INFO L349 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2025-01-09 22:45:23,606 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 11 treesize of output 11 [2025-01-09 22:45:23,673 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse21 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse19 (select |c_#memory_int#1| |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|)) (.cse6 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse5 (+ |c_ULTIMATE.start_sll_insert_~new_node~0#1.offset| 4)) (.cse13 (= |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| .cse21))) (let ((.cse8 (or (forall ((v_ArrVal_2281 (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.offset_34| Int) (v_DerPreprocessor_5 Int)) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select (store (select (store |c_#memory_int#1| .cse6 v_ArrVal_2281) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) .cse5 v_DerPreprocessor_5) |v_ULTIMATE.start_main_~ptr~0#1.offset_34|)) (< |v_ULTIMATE.start_main_~ptr~0#1.offset_34| 0))) .cse13)) (.cse9 (forall ((v_ArrVal_2281 (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.offset_34| Int) (v_arrayElimCell_106 Int) (v_ArrVal_2284 (Array Int Int))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (store |c_#memory_int#1| .cse6 v_ArrVal_2281) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_2284) v_arrayElimCell_106) |v_ULTIMATE.start_main_~ptr~0#1.offset_34|)) (< |v_ULTIMATE.start_main_~ptr~0#1.offset_34| 0) (not (= (store .cse19 .cse5 (select v_ArrVal_2284 .cse5)) v_ArrVal_2284))))) (.cse10 (or (forall ((v_ArrVal_2281 (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.offset_34| Int) (v_arrayElimCell_104 Int) (v_ArrVal_2284 (Array Int Int))) (let ((.cse28 (store |c_#memory_int#1| .cse6 v_ArrVal_2281))) (or (not (= v_ArrVal_2284 (store (select .cse28 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) .cse5 (select v_ArrVal_2284 .cse5)))) (< |v_ULTIMATE.start_main_~ptr~0#1.offset_34| 0) (= (select (select (store .cse28 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_2284) v_arrayElimCell_104) |v_ULTIMATE.start_main_~ptr~0#1.offset_34|) |c_ULTIMATE.start_main_~uneq~0#1|)))) .cse13)) (.cse11 (forall ((|v_ULTIMATE.start_main_~ptr~0#1.offset_34| Int)) (or (< |v_ULTIMATE.start_main_~ptr~0#1.offset_34| 0) (forall ((v_ArrVal_2281 (Array Int Int)) (v_arrayElimCell_104 Int) (v_ArrVal_2284 (Array Int Int))) (let ((.cse26 (store |c_#memory_int#1| .cse6 v_ArrVal_2281))) (let ((.cse27 (store .cse26 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_2284))) (or (not (= v_ArrVal_2284 (store (select .cse26 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) .cse5 (select v_ArrVal_2284 .cse5)))) (= (select (select .cse27 v_arrayElimCell_104) |v_ULTIMATE.start_main_~ptr~0#1.offset_34|) |c_ULTIMATE.start_main_~uneq~0#1|) (forall ((v_arrayElimCell_106 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse27 v_arrayElimCell_106) |v_ULTIMATE.start_main_~ptr~0#1.offset_34|)))))))))) (.cse12 (forall ((|v_ULTIMATE.start_main_~ptr~0#1.offset_34| Int)) (or (forall ((v_ArrVal_2281 (Array Int Int)) (v_ArrVal_2284 (Array Int Int))) (let ((.cse25 (store |c_#memory_int#1| .cse6 v_ArrVal_2281))) (or (not (= v_ArrVal_2284 (store (select .cse25 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) .cse5 (select v_ArrVal_2284 .cse5)))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select v_ArrVal_2284 |v_ULTIMATE.start_main_~ptr~0#1.offset_34|)) (forall ((v_arrayElimCell_106 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store .cse25 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_2284) v_arrayElimCell_106) |v_ULTIMATE.start_main_~ptr~0#1.offset_34|)))))) (< |v_ULTIMATE.start_main_~ptr~0#1.offset_34| 0)))) (.cse2 (and (= |c_ULTIMATE.start_sll_insert_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_sll_insert_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|))) (.cse3 (not .cse13)) (.cse0 (or (forall ((v_ArrVal_2281 (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.offset_34| Int) (v_arrayElimCell_104 Int) (v_ArrVal_2284 (Array Int Int))) (let ((.cse24 (store |c_#memory_int#1| .cse6 v_ArrVal_2281))) (or (not (= v_ArrVal_2284 (store (select .cse24 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) .cse5 (select v_ArrVal_2284 .cse5)))) (< |v_ULTIMATE.start_main_~ptr~0#1.offset_34| 0) (< |c_ULTIMATE.start_sll_insert_~new_node~0#1.offset| |v_ULTIMATE.start_main_~ptr~0#1.offset_34|) (= (select (select (store .cse24 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_2284) v_arrayElimCell_104) |v_ULTIMATE.start_main_~ptr~0#1.offset_34|) |c_ULTIMATE.start_main_~uneq~0#1|)))) .cse13)) (.cse1 (forall ((|v_ULTIMATE.start_main_~ptr~0#1.offset_34| Int)) (or (< |v_ULTIMATE.start_main_~ptr~0#1.offset_34| 0) (< |c_ULTIMATE.start_sll_insert_~new_node~0#1.offset| |v_ULTIMATE.start_main_~ptr~0#1.offset_34|) (forall ((v_ArrVal_2281 (Array Int Int)) (v_arrayElimCell_104 Int) (v_ArrVal_2284 (Array Int Int))) (let ((.cse22 (store |c_#memory_int#1| .cse6 v_ArrVal_2281))) (let ((.cse23 (store .cse22 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_2284))) (or (not (= v_ArrVal_2284 (store (select .cse22 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) .cse5 (select v_ArrVal_2284 .cse5)))) (= (select (select .cse23 v_arrayElimCell_104) |v_ULTIMATE.start_main_~ptr~0#1.offset_34|) |c_ULTIMATE.start_main_~uneq~0#1|) (forall ((v_arrayElimCell_106 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse23 v_arrayElimCell_106) |v_ULTIMATE.start_main_~ptr~0#1.offset_34|)))))))))) (.cse7 (= .cse6 .cse21))) (and (or (and .cse0 .cse1) .cse2) (or .cse3 (forall ((v_ArrVal_2281 (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.offset_34| Int) (v_arrayElimCell_106 Int) (v_ArrVal_2284 (Array Int Int))) (let ((.cse4 (store |c_#memory_int#1| .cse6 v_ArrVal_2281))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store .cse4 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_2284) v_arrayElimCell_106) |v_ULTIMATE.start_main_~ptr~0#1.offset_34|)) (not (= v_ArrVal_2284 (store (select .cse4 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) .cse5 (select v_ArrVal_2284 .cse5)))) (< |v_ULTIMATE.start_main_~ptr~0#1.offset_34| 0) (< |c_ULTIMATE.start_sll_insert_~new_node~0#1.offset| |v_ULTIMATE.start_main_~ptr~0#1.offset_34|))))) (or .cse7 (and .cse8 (or .cse9 .cse3) .cse10 .cse11 .cse12)) (or (forall ((v_ArrVal_2281 (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.offset_34| Int)) (or (< |v_ULTIMATE.start_main_~ptr~0#1.offset_34| 0) (< |c_ULTIMATE.start_sll_insert_~new_node~0#1.offset| |v_ULTIMATE.start_main_~ptr~0#1.offset_34|) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store |c_#memory_int#1| .cse6 v_ArrVal_2281) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) |v_ULTIMATE.start_main_~ptr~0#1.offset_34|)))) .cse13) (forall ((|v_ULTIMATE.start_main_~ptr~0#1.offset_34| Int)) (or (forall ((v_ArrVal_2281 (Array Int Int)) (v_ArrVal_2284 (Array Int Int))) (let ((.cse14 (store |c_#memory_int#1| .cse6 v_ArrVal_2281))) (or (not (= v_ArrVal_2284 (store (select .cse14 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) .cse5 (select v_ArrVal_2284 .cse5)))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select v_ArrVal_2284 |v_ULTIMATE.start_main_~ptr~0#1.offset_34|)) (forall ((v_arrayElimCell_106 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store .cse14 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_2284) v_arrayElimCell_106) |v_ULTIMATE.start_main_~ptr~0#1.offset_34|)))))) (< |v_ULTIMATE.start_main_~ptr~0#1.offset_34| 0) (< |c_ULTIMATE.start_sll_insert_~new_node~0#1.offset| |v_ULTIMATE.start_main_~ptr~0#1.offset_34|))) (or .cse3 (and (or (forall ((v_ArrVal_2281 (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.offset_34| Int) (v_arrayElimCell_104 Int) (v_arrayElimCell_106 Int) (v_ArrVal_2284 (Array Int Int))) (let ((.cse16 (store |c_#memory_int#1| .cse6 v_ArrVal_2281))) (let ((.cse15 (store .cse16 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_2284))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse15 v_arrayElimCell_106) |v_ULTIMATE.start_main_~ptr~0#1.offset_34|)) (not (= v_ArrVal_2284 (store (select .cse16 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) .cse5 (select v_ArrVal_2284 .cse5)))) (< |v_ULTIMATE.start_main_~ptr~0#1.offset_34| 0) (= (select (select .cse15 v_arrayElimCell_104) |v_ULTIMATE.start_main_~ptr~0#1.offset_34|) |c_ULTIMATE.start_main_~uneq~0#1|))))) .cse2) (forall ((|v_ULTIMATE.start_main_~ptr~0#1.offset_34| Int)) (or (< |v_ULTIMATE.start_main_~ptr~0#1.offset_34| 0) (forall ((v_ArrVal_2281 (Array Int Int)) (v_arrayElimCell_106 Int) (v_ArrVal_2284 (Array Int Int))) (let ((.cse17 (store |c_#memory_int#1| .cse6 v_ArrVal_2281))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store .cse17 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_2284) v_arrayElimCell_106) |v_ULTIMATE.start_main_~ptr~0#1.offset_34|)) (not (= v_ArrVal_2284 (store (select .cse17 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) .cse5 (select v_ArrVal_2284 .cse5))))))))) (or (and (forall ((|v_ULTIMATE.start_main_~ptr~0#1.offset_34| Int)) (or (< |v_ULTIMATE.start_main_~ptr~0#1.offset_34| 0) (forall ((v_ArrVal_2281 (Array Int Int)) (v_arrayElimCell_104 Int) (v_ArrVal_2284 (Array Int Int))) (let ((.cse18 (store (store |c_#memory_int#1| .cse6 v_ArrVal_2281) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_2284))) (or (= (select (select .cse18 v_arrayElimCell_104) |v_ULTIMATE.start_main_~ptr~0#1.offset_34|) |c_ULTIMATE.start_main_~uneq~0#1|) (forall ((v_arrayElimCell_106 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse18 v_arrayElimCell_106) |v_ULTIMATE.start_main_~ptr~0#1.offset_34|))) (not (= (store .cse19 .cse5 (select v_ArrVal_2284 .cse5)) v_ArrVal_2284))))))) (forall ((|v_ULTIMATE.start_main_~ptr~0#1.offset_34| Int)) (or (< |v_ULTIMATE.start_main_~ptr~0#1.offset_34| 0) (forall ((v_ArrVal_2281 (Array Int Int)) (v_arrayElimCell_106 Int) (v_ArrVal_2284 (Array Int Int))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (store |c_#memory_int#1| .cse6 v_ArrVal_2281) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_2284) v_arrayElimCell_106) |v_ULTIMATE.start_main_~ptr~0#1.offset_34|)) (not (= (store .cse19 .cse5 (select v_ArrVal_2284 .cse5)) v_ArrVal_2284))))))) .cse7) .cse12)) (or (and .cse8 (or .cse9 .cse3 .cse7) (or .cse3 (forall ((v_ArrVal_2281 (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.offset_34| Int) (v_arrayElimCell_106 Int) (v_ArrVal_2284 (Array Int Int))) (let ((.cse20 (store |c_#memory_int#1| .cse6 v_ArrVal_2281))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store .cse20 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_2284) v_arrayElimCell_106) |v_ULTIMATE.start_main_~ptr~0#1.offset_34|)) (not (= v_ArrVal_2284 (store (select .cse20 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) .cse5 (select v_ArrVal_2284 .cse5)))) (< |v_ULTIMATE.start_main_~ptr~0#1.offset_34| 0))))) .cse10 .cse11 .cse12) .cse2) (or (and (or (forall ((v_ArrVal_2281 (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.offset_34| Int) (v_arrayElimCell_106 Int) (v_ArrVal_2284 (Array Int Int))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (store |c_#memory_int#1| .cse6 v_ArrVal_2281) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_2284) v_arrayElimCell_106) |v_ULTIMATE.start_main_~ptr~0#1.offset_34|)) (< |v_ULTIMATE.start_main_~ptr~0#1.offset_34| 0) (< |c_ULTIMATE.start_sll_insert_~new_node~0#1.offset| |v_ULTIMATE.start_main_~ptr~0#1.offset_34|) (not (= (store .cse19 .cse5 (select v_ArrVal_2284 .cse5)) v_ArrVal_2284)))) .cse3) .cse0 .cse1) .cse7))))) is different from false [2025-01-09 22:45:24,046 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse21 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse0 (select |c_#memory_int#1| |c_ULTIMATE.start_sll_insert_#t~ret7#1.base|)) (.cse16 (= |c_ULTIMATE.start_sll_insert_#t~ret7#1.base| .cse21)) (.cse1 (+ 4 |c_ULTIMATE.start_sll_insert_#t~ret7#1.offset|)) (.cse2 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|))) (let ((.cse4 (or .cse16 (forall ((v_ArrVal_2281 (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.offset_34| Int) (v_arrayElimCell_104 Int) (v_ArrVal_2284 (Array Int Int))) (let ((.cse28 (store |c_#memory_int#1| .cse2 v_ArrVal_2281))) (or (< |v_ULTIMATE.start_main_~ptr~0#1.offset_34| 0) (< |c_ULTIMATE.start_sll_insert_#t~ret7#1.offset| |v_ULTIMATE.start_main_~ptr~0#1.offset_34|) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store .cse28 |c_ULTIMATE.start_sll_insert_#t~ret7#1.base| v_ArrVal_2284) v_arrayElimCell_104) |v_ULTIMATE.start_main_~ptr~0#1.offset_34|)) (not (= (store (select .cse28 |c_ULTIMATE.start_sll_insert_#t~ret7#1.base|) .cse1 (select v_ArrVal_2284 .cse1)) v_ArrVal_2284))))))) (.cse5 (forall ((|v_ULTIMATE.start_main_~ptr~0#1.offset_34| Int)) (or (< |v_ULTIMATE.start_main_~ptr~0#1.offset_34| 0) (< |c_ULTIMATE.start_sll_insert_#t~ret7#1.offset| |v_ULTIMATE.start_main_~ptr~0#1.offset_34|) (forall ((v_ArrVal_2281 (Array Int Int)) (v_arrayElimCell_104 Int) (v_ArrVal_2284 (Array Int Int))) (let ((.cse27 (store |c_#memory_int#1| .cse2 v_ArrVal_2281))) (let ((.cse26 (store .cse27 |c_ULTIMATE.start_sll_insert_#t~ret7#1.base| v_ArrVal_2284))) (or (forall ((v_arrayElimCell_106 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse26 v_arrayElimCell_106) |v_ULTIMATE.start_main_~ptr~0#1.offset_34|))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse26 v_arrayElimCell_104) |v_ULTIMATE.start_main_~ptr~0#1.offset_34|)) (not (= (store (select .cse27 |c_ULTIMATE.start_sll_insert_#t~ret7#1.base|) .cse1 (select v_ArrVal_2284 .cse1)) v_ArrVal_2284))))))))) (.cse10 (forall ((v_ArrVal_2281 (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.offset_34| Int) (v_arrayElimCell_106 Int) (v_ArrVal_2284 (Array Int Int))) (or (< |v_ULTIMATE.start_main_~ptr~0#1.offset_34| 0) (not (= (store .cse0 .cse1 (select v_ArrVal_2284 .cse1)) v_ArrVal_2284)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (store |c_#memory_int#1| .cse2 v_ArrVal_2281) |c_ULTIMATE.start_sll_insert_#t~ret7#1.base| v_ArrVal_2284) v_arrayElimCell_106) |v_ULTIMATE.start_main_~ptr~0#1.offset_34|))))) (.cse7 (forall ((|v_ULTIMATE.start_main_~ptr~0#1.offset_34| Int)) (or (< |v_ULTIMATE.start_main_~ptr~0#1.offset_34| 0) (forall ((v_ArrVal_2281 (Array Int Int)) (v_arrayElimCell_104 Int) (v_ArrVal_2284 (Array Int Int))) (let ((.cse25 (store |c_#memory_int#1| .cse2 v_ArrVal_2281))) (let ((.cse24 (store .cse25 |c_ULTIMATE.start_sll_insert_#t~ret7#1.base| v_ArrVal_2284))) (or (forall ((v_arrayElimCell_106 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse24 v_arrayElimCell_106) |v_ULTIMATE.start_main_~ptr~0#1.offset_34|))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse24 v_arrayElimCell_104) |v_ULTIMATE.start_main_~ptr~0#1.offset_34|)) (not (= (store (select .cse25 |c_ULTIMATE.start_sll_insert_#t~ret7#1.base|) .cse1 (select v_ArrVal_2284 .cse1)) v_ArrVal_2284))))))))) (.cse9 (or .cse16 (forall ((v_ArrVal_2281 (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.offset_34| Int) (v_DerPreprocessor_5 Int)) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select (store (select (store |c_#memory_int#1| .cse2 v_ArrVal_2281) |c_ULTIMATE.start_sll_insert_#t~ret7#1.base|) .cse1 v_DerPreprocessor_5) |v_ULTIMATE.start_main_~ptr~0#1.offset_34|)) (< |v_ULTIMATE.start_main_~ptr~0#1.offset_34| 0))))) (.cse11 (or .cse16 (forall ((v_ArrVal_2281 (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.offset_34| Int) (v_arrayElimCell_104 Int) (v_ArrVal_2284 (Array Int Int))) (let ((.cse23 (store |c_#memory_int#1| .cse2 v_ArrVal_2281))) (or (< |v_ULTIMATE.start_main_~ptr~0#1.offset_34| 0) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store .cse23 |c_ULTIMATE.start_sll_insert_#t~ret7#1.base| v_ArrVal_2284) v_arrayElimCell_104) |v_ULTIMATE.start_main_~ptr~0#1.offset_34|)) (not (= (store (select .cse23 |c_ULTIMATE.start_sll_insert_#t~ret7#1.base|) .cse1 (select v_ArrVal_2284 .cse1)) v_ArrVal_2284))))))) (.cse8 (forall ((|v_ULTIMATE.start_main_~ptr~0#1.offset_34| Int)) (or (< |v_ULTIMATE.start_main_~ptr~0#1.offset_34| 0) (forall ((v_ArrVal_2281 (Array Int Int)) (v_ArrVal_2284 (Array Int Int))) (let ((.cse22 (store |c_#memory_int#1| .cse2 v_ArrVal_2281))) (or (forall ((v_arrayElimCell_106 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store .cse22 |c_ULTIMATE.start_sll_insert_#t~ret7#1.base| v_ArrVal_2284) v_arrayElimCell_106) |v_ULTIMATE.start_main_~ptr~0#1.offset_34|))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select v_ArrVal_2284 |v_ULTIMATE.start_main_~ptr~0#1.offset_34|)) (not (= (store (select .cse22 |c_ULTIMATE.start_sll_insert_#t~ret7#1.base|) .cse1 (select v_ArrVal_2284 .cse1)) v_ArrVal_2284)))))))) (.cse13 (and (= |c_ULTIMATE.start_sll_insert_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_sll_insert_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|))) (.cse6 (= .cse2 .cse21)) (.cse3 (not .cse16))) (and (or (and (or (forall ((v_ArrVal_2281 (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.offset_34| Int) (v_arrayElimCell_106 Int) (v_ArrVal_2284 (Array Int Int))) (or (< |v_ULTIMATE.start_main_~ptr~0#1.offset_34| 0) (< |c_ULTIMATE.start_sll_insert_#t~ret7#1.offset| |v_ULTIMATE.start_main_~ptr~0#1.offset_34|) (not (= (store .cse0 .cse1 (select v_ArrVal_2284 .cse1)) v_ArrVal_2284)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (store |c_#memory_int#1| .cse2 v_ArrVal_2281) |c_ULTIMATE.start_sll_insert_#t~ret7#1.base| v_ArrVal_2284) v_arrayElimCell_106) |v_ULTIMATE.start_main_~ptr~0#1.offset_34|)))) .cse3) .cse4 .cse5) .cse6) (or (and .cse7 .cse8 .cse9 (or .cse10 .cse3) .cse11) .cse6) (or .cse3 (forall ((v_ArrVal_2281 (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.offset_34| Int) (v_arrayElimCell_106 Int) (v_ArrVal_2284 (Array Int Int))) (let ((.cse12 (store |c_#memory_int#1| .cse2 v_ArrVal_2281))) (or (< |v_ULTIMATE.start_main_~ptr~0#1.offset_34| 0) (< |c_ULTIMATE.start_sll_insert_#t~ret7#1.offset| |v_ULTIMATE.start_main_~ptr~0#1.offset_34|) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store .cse12 |c_ULTIMATE.start_sll_insert_#t~ret7#1.base| v_ArrVal_2284) v_arrayElimCell_106) |v_ULTIMATE.start_main_~ptr~0#1.offset_34|)) (not (= (store (select .cse12 |c_ULTIMATE.start_sll_insert_#t~ret7#1.base|) .cse1 (select v_ArrVal_2284 .cse1)) v_ArrVal_2284)))))) (or (and .cse4 .cse5) .cse13) (forall ((|v_ULTIMATE.start_main_~ptr~0#1.offset_34| Int)) (or (< |v_ULTIMATE.start_main_~ptr~0#1.offset_34| 0) (< |c_ULTIMATE.start_sll_insert_#t~ret7#1.offset| |v_ULTIMATE.start_main_~ptr~0#1.offset_34|) (forall ((v_ArrVal_2281 (Array Int Int)) (v_ArrVal_2284 (Array Int Int))) (let ((.cse14 (store |c_#memory_int#1| .cse2 v_ArrVal_2281))) (or (forall ((v_arrayElimCell_106 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store .cse14 |c_ULTIMATE.start_sll_insert_#t~ret7#1.base| v_ArrVal_2284) v_arrayElimCell_106) |v_ULTIMATE.start_main_~ptr~0#1.offset_34|))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select v_ArrVal_2284 |v_ULTIMATE.start_main_~ptr~0#1.offset_34|)) (not (= (store (select .cse14 |c_ULTIMATE.start_sll_insert_#t~ret7#1.base|) .cse1 (select v_ArrVal_2284 .cse1)) v_ArrVal_2284))))))) (or (and (or .cse10 .cse6 .cse3) .cse7 (or (forall ((v_ArrVal_2281 (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.offset_34| Int) (v_arrayElimCell_106 Int) (v_ArrVal_2284 (Array Int Int))) (let ((.cse15 (store |c_#memory_int#1| .cse2 v_ArrVal_2281))) (or (< |v_ULTIMATE.start_main_~ptr~0#1.offset_34| 0) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store .cse15 |c_ULTIMATE.start_sll_insert_#t~ret7#1.base| v_ArrVal_2284) v_arrayElimCell_106) |v_ULTIMATE.start_main_~ptr~0#1.offset_34|)) (not (= (store (select .cse15 |c_ULTIMATE.start_sll_insert_#t~ret7#1.base|) .cse1 (select v_ArrVal_2284 .cse1)) v_ArrVal_2284))))) .cse3) .cse8 .cse9 .cse11) .cse13) (or .cse16 (forall ((v_ArrVal_2281 (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.offset_34| Int)) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store |c_#memory_int#1| .cse2 v_ArrVal_2281) |c_ULTIMATE.start_sll_insert_#t~ret7#1.base|) |v_ULTIMATE.start_main_~ptr~0#1.offset_34|)) (< |v_ULTIMATE.start_main_~ptr~0#1.offset_34| 0) (< |c_ULTIMATE.start_sll_insert_#t~ret7#1.offset| |v_ULTIMATE.start_main_~ptr~0#1.offset_34|)))) (or (and (forall ((|v_ULTIMATE.start_main_~ptr~0#1.offset_34| Int)) (or (forall ((v_ArrVal_2281 (Array Int Int)) (v_arrayElimCell_106 Int) (v_ArrVal_2284 (Array Int Int))) (let ((.cse17 (store |c_#memory_int#1| .cse2 v_ArrVal_2281))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store .cse17 |c_ULTIMATE.start_sll_insert_#t~ret7#1.base| v_ArrVal_2284) v_arrayElimCell_106) |v_ULTIMATE.start_main_~ptr~0#1.offset_34|)) (not (= (store (select .cse17 |c_ULTIMATE.start_sll_insert_#t~ret7#1.base|) .cse1 (select v_ArrVal_2284 .cse1)) v_ArrVal_2284))))) (< |v_ULTIMATE.start_main_~ptr~0#1.offset_34| 0))) .cse8 (or .cse13 (forall ((v_ArrVal_2281 (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.offset_34| Int) (v_arrayElimCell_104 Int) (v_arrayElimCell_106 Int) (v_ArrVal_2284 (Array Int Int))) (let ((.cse19 (store |c_#memory_int#1| .cse2 v_ArrVal_2281))) (let ((.cse18 (store .cse19 |c_ULTIMATE.start_sll_insert_#t~ret7#1.base| v_ArrVal_2284))) (or (< |v_ULTIMATE.start_main_~ptr~0#1.offset_34| 0) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse18 v_arrayElimCell_104) |v_ULTIMATE.start_main_~ptr~0#1.offset_34|)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse18 v_arrayElimCell_106) |v_ULTIMATE.start_main_~ptr~0#1.offset_34|)) (not (= (store (select .cse19 |c_ULTIMATE.start_sll_insert_#t~ret7#1.base|) .cse1 (select v_ArrVal_2284 .cse1)) v_ArrVal_2284))))))) (or (and (forall ((|v_ULTIMATE.start_main_~ptr~0#1.offset_34| Int)) (or (< |v_ULTIMATE.start_main_~ptr~0#1.offset_34| 0) (forall ((v_ArrVal_2281 (Array Int Int)) (v_arrayElimCell_104 Int) (v_ArrVal_2284 (Array Int Int))) (let ((.cse20 (store (store |c_#memory_int#1| .cse2 v_ArrVal_2281) |c_ULTIMATE.start_sll_insert_#t~ret7#1.base| v_ArrVal_2284))) (or (forall ((v_arrayElimCell_106 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse20 v_arrayElimCell_106) |v_ULTIMATE.start_main_~ptr~0#1.offset_34|))) (not (= (store .cse0 .cse1 (select v_ArrVal_2284 .cse1)) v_ArrVal_2284)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse20 v_arrayElimCell_104) |v_ULTIMATE.start_main_~ptr~0#1.offset_34|))))))) (forall ((|v_ULTIMATE.start_main_~ptr~0#1.offset_34| Int)) (or (< |v_ULTIMATE.start_main_~ptr~0#1.offset_34| 0) (forall ((v_ArrVal_2281 (Array Int Int)) (v_arrayElimCell_106 Int) (v_ArrVal_2284 (Array Int Int))) (or (not (= (store .cse0 .cse1 (select v_ArrVal_2284 .cse1)) v_ArrVal_2284)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (store |c_#memory_int#1| .cse2 v_ArrVal_2281) |c_ULTIMATE.start_sll_insert_#t~ret7#1.base| v_ArrVal_2284) v_arrayElimCell_106) |v_ULTIMATE.start_main_~ptr~0#1.offset_34|))))))) .cse6)) .cse3))))) is different from false