./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/list-simple/sll2c_insert_equal.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/sll2c_insert_equal.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 8eaca07dd267d84d5b5f55ad6096951e873362e33b975be77e0f552bdb4e3bcb --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 22:42:26,944 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 22:42:26,992 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:42:26,999 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 22:42:26,999 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 22:42:27,025 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 22:42:27,026 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 22:42:27,026 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 22:42:27,026 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 22:42:27,026 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 22:42:27,026 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 22:42:27,027 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 22:42:27,027 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 22:42:27,027 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 22:42:27,027 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 22:42:27,028 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 22:42:27,028 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 22:42:27,028 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 22:42:27,028 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 22:42:27,028 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 22:42:27,028 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-01-09 22:42:27,028 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-01-09 22:42:27,028 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-01-09 22:42:27,028 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 22:42:27,028 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-09 22:42:27,028 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-09 22:42:27,028 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 22:42:27,029 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 22:42:27,029 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 22:42:27,029 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 22:42:27,029 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 22:42:27,029 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 22:42:27,029 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 22:42:27,029 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 22:42:27,029 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 22:42:27,030 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 22:42:27,030 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 22:42:27,030 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 22:42:27,030 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 22:42:27,030 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 22:42:27,030 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 22:42:27,030 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 22:42:27,030 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 22:42:27,030 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 22:42:27,030 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 22:42:27,030 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 22:42:27,030 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 22:42:27,030 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 -> 8eaca07dd267d84d5b5f55ad6096951e873362e33b975be77e0f552bdb4e3bcb [2025-01-09 22:42:27,265 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 22:42:27,274 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 22:42:27,276 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 22:42:27,278 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 22:42:27,278 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 22:42:27,279 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-simple/sll2c_insert_equal.i [2025-01-09 22:42:28,473 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b2cb2455e/7eb1dd596d394b9ba221b1b8d79a438c/FLAG0dfef68ef [2025-01-09 22:42:28,698 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 22:42:28,698 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/list-simple/sll2c_insert_equal.i [2025-01-09 22:42:28,707 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b2cb2455e/7eb1dd596d394b9ba221b1b8d79a438c/FLAG0dfef68ef [2025-01-09 22:42:28,721 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b2cb2455e/7eb1dd596d394b9ba221b1b8d79a438c [2025-01-09 22:42:28,723 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 22:42:28,724 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 22:42:28,725 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 22:42:28,725 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 22:42:28,729 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 22:42:28,730 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 10:42:28" (1/1) ... [2025-01-09 22:42:28,730 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@36ddc7ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:42:28, skipping insertion in model container [2025-01-09 22:42:28,731 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 10:42:28" (1/1) ... [2025-01-09 22:42:28,752 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 22:42:28,937 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 22:42:28,943 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 22:42:28,974 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 22:42:28,996 INFO L204 MainTranslator]: Completed translation [2025-01-09 22:42:28,997 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:42:28 WrapperNode [2025-01-09 22:42:28,998 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 22:42:28,999 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 22:42:29,000 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 22:42:29,000 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 22:42:29,005 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:42:28" (1/1) ... [2025-01-09 22:42:29,020 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:42:28" (1/1) ... [2025-01-09 22:42:29,036 INFO L138 Inliner]: procedures = 127, calls = 44, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 141 [2025-01-09 22:42:29,036 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 22:42:29,037 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 22:42:29,037 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 22:42:29,037 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 22:42:29,043 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:42:28" (1/1) ... [2025-01-09 22:42:29,043 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:42:28" (1/1) ... [2025-01-09 22:42:29,045 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:42:28" (1/1) ... [2025-01-09 22:42:29,063 INFO L175 MemorySlicer]: Split 25 memory accesses to 3 slices as follows [2, 9, 14]. 56 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 1, 0]. The 10 writes are split as follows [0, 1, 9]. [2025-01-09 22:42:29,063 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:42:28" (1/1) ... [2025-01-09 22:42:29,064 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:42:28" (1/1) ... [2025-01-09 22:42:29,073 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:42:28" (1/1) ... [2025-01-09 22:42:29,076 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:42:28" (1/1) ... [2025-01-09 22:42:29,078 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:42:28" (1/1) ... [2025-01-09 22:42:29,079 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:42:28" (1/1) ... [2025-01-09 22:42:29,080 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:42:28" (1/1) ... [2025-01-09 22:42:29,082 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 22:42:29,082 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 22:42:29,083 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 22:42:29,083 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 22:42:29,083 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:42:28" (1/1) ... [2025-01-09 22:42:29,090 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 22:42:29,099 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:42:29,115 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:42:29,122 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:42:29,144 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-09 22:42:29,145 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-09 22:42:29,145 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-01-09 22:42:29,145 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-09 22:42:29,145 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-09 22:42:29,145 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-01-09 22:42:29,145 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2025-01-09 22:42:29,145 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2025-01-09 22:42:29,145 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-09 22:42:29,145 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 22:42:29,145 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-01-09 22:42:29,145 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-01-09 22:42:29,145 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-01-09 22:42:29,145 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-01-09 22:42:29,146 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-01-09 22:42:29,146 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-01-09 22:42:29,146 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-01-09 22:42:29,146 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-09 22:42:29,146 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-01-09 22:42:29,146 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-01-09 22:42:29,146 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-01-09 22:42:29,146 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 22:42:29,146 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-09 22:42:29,146 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-09 22:42:29,146 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 22:42:29,146 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 22:42:29,255 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 22:42:29,257 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 22:42:29,540 INFO L? ?]: Removed 138 outVars from TransFormulas that were not future-live. [2025-01-09 22:42:29,540 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 22:42:29,553 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 22:42:29,554 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 22:42:29,554 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 10:42:29 BoogieIcfgContainer [2025-01-09 22:42:29,554 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 22:42:29,555 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 22:42:29,556 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 22:42:29,563 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 22:42:29,564 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 10:42:28" (1/3) ... [2025-01-09 22:42:29,564 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@324d0799 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 10:42:29, skipping insertion in model container [2025-01-09 22:42:29,565 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:42:28" (2/3) ... [2025-01-09 22:42:29,565 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@324d0799 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 10:42:29, skipping insertion in model container [2025-01-09 22:42:29,565 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 10:42:29" (3/3) ... [2025-01-09 22:42:29,566 INFO L128 eAbstractionObserver]: Analyzing ICFG sll2c_insert_equal.i [2025-01-09 22:42:29,578 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 22:42:29,580 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG sll2c_insert_equal.i that has 2 procedures, 124 locations, 1 initial locations, 4 loop locations, and 52 error locations. [2025-01-09 22:42:29,615 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 22:42:29,626 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;@38a75774, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 22:42:29,627 INFO L334 AbstractCegarLoop]: Starting to check reachability of 52 error locations. [2025-01-09 22:42:29,630 INFO L276 IsEmpty]: Start isEmpty. Operand has 124 states, 67 states have (on average 1.955223880597015) internal successors, (131), 119 states have internal predecessors, (131), 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:42:29,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-01-09 22:42:29,635 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:42:29,635 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-01-09 22:42:29,636 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting node_createErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2025-01-09 22:42:29,641 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:42:29,641 INFO L85 PathProgramCache]: Analyzing trace with hash 895059861, now seen corresponding path program 1 times [2025-01-09 22:42:29,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:42:29,647 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1921572124] [2025-01-09 22:42:29,648 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:42:29,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:42:29,711 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-09 22:42:29,728 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-09 22:42:29,729 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:42:29,729 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:42:29,841 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:42:29,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:42:29,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1921572124] [2025-01-09 22:42:29,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1921572124] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:42:29,843 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:42:29,843 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 22:42:29,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1558535249] [2025-01-09 22:42:29,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:42:29,848 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 22:42:29,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:42:29,866 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 22:42:29,866 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:42:29,868 INFO L87 Difference]: Start difference. First operand has 124 states, 67 states have (on average 1.955223880597015) internal successors, (131), 119 states have internal predecessors, (131), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:42:29,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:42:29,997 INFO L93 Difference]: Finished difference Result 121 states and 131 transitions. [2025-01-09 22:42:29,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 22:42:30,000 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2025-01-09 22:42:30,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:42:30,004 INFO L225 Difference]: With dead ends: 121 [2025-01-09 22:42:30,004 INFO L226 Difference]: Without dead ends: 118 [2025-01-09 22:42:30,005 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:42:30,007 INFO L435 NwaCegarLoop]: 124 mSDtfsCounter, 2 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 198 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:42:30,007 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 198 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:42:30,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2025-01-09 22:42:30,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2025-01-09 22:42:30,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 64 states have (on average 1.890625) internal successors, (121), 113 states have internal predecessors, (121), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-09 22:42:30,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 127 transitions. [2025-01-09 22:42:30,037 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 127 transitions. Word has length 6 [2025-01-09 22:42:30,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:42:30,037 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 127 transitions. [2025-01-09 22:42:30,037 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:42:30,037 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 127 transitions. [2025-01-09 22:42:30,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-01-09 22:42:30,037 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:42:30,037 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-01-09 22:42:30,038 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 22:42:30,038 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting node_createErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2025-01-09 22:42:30,038 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:42:30,038 INFO L85 PathProgramCache]: Analyzing trace with hash 895059862, now seen corresponding path program 1 times [2025-01-09 22:42:30,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:42:30,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261239837] [2025-01-09 22:42:30,039 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:42:30,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:42:30,047 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-09 22:42:30,055 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-09 22:42:30,055 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:42:30,055 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:42:30,159 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:42:30,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:42:30,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [261239837] [2025-01-09 22:42:30,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [261239837] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:42:30,161 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:42:30,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 22:42:30,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1868449523] [2025-01-09 22:42:30,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:42:30,162 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 22:42:30,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:42:30,163 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 22:42:30,163 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:42:30,163 INFO L87 Difference]: Start difference. First operand 118 states and 127 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:42:30,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:42:30,230 INFO L93 Difference]: Finished difference Result 116 states and 125 transitions. [2025-01-09 22:42:30,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 22:42:30,230 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2025-01-09 22:42:30,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:42:30,231 INFO L225 Difference]: With dead ends: 116 [2025-01-09 22:42:30,231 INFO L226 Difference]: Without dead ends: 116 [2025-01-09 22:42:30,231 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:42:30,231 INFO L435 NwaCegarLoop]: 121 mSDtfsCounter, 2 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:42:30,232 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 199 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:42:30,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2025-01-09 22:42:30,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2025-01-09 22:42:30,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 64 states have (on average 1.859375) internal successors, (119), 111 states have internal predecessors, (119), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-09 22:42:30,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 125 transitions. [2025-01-09 22:42:30,237 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 125 transitions. Word has length 6 [2025-01-09 22:42:30,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:42:30,237 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 125 transitions. [2025-01-09 22:42:30,237 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:42:30,237 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 125 transitions. [2025-01-09 22:42:30,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-01-09 22:42:30,238 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:42:30,238 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:42:30,238 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 22:42:30,238 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2025-01-09 22:42:30,238 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:42:30,238 INFO L85 PathProgramCache]: Analyzing trace with hash 100467820, now seen corresponding path program 1 times [2025-01-09 22:42:30,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:42:30,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [967754642] [2025-01-09 22:42:30,239 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:42:30,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:42:30,253 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-01-09 22:42:30,263 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-01-09 22:42:30,263 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:42:30,263 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:42:30,320 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:42:30,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:42:30,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [967754642] [2025-01-09 22:42:30,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [967754642] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:42:30,321 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:42:30,321 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 22:42:30,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1438923849] [2025-01-09 22:42:30,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:42:30,321 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 22:42:30,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:42:30,322 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 22:42:30,323 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:42:30,323 INFO L87 Difference]: Start difference. First operand 116 states and 125 transitions. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-09 22:42:30,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:42:30,335 INFO L93 Difference]: Finished difference Result 123 states and 133 transitions. [2025-01-09 22:42:30,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 22:42:30,336 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2025-01-09 22:42:30,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:42:30,336 INFO L225 Difference]: With dead ends: 123 [2025-01-09 22:42:30,336 INFO L226 Difference]: Without dead ends: 123 [2025-01-09 22:42:30,337 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:42:30,337 INFO L435 NwaCegarLoop]: 123 mSDtfsCounter, 5 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 241 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:42:30,337 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 241 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:42:30,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2025-01-09 22:42:30,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 117. [2025-01-09 22:42:30,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 65 states have (on average 1.8461538461538463) internal successors, (120), 112 states have internal predecessors, (120), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-09 22:42:30,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 126 transitions. [2025-01-09 22:42:30,347 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 126 transitions. Word has length 13 [2025-01-09 22:42:30,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:42:30,348 INFO L471 AbstractCegarLoop]: Abstraction has 117 states and 126 transitions. [2025-01-09 22:42:30,348 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-09 22:42:30,348 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 126 transitions. [2025-01-09 22:42:30,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-01-09 22:42:30,348 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:42:30,348 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:42:30,349 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 22:42:30,349 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2025-01-09 22:42:30,349 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:42:30,349 INFO L85 PathProgramCache]: Analyzing trace with hash -505531977, now seen corresponding path program 1 times [2025-01-09 22:42:30,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:42:30,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1737217717] [2025-01-09 22:42:30,349 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:42:30,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:42:30,359 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-01-09 22:42:30,365 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-01-09 22:42:30,365 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:42:30,365 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:42:30,485 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-09 22:42:30,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:42:30,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1737217717] [2025-01-09 22:42:30,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1737217717] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:42:30,486 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:42:30,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 22:42:30,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1494786330] [2025-01-09 22:42:30,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:42:30,486 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 22:42:30,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:42:30,487 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 22:42:30,487 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 22:42:30,487 INFO L87 Difference]: Start difference. First operand 117 states and 126 transitions. Second operand has 6 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 22:42:30,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:42:30,650 INFO L93 Difference]: Finished difference Result 116 states and 125 transitions. [2025-01-09 22:42:30,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 22:42:30,650 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 22 [2025-01-09 22:42:30,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:42:30,651 INFO L225 Difference]: With dead ends: 116 [2025-01-09 22:42:30,651 INFO L226 Difference]: Without dead ends: 116 [2025-01-09 22:42:30,651 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:42:30,651 INFO L435 NwaCegarLoop]: 116 mSDtfsCounter, 2 mSDsluCounter, 261 mSDsCounter, 0 mSdLazyCounter, 234 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 377 SdHoareTripleChecker+Invalid, 235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 234 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:42:30,652 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 377 Invalid, 235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 234 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:42:30,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2025-01-09 22:42:30,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2025-01-09 22:42:30,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 65 states have (on average 1.8307692307692307) internal successors, (119), 111 states have internal predecessors, (119), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-09 22:42:30,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 125 transitions. [2025-01-09 22:42:30,663 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 125 transitions. Word has length 22 [2025-01-09 22:42:30,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:42:30,664 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 125 transitions. [2025-01-09 22:42:30,664 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 22:42:30,664 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 125 transitions. [2025-01-09 22:42:30,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-01-09 22:42:30,664 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:42:30,664 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:42:30,664 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 22:42:30,664 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2025-01-09 22:42:30,665 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:42:30,665 INFO L85 PathProgramCache]: Analyzing trace with hash -505531976, now seen corresponding path program 1 times [2025-01-09 22:42:30,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:42:30,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [874311458] [2025-01-09 22:42:30,665 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:42:30,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:42:30,677 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-01-09 22:42:30,688 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-01-09 22:42:30,689 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:42:30,689 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:42:30,865 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 22:42:30,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:42:30,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [874311458] [2025-01-09 22:42:30,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [874311458] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:42:30,866 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:42:30,866 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 22:42:30,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2002702212] [2025-01-09 22:42:30,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:42:30,867 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 22:42:30,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:42:30,868 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 22:42:30,868 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 22:42:30,868 INFO L87 Difference]: Start difference. First operand 116 states and 125 transitions. Second operand has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 22:42:31,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:42:31,015 INFO L93 Difference]: Finished difference Result 115 states and 124 transitions. [2025-01-09 22:42:31,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 22:42:31,016 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 22 [2025-01-09 22:42:31,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:42:31,017 INFO L225 Difference]: With dead ends: 115 [2025-01-09 22:42:31,017 INFO L226 Difference]: Without dead ends: 115 [2025-01-09 22:42:31,017 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:42:31,017 INFO L435 NwaCegarLoop]: 116 mSDtfsCounter, 1 mSDsluCounter, 285 mSDsCounter, 0 mSdLazyCounter, 205 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 401 SdHoareTripleChecker+Invalid, 205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:42:31,018 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 401 Invalid, 205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 205 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:42:31,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2025-01-09 22:42:31,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2025-01-09 22:42:31,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 65 states have (on average 1.8153846153846154) internal successors, (118), 110 states have internal predecessors, (118), 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:42:31,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 124 transitions. [2025-01-09 22:42:31,022 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 124 transitions. Word has length 22 [2025-01-09 22:42:31,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:42:31,022 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 124 transitions. [2025-01-09 22:42:31,023 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 22:42:31,023 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 124 transitions. [2025-01-09 22:42:31,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-01-09 22:42:31,023 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:42:31,023 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:42:31,023 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 22:42:31,023 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2025-01-09 22:42:31,024 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:42:31,024 INFO L85 PathProgramCache]: Analyzing trace with hash 2147164442, now seen corresponding path program 1 times [2025-01-09 22:42:31,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:42:31,024 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [660214692] [2025-01-09 22:42:31,024 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:42:31,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:42:31,040 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-01-09 22:42:31,052 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-01-09 22:42:31,052 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:42:31,053 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:42:31,241 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 22:42:31,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:42:31,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [660214692] [2025-01-09 22:42:31,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [660214692] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:42:31,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [301329819] [2025-01-09 22:42:31,242 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:42:31,242 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:42:31,242 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:42:31,245 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:42:31,246 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:42:31,313 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-01-09 22:42:31,338 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-01-09 22:42:31,338 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:42:31,338 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:42:31,340 INFO L256 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-01-09 22:42:31,344 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:42:31,376 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:42:31,417 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:42:31,447 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2025-01-09 22:42:31,448 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:42:31,463 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 6 not checked. [2025-01-09 22:42:31,463 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:42:31,637 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 22:42:31,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [301329819] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 22:42:31,638 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 22:42:31,638 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 6] total 11 [2025-01-09 22:42:31,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1323526968] [2025-01-09 22:42:31,638 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 22:42:31,638 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-09 22:42:31,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:42:31,638 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-09 22:42:31,639 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=84, Unknown=1, NotChecked=18, Total=132 [2025-01-09 22:42:31,639 INFO L87 Difference]: Start difference. First operand 115 states and 124 transitions. Second operand has 12 states, 11 states have (on average 3.0) internal successors, (33), 10 states have internal predecessors, (33), 2 states have call successors, (3), 3 states have call predecessors, (3), 4 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-01-09 22:42:31,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:42:31,921 INFO L93 Difference]: Finished difference Result 114 states and 123 transitions. [2025-01-09 22:42:31,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 22:42:31,921 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.0) internal successors, (33), 10 states have internal predecessors, (33), 2 states have call successors, (3), 3 states have call predecessors, (3), 4 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 25 [2025-01-09 22:42:31,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:42:31,922 INFO L225 Difference]: With dead ends: 114 [2025-01-09 22:42:31,922 INFO L226 Difference]: Without dead ends: 114 [2025-01-09 22:42:31,922 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 45 SyntacticMatches, 4 SemanticMatches, 11 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=101, Unknown=1, NotChecked=20, Total=156 [2025-01-09 22:42:31,922 INFO L435 NwaCegarLoop]: 112 mSDtfsCounter, 2 mSDsluCounter, 503 mSDsCounter, 0 mSdLazyCounter, 441 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 615 SdHoareTripleChecker+Invalid, 561 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 441 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 116 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 22:42:31,923 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 615 Invalid, 561 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 441 Invalid, 0 Unknown, 116 Unchecked, 0.2s Time] [2025-01-09 22:42:31,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2025-01-09 22:42:31,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2025-01-09 22:42:31,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 65 states have (on average 1.8) internal successors, (117), 109 states have internal predecessors, (117), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-09 22:42:31,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 123 transitions. [2025-01-09 22:42:31,928 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 123 transitions. Word has length 25 [2025-01-09 22:42:31,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:42:31,928 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 123 transitions. [2025-01-09 22:42:31,928 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.0) internal successors, (33), 10 states have internal predecessors, (33), 2 states have call successors, (3), 3 states have call predecessors, (3), 4 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-01-09 22:42:31,928 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 123 transitions. [2025-01-09 22:42:31,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-01-09 22:42:31,928 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:42:31,928 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:42:31,937 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:42:32,131 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:42:32,132 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2025-01-09 22:42:32,132 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:42:32,132 INFO L85 PathProgramCache]: Analyzing trace with hash 2147164443, now seen corresponding path program 1 times [2025-01-09 22:42:32,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:42:32,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1759828294] [2025-01-09 22:42:32,132 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:42:32,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:42:32,147 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-01-09 22:42:32,154 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-01-09 22:42:32,155 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:42:32,155 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:42:32,475 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:42:32,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:42:32,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1759828294] [2025-01-09 22:42:32,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1759828294] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:42:32,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1356746551] [2025-01-09 22:42:32,476 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:42:32,476 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:42:32,476 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:42:32,477 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:42:32,479 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:42:32,554 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-01-09 22:42:32,578 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-01-09 22:42:32,578 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:42:32,578 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:42:32,579 INFO L256 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-01-09 22:42:32,581 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:42:32,589 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:42:32,706 WARN L873 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (= (store |c_old(#length)| |node_create_~temp~0#1.base| (select |c_#length| |node_create_~temp~0#1.base|)) |c_#length|) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) is different from true [2025-01-09 22:42:32,736 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 22:42:32,737 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-01-09 22:42:32,745 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-09 22:42:32,745 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-01-09 22:42:32,773 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2025-01-09 22:42:32,773 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:42:32,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1356746551] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:42:32,866 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 22:42:32,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 17 [2025-01-09 22:42:32,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [86555607] [2025-01-09 22:42:32,867 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 22:42:32,867 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-01-09 22:42:32,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:42:32,867 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-01-09 22:42:32,868 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=289, Unknown=1, NotChecked=34, Total=380 [2025-01-09 22:42:32,868 INFO L87 Difference]: Start difference. First operand 114 states and 123 transitions. Second operand has 18 states, 17 states have (on average 2.3529411764705883) internal successors, (40), 15 states have internal predecessors, (40), 3 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-01-09 22:42:33,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:42:33,256 INFO L93 Difference]: Finished difference Result 121 states and 133 transitions. [2025-01-09 22:42:33,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 22:42:33,256 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 2.3529411764705883) internal successors, (40), 15 states have internal predecessors, (40), 3 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 25 [2025-01-09 22:42:33,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:42:33,258 INFO L225 Difference]: With dead ends: 121 [2025-01-09 22:42:33,258 INFO L226 Difference]: Without dead ends: 121 [2025-01-09 22:42:33,258 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=69, Invalid=354, Unknown=1, NotChecked=38, Total=462 [2025-01-09 22:42:33,259 INFO L435 NwaCegarLoop]: 113 mSDtfsCounter, 4 mSDsluCounter, 577 mSDsCounter, 0 mSdLazyCounter, 627 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 690 SdHoareTripleChecker+Invalid, 760 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 627 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 127 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 22:42:33,259 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 690 Invalid, 760 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 627 Invalid, 0 Unknown, 127 Unchecked, 0.3s Time] [2025-01-09 22:42:33,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2025-01-09 22:42:33,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 120. [2025-01-09 22:42:33,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 70 states have (on average 1.7571428571428571) internal successors, (123), 114 states have internal predecessors, (123), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-01-09 22:42:33,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 131 transitions. [2025-01-09 22:42:33,269 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 131 transitions. Word has length 25 [2025-01-09 22:42:33,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:42:33,269 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 131 transitions. [2025-01-09 22:42:33,269 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 2.3529411764705883) internal successors, (40), 15 states have internal predecessors, (40), 3 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-01-09 22:42:33,269 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 131 transitions. [2025-01-09 22:42:33,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-01-09 22:42:33,270 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:42:33,270 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:42:33,278 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-01-09 22:42:33,471 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:42:33,472 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2025-01-09 22:42:33,472 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:42:33,472 INFO L85 PathProgramCache]: Analyzing trace with hash -150798860, now seen corresponding path program 1 times [2025-01-09 22:42:33,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:42:33,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [517411861] [2025-01-09 22:42:33,472 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:42:33,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:42:33,489 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-01-09 22:42:33,504 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-01-09 22:42:33,504 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:42:33,508 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:42:33,872 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-09 22:42:33,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:42:33,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [517411861] [2025-01-09 22:42:33,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [517411861] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:42:33,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [113617513] [2025-01-09 22:42:33,874 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:42:33,874 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:42:33,874 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:42:33,875 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:42:33,877 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:42:33,945 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-01-09 22:42:33,974 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-01-09 22:42:33,974 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:42:33,974 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:42:33,975 INFO L256 TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-01-09 22:42:33,977 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:42:33,982 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:42:34,005 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:42:34,016 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:42:34,054 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-01-09 22:42:34,056 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2025-01-09 22:42:34,069 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:42:34,076 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:42:34,106 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 22:42:34,107 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:42:34,122 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:42:34,139 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2025-01-09 22:42:34,140 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:42:34,161 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 18 not checked. [2025-01-09 22:42:34,161 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:42:34,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [113617513] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:42:34,308 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 22:42:34,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8] total 15 [2025-01-09 22:42:34,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1036081376] [2025-01-09 22:42:34,308 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 22:42:34,310 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-01-09 22:42:34,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:42:34,310 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-01-09 22:42:34,310 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=168, Unknown=3, NotChecked=84, Total=306 [2025-01-09 22:42:34,310 INFO L87 Difference]: Start difference. First operand 120 states and 131 transitions. Second operand has 16 states, 15 states have (on average 3.2666666666666666) internal successors, (49), 15 states have internal predecessors, (49), 2 states have call successors, (3), 1 states have call predecessors, (3), 6 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2025-01-09 22:42:34,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:42:34,644 INFO L93 Difference]: Finished difference Result 131 states and 143 transitions. [2025-01-09 22:42:34,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 22:42:34,644 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 3.2666666666666666) internal successors, (49), 15 states have internal predecessors, (49), 2 states have call successors, (3), 1 states have call predecessors, (3), 6 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) Word has length 37 [2025-01-09 22:42:34,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:42:34,645 INFO L225 Difference]: With dead ends: 131 [2025-01-09 22:42:34,645 INFO L226 Difference]: Without dead ends: 131 [2025-01-09 22:42:34,645 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 51 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=74, Invalid=241, Unknown=3, NotChecked=102, Total=420 [2025-01-09 22:42:34,645 INFO L435 NwaCegarLoop]: 58 mSDtfsCounter, 212 mSDsluCounter, 306 mSDsCounter, 0 mSdLazyCounter, 408 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 212 SdHoareTripleChecker+Valid, 364 SdHoareTripleChecker+Invalid, 804 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 408 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 384 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 22:42:34,646 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [212 Valid, 364 Invalid, 804 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 408 Invalid, 0 Unknown, 384 Unchecked, 0.3s Time] [2025-01-09 22:42:34,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2025-01-09 22:42:34,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 112. [2025-01-09 22:42:34,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 70 states have (on average 1.6428571428571428) internal successors, (115), 106 states have internal predecessors, (115), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-01-09 22:42:34,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 123 transitions. [2025-01-09 22:42:34,656 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 123 transitions. Word has length 37 [2025-01-09 22:42:34,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:42:34,656 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 123 transitions. [2025-01-09 22:42:34,657 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 3.2666666666666666) internal successors, (49), 15 states have internal predecessors, (49), 2 states have call successors, (3), 1 states have call predecessors, (3), 6 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2025-01-09 22:42:34,657 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 123 transitions. [2025-01-09 22:42:34,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-01-09 22:42:34,657 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:42:34,657 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:42:34,665 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-01-09 22:42:34,857 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:42:34,858 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2025-01-09 22:42:34,858 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:42:34,858 INFO L85 PathProgramCache]: Analyzing trace with hash -150798859, now seen corresponding path program 1 times [2025-01-09 22:42:34,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:42:34,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [850848192] [2025-01-09 22:42:34,859 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:42:34,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:42:34,871 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-01-09 22:42:34,890 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-01-09 22:42:34,890 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:42:34,890 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:42:35,324 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 22:42:35,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:42:35,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [850848192] [2025-01-09 22:42:35,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [850848192] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:42:35,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1440303334] [2025-01-09 22:42:35,324 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:42:35,324 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:42:35,325 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:42:35,326 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:42:35,330 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:42:35,395 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-01-09 22:42:35,427 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-01-09 22:42:35,427 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:42:35,428 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:42:35,429 INFO L256 TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-01-09 22:42:35,432 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:42:35,438 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:42:35,463 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:42:35,471 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:42:35,499 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 22:42:35,500 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:42:35,518 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:42:35,554 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 22:42:35,554 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:42:35,607 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:42:35,634 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 22:42:35,635 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:42:35,641 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-01-09 22:42:35,641 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 22:42:35,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1440303334] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:42:35,641 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 22:42:35,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [14] total 17 [2025-01-09 22:42:35,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [132516717] [2025-01-09 22:42:35,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:42:35,642 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 22:42:35,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:42:35,642 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 22:42:35,642 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=225, Unknown=1, NotChecked=30, Total=306 [2025-01-09 22:42:35,642 INFO L87 Difference]: Start difference. First operand 112 states and 123 transitions. Second operand has 7 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-01-09 22:42:35,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:42:35,764 INFO L93 Difference]: Finished difference Result 108 states and 119 transitions. [2025-01-09 22:42:35,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 22:42:35,764 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 37 [2025-01-09 22:42:35,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:42:35,765 INFO L225 Difference]: With dead ends: 108 [2025-01-09 22:42:35,765 INFO L226 Difference]: Without dead ends: 108 [2025-01-09 22:42:35,765 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 35 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:42:35,766 INFO L435 NwaCegarLoop]: 82 mSDtfsCounter, 34 mSDsluCounter, 206 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 288 SdHoareTripleChecker+Invalid, 313 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 138 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:42:35,766 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 288 Invalid, 313 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 171 Invalid, 0 Unknown, 138 Unchecked, 0.1s Time] [2025-01-09 22:42:35,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2025-01-09 22:42:35,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 107. [2025-01-09 22:42:35,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 70 states have (on average 1.5714285714285714) internal successors, (110), 101 states have internal predecessors, (110), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-01-09 22:42:35,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 118 transitions. [2025-01-09 22:42:35,769 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 118 transitions. Word has length 37 [2025-01-09 22:42:35,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:42:35,769 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 118 transitions. [2025-01-09 22:42:35,769 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-01-09 22:42:35,769 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 118 transitions. [2025-01-09 22:42:35,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-01-09 22:42:35,770 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:42:35,770 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:42:35,776 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:42:35,974 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:42:35,974 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2025-01-09 22:42:35,974 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:42:35,975 INFO L85 PathProgramCache]: Analyzing trace with hash 1589487817, now seen corresponding path program 2 times [2025-01-09 22:42:35,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:42:35,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1435538671] [2025-01-09 22:42:35,975 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 22:42:35,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:42:35,985 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 37 statements into 2 equivalence classes. [2025-01-09 22:42:35,995 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 37 of 37 statements. [2025-01-09 22:42:35,995 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 22:42:35,995 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:42:36,033 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-01-09 22:42:36,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:42:36,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1435538671] [2025-01-09 22:42:36,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1435538671] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:42:36,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [311077838] [2025-01-09 22:42:36,034 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 22:42:36,034 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:42:36,034 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:42:36,039 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:42:36,040 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:42:36,110 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 37 statements into 2 equivalence classes. [2025-01-09 22:42:36,139 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 37 of 37 statements. [2025-01-09 22:42:36,139 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 22:42:36,140 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:42:36,141 INFO L256 TraceCheckSpWp]: Trace formula consists of 310 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-09 22:42:36,142 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:42:36,155 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-01-09 22:42:36,155 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 22:42:36,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [311077838] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:42:36,155 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 22:42:36,155 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2025-01-09 22:42:36,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1921994310] [2025-01-09 22:42:36,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:42:36,156 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 22:42:36,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:42:36,156 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 22:42:36,156 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 22:42:36,156 INFO L87 Difference]: Start difference. First operand 107 states and 118 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-01-09 22:42:36,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:42:36,166 INFO L93 Difference]: Finished difference Result 100 states and 108 transitions. [2025-01-09 22:42:36,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 22:42:36,167 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 37 [2025-01-09 22:42:36,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:42:36,167 INFO L225 Difference]: With dead ends: 100 [2025-01-09 22:42:36,167 INFO L226 Difference]: Without dead ends: 100 [2025-01-09 22:42:36,167 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 22:42:36,168 INFO L435 NwaCegarLoop]: 105 mSDtfsCounter, 0 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 206 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:42:36,168 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 206 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:42:36,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2025-01-09 22:42:36,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2025-01-09 22:42:36,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 65 states have (on average 1.5692307692307692) internal successors, (102), 95 states have internal predecessors, (102), 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:42:36,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 108 transitions. [2025-01-09 22:42:36,170 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 108 transitions. Word has length 37 [2025-01-09 22:42:36,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:42:36,170 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 108 transitions. [2025-01-09 22:42:36,170 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-01-09 22:42:36,170 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 108 transitions. [2025-01-09 22:42:36,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-01-09 22:42:36,171 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:42:36,171 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:42:36,177 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:42:36,372 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:42:36,372 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2025-01-09 22:42:36,373 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:42:36,373 INFO L85 PathProgramCache]: Analyzing trace with hash 86951499, now seen corresponding path program 1 times [2025-01-09 22:42:36,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:42:36,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [846768254] [2025-01-09 22:42:36,373 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:42:36,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:42:36,384 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-01-09 22:42:36,391 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-01-09 22:42:36,391 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:42:36,391 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:42:36,629 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 17 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 22:42:36,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:42:36,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [846768254] [2025-01-09 22:42:36,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [846768254] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:42:36,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1941904641] [2025-01-09 22:42:36,629 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:42:36,629 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:42:36,629 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:42:36,631 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:42:36,632 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:42:36,706 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-01-09 22:42:36,830 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-01-09 22:42:36,830 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:42:36,830 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:42:36,832 INFO L256 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 35 conjuncts are in the unsatisfiable core [2025-01-09 22:42:36,837 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:42:36,856 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:42:36,951 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:42:36,956 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:42:36,987 INFO L349 Elim1Store]: treesize reduction 32, result has 36.0 percent of original size [2025-01-09 22:42:36,988 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:42:36,994 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:42:36,997 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 6 not checked. [2025-01-09 22:42:36,998 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:42:37,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1941904641] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:42:37,040 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 22:42:37,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 21 [2025-01-09 22:42:37,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1980792277] [2025-01-09 22:42:37,040 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 22:42:37,040 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-01-09 22:42:37,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:42:37,041 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-01-09 22:42:37,041 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=406, Unknown=1, NotChecked=40, Total=506 [2025-01-09 22:42:37,041 INFO L87 Difference]: Start difference. First operand 100 states and 108 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, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2025-01-09 22:42:37,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:42:37,494 INFO L93 Difference]: Finished difference Result 127 states and 139 transitions. [2025-01-09 22:42:37,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-09 22:42:37,495 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, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 40 [2025-01-09 22:42:37,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:42:37,496 INFO L225 Difference]: With dead ends: 127 [2025-01-09 22:42:37,496 INFO L226 Difference]: Without dead ends: 127 [2025-01-09 22:42:37,497 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=96, Invalid=663, Unknown=1, NotChecked=52, Total=812 [2025-01-09 22:42:37,497 INFO L435 NwaCegarLoop]: 71 mSDtfsCounter, 232 mSDsluCounter, 758 mSDsCounter, 0 mSdLazyCounter, 841 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 232 SdHoareTripleChecker+Valid, 829 SdHoareTripleChecker+Invalid, 978 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 841 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 133 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 22:42:37,497 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [232 Valid, 829 Invalid, 978 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 841 Invalid, 0 Unknown, 133 Unchecked, 0.4s Time] [2025-01-09 22:42:37,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2025-01-09 22:42:37,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 102. [2025-01-09 22:42:37,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 67 states have (on average 1.5820895522388059) internal successors, (106), 97 states have internal predecessors, (106), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-09 22:42:37,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 112 transitions. [2025-01-09 22:42:37,500 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 112 transitions. Word has length 40 [2025-01-09 22:42:37,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:42:37,500 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 112 transitions. [2025-01-09 22:42:37,501 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, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2025-01-09 22:42:37,501 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 112 transitions. [2025-01-09 22:42:37,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-01-09 22:42:37,503 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:42:37,503 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:42:37,512 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:42:37,703 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-01-09 22:42:37,703 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2025-01-09 22:42:37,704 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:42:37,704 INFO L85 PathProgramCache]: Analyzing trace with hash 86951500, now seen corresponding path program 1 times [2025-01-09 22:42:37,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:42:37,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [669496626] [2025-01-09 22:42:37,704 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:42:37,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:42:37,717 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-01-09 22:42:37,729 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-01-09 22:42:37,729 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:42:37,729 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:42:38,044 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 15 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 22:42:38,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:42:38,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [669496626] [2025-01-09 22:42:38,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [669496626] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:42:38,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [716334097] [2025-01-09 22:42:38,044 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:42:38,044 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:42:38,044 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:42:38,046 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:42:38,048 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:42:38,123 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-01-09 22:42:38,227 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-01-09 22:42:38,228 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:42:38,228 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:42:38,230 INFO L256 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 59 conjuncts are in the unsatisfiable core [2025-01-09 22:42:38,234 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:42:38,254 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:42:38,259 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:42:38,474 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:42:38,476 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:42:38,506 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_sll_circular_insert_~head#1.base_BEFORE_CALL_5| Int)) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_5|) 0) 0))) is different from true [2025-01-09 22:42:38,535 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 22:42:38,536 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:42:38,541 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2025-01-09 22:42:38,541 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:42:38,586 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:42:38,629 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 6 not checked. [2025-01-09 22:42:38,629 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:42:38,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [716334097] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:42:38,791 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 22:42:38,792 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 26 [2025-01-09 22:42:38,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1357389382] [2025-01-09 22:42:38,792 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 22:42:38,792 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-01-09 22:42:38,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:42:38,793 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-01-09 22:42:38,793 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=795, Unknown=1, NotChecked=56, Total=930 [2025-01-09 22:42:38,794 INFO L87 Difference]: Start difference. First operand 102 states and 112 transitions. Second operand has 27 states, 25 states have (on average 2.44) internal successors, (61), 23 states have internal predecessors, (61), 4 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2025-01-09 22:42:39,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:42:39,680 INFO L93 Difference]: Finished difference Result 134 states and 144 transitions. [2025-01-09 22:42:39,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-01-09 22:42:39,681 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 25 states have (on average 2.44) internal successors, (61), 23 states have internal predecessors, (61), 4 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 40 [2025-01-09 22:42:39,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:42:39,681 INFO L225 Difference]: With dead ends: 134 [2025-01-09 22:42:39,681 INFO L226 Difference]: Without dead ends: 134 [2025-01-09 22:42:39,682 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 182 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=164, Invalid=1645, Unknown=1, NotChecked=82, Total=1892 [2025-01-09 22:42:39,682 INFO L435 NwaCegarLoop]: 73 mSDtfsCounter, 228 mSDsluCounter, 1061 mSDsCounter, 0 mSdLazyCounter, 1166 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 228 SdHoareTripleChecker+Valid, 1134 SdHoareTripleChecker+Invalid, 1307 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 138 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 22:42:39,682 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [228 Valid, 1134 Invalid, 1307 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1166 Invalid, 0 Unknown, 138 Unchecked, 0.6s Time] [2025-01-09 22:42:39,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2025-01-09 22:42:39,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 109. [2025-01-09 22:42:39,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 73 states have (on average 1.5205479452054795) internal successors, (111), 103 states have internal predecessors, (111), 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:42:39,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 117 transitions. [2025-01-09 22:42:39,686 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 117 transitions. Word has length 40 [2025-01-09 22:42:39,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:42:39,686 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 117 transitions. [2025-01-09 22:42:39,686 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 25 states have (on average 2.44) internal successors, (61), 23 states have internal predecessors, (61), 4 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2025-01-09 22:42:39,686 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 117 transitions. [2025-01-09 22:42:39,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-01-09 22:42:39,689 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:42:39,689 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:42:39,696 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:42:39,894 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:42:39,894 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2025-01-09 22:42:39,895 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:42:39,895 INFO L85 PathProgramCache]: Analyzing trace with hash -1599464801, now seen corresponding path program 1 times [2025-01-09 22:42:39,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:42:39,896 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [578972056] [2025-01-09 22:42:39,896 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:42:39,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:42:39,913 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-01-09 22:42:39,919 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-01-09 22:42:39,920 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:42:39,920 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:42:39,940 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-01-09 22:42:39,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:42:39,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [578972056] [2025-01-09 22:42:39,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [578972056] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:42:39,941 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:42:39,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 22:42:39,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [887939600] [2025-01-09 22:42:39,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:42:39,941 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 22:42:39,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:42:39,942 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 22:42:39,942 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:42:39,942 INFO L87 Difference]: Start difference. First operand 109 states and 117 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-09 22:42:39,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:42:39,953 INFO L93 Difference]: Finished difference Result 110 states and 118 transitions. [2025-01-09 22:42:39,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 22:42:39,953 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 41 [2025-01-09 22:42:39,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:42:39,954 INFO L225 Difference]: With dead ends: 110 [2025-01-09 22:42:39,954 INFO L226 Difference]: Without dead ends: 110 [2025-01-09 22:42:39,954 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:42:39,954 INFO L435 NwaCegarLoop]: 107 mSDtfsCounter, 0 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 204 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:42:39,956 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 204 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:42:39,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2025-01-09 22:42:39,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2025-01-09 22:42:39,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 74 states have (on average 1.5135135135135136) internal successors, (112), 104 states have internal predecessors, (112), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-09 22:42:39,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 118 transitions. [2025-01-09 22:42:39,958 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 118 transitions. Word has length 41 [2025-01-09 22:42:39,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:42:39,958 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 118 transitions. [2025-01-09 22:42:39,958 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-09 22:42:39,958 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 118 transitions. [2025-01-09 22:42:39,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-01-09 22:42:39,959 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:42:39,959 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:42:39,959 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 22:42:39,959 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2025-01-09 22:42:39,959 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:42:39,959 INFO L85 PathProgramCache]: Analyzing trace with hash 506833052, now seen corresponding path program 1 times [2025-01-09 22:42:39,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:42:39,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1311739256] [2025-01-09 22:42:39,959 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:42:39,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:42:39,970 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-01-09 22:42:39,975 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-01-09 22:42:39,976 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:42:39,976 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:42:40,059 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-01-09 22:42:40,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:42:40,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1311739256] [2025-01-09 22:42:40,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1311739256] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:42:40,060 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:42:40,060 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 22:42:40,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1835982482] [2025-01-09 22:42:40,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:42:40,061 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 22:42:40,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:42:40,061 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 22:42:40,061 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 22:42:40,061 INFO L87 Difference]: Start difference. First operand 110 states and 118 transitions. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-01-09 22:42:40,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:42:40,080 INFO L93 Difference]: Finished difference Result 111 states and 117 transitions. [2025-01-09 22:42:40,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 22:42:40,080 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 43 [2025-01-09 22:42:40,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:42:40,081 INFO L225 Difference]: With dead ends: 111 [2025-01-09 22:42:40,081 INFO L226 Difference]: Without dead ends: 111 [2025-01-09 22:42:40,081 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:42:40,081 INFO L435 NwaCegarLoop]: 100 mSDtfsCounter, 53 mSDsluCounter, 234 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 334 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 22:42:40,081 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 334 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:42:40,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2025-01-09 22:42:40,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 107. [2025-01-09 22:42:40,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 73 states have (on average 1.4794520547945205) internal successors, (108), 101 states have internal predecessors, (108), 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:42:40,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 114 transitions. [2025-01-09 22:42:40,083 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 114 transitions. Word has length 43 [2025-01-09 22:42:40,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:42:40,085 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 114 transitions. [2025-01-09 22:42:40,085 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-01-09 22:42:40,085 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 114 transitions. [2025-01-09 22:42:40,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-01-09 22:42:40,086 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:42:40,086 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:42:40,087 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 22:42:40,087 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2025-01-09 22:42:40,087 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:42:40,087 INFO L85 PathProgramCache]: Analyzing trace with hash 512865536, now seen corresponding path program 1 times [2025-01-09 22:42:40,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:42:40,087 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2099754020] [2025-01-09 22:42:40,087 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:42:40,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:42:40,098 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-01-09 22:42:40,103 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-01-09 22:42:40,104 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:42:40,104 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:42:40,152 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-01-09 22:42:40,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:42:40,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2099754020] [2025-01-09 22:42:40,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2099754020] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:42:40,152 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:42:40,152 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 22:42:40,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1892796415] [2025-01-09 22:42:40,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:42:40,153 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 22:42:40,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:42:40,153 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 22:42:40,153 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 22:42:40,153 INFO L87 Difference]: Start difference. First operand 107 states and 114 transitions. Second operand has 6 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-09 22:42:40,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:42:40,247 INFO L93 Difference]: Finished difference Result 104 states and 111 transitions. [2025-01-09 22:42:40,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 22:42:40,247 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 43 [2025-01-09 22:42:40,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:42:40,248 INFO L225 Difference]: With dead ends: 104 [2025-01-09 22:42:40,248 INFO L226 Difference]: Without dead ends: 104 [2025-01-09 22:42:40,248 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:42:40,248 INFO L435 NwaCegarLoop]: 82 mSDtfsCounter, 18 mSDsluCounter, 211 mSDsCounter, 0 mSdLazyCounter, 191 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 293 SdHoareTripleChecker+Invalid, 194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:42:40,248 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 293 Invalid, 194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 191 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:42:40,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2025-01-09 22:42:40,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2025-01-09 22:42:40,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 73 states have (on average 1.4383561643835616) internal successors, (105), 98 states have internal predecessors, (105), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-09 22:42:40,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 111 transitions. [2025-01-09 22:42:40,250 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 111 transitions. Word has length 43 [2025-01-09 22:42:40,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:42:40,252 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 111 transitions. [2025-01-09 22:42:40,252 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-09 22:42:40,252 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 111 transitions. [2025-01-09 22:42:40,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-01-09 22:42:40,253 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:42:40,253 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:42:40,253 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 22:42:40,253 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2025-01-09 22:42:40,253 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:42:40,253 INFO L85 PathProgramCache]: Analyzing trace with hash 512865537, now seen corresponding path program 1 times [2025-01-09 22:42:40,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:42:40,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [518990816] [2025-01-09 22:42:40,254 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:42:40,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:42:40,263 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-01-09 22:42:40,269 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-01-09 22:42:40,270 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:42:40,270 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:42:40,343 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-01-09 22:42:40,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:42:40,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [518990816] [2025-01-09 22:42:40,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [518990816] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:42:40,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1485121535] [2025-01-09 22:42:40,343 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:42:40,344 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:42:40,344 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:42:40,345 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:42:40,347 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:42:40,432 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-01-09 22:42:40,464 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-01-09 22:42:40,465 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:42:40,465 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:42:40,466 INFO L256 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-09 22:42:40,468 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:42:40,502 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-01-09 22:42:40,502 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 22:42:40,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1485121535] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:42:40,502 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 22:42:40,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 5 [2025-01-09 22:42:40,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004676163] [2025-01-09 22:42:40,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:42:40,503 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 22:42:40,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:42:40,503 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 22:42:40,503 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 22:42:40,503 INFO L87 Difference]: Start difference. First operand 104 states and 111 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-01-09 22:42:40,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:42:40,517 INFO L93 Difference]: Finished difference Result 107 states and 112 transitions. [2025-01-09 22:42:40,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 22:42:40,518 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 43 [2025-01-09 22:42:40,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:42:40,518 INFO L225 Difference]: With dead ends: 107 [2025-01-09 22:42:40,518 INFO L226 Difference]: Without dead ends: 107 [2025-01-09 22:42:40,518 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:42:40,519 INFO L435 NwaCegarLoop]: 98 mSDtfsCounter, 52 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 231 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 22:42:40,519 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 231 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:42:40,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2025-01-09 22:42:40,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 103. [2025-01-09 22:42:40,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 72 states have (on average 1.4305555555555556) internal successors, (103), 97 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:42:40,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 109 transitions. [2025-01-09 22:42:40,521 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 109 transitions. Word has length 43 [2025-01-09 22:42:40,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:42:40,521 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 109 transitions. [2025-01-09 22:42:40,521 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-01-09 22:42:40,521 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 109 transitions. [2025-01-09 22:42:40,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-01-09 22:42:40,521 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:42:40,521 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:42:40,528 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-01-09 22:42:40,726 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-01-09 22:42:40,727 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2025-01-09 22:42:40,727 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:42:40,727 INFO L85 PathProgramCache]: Analyzing trace with hash -1468038546, now seen corresponding path program 1 times [2025-01-09 22:42:40,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:42:40,728 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [488742719] [2025-01-09 22:42:40,728 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:42:40,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:42:40,752 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-01-09 22:42:40,757 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-01-09 22:42:40,757 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:42:40,757 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:42:40,785 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-01-09 22:42:40,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:42:40,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [488742719] [2025-01-09 22:42:40,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [488742719] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:42:40,785 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:42:40,785 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 22:42:40,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820622168] [2025-01-09 22:42:40,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:42:40,786 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 22:42:40,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:42:40,787 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 22:42:40,787 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 22:42:40,787 INFO L87 Difference]: Start difference. First operand 103 states and 109 transitions. Second operand has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-09 22:42:40,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:42:40,838 INFO L93 Difference]: Finished difference Result 102 states and 108 transitions. [2025-01-09 22:42:40,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 22:42:40,839 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 44 [2025-01-09 22:42:40,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:42:40,839 INFO L225 Difference]: With dead ends: 102 [2025-01-09 22:42:40,840 INFO L226 Difference]: Without dead ends: 102 [2025-01-09 22:42:40,840 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:42:40,840 INFO L435 NwaCegarLoop]: 97 mSDtfsCounter, 0 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 211 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 22:42:40,840 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 211 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:42:40,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2025-01-09 22:42:40,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2025-01-09 22:42:40,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 72 states have (on average 1.4166666666666667) internal successors, (102), 96 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:42:40,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 108 transitions. [2025-01-09 22:42:40,842 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 108 transitions. Word has length 44 [2025-01-09 22:42:40,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:42:40,842 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 108 transitions. [2025-01-09 22:42:40,843 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-09 22:42:40,843 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 108 transitions. [2025-01-09 22:42:40,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-01-09 22:42:40,843 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:42:40,843 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:42:40,843 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 22:42:40,843 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2025-01-09 22:42:40,844 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:42:40,844 INFO L85 PathProgramCache]: Analyzing trace with hash -1468038545, now seen corresponding path program 1 times [2025-01-09 22:42:40,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:42:40,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [555350355] [2025-01-09 22:42:40,844 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:42:40,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:42:40,854 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-01-09 22:42:40,863 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-01-09 22:42:40,864 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:42:40,864 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:42:41,217 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 15 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 22:42:41,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:42:41,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [555350355] [2025-01-09 22:42:41,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [555350355] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:42:41,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1453340526] [2025-01-09 22:42:41,217 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:42:41,217 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:42:41,218 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:42:41,219 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:42:41,221 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:42:41,310 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-01-09 22:42:41,362 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-01-09 22:42:41,362 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:42:41,362 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:42:41,364 INFO L256 TraceCheckSpWp]: Trace formula consists of 364 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-01-09 22:42:41,365 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:42:41,408 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-01-09 22:42:41,408 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 22:42:41,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1453340526] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:42:41,408 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 22:42:41,408 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [15] total 17 [2025-01-09 22:42:41,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [706564163] [2025-01-09 22:42:41,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:42:41,408 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 22:42:41,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:42:41,409 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 22:42:41,409 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=268, Unknown=0, NotChecked=0, Total=306 [2025-01-09 22:42:41,409 INFO L87 Difference]: Start difference. First operand 102 states and 108 transitions. Second operand has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-09 22:42:41,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:42:41,452 INFO L93 Difference]: Finished difference Result 101 states and 107 transitions. [2025-01-09 22:42:41,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 22:42:41,453 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 44 [2025-01-09 22:42:41,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:42:41,453 INFO L225 Difference]: With dead ends: 101 [2025-01-09 22:42:41,454 INFO L226 Difference]: Without dead ends: 101 [2025-01-09 22:42:41,454 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=38, Invalid=268, Unknown=0, NotChecked=0, Total=306 [2025-01-09 22:42:41,454 INFO L435 NwaCegarLoop]: 97 mSDtfsCounter, 0 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 244 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 22:42:41,454 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 244 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:42:41,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2025-01-09 22:42:41,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2025-01-09 22:42:41,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 72 states have (on average 1.4027777777777777) internal successors, (101), 95 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:42:41,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 107 transitions. [2025-01-09 22:42:41,456 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 107 transitions. Word has length 44 [2025-01-09 22:42:41,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:42:41,456 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 107 transitions. [2025-01-09 22:42:41,457 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-09 22:42:41,457 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 107 transitions. [2025-01-09 22:42:41,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-01-09 22:42:41,457 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:42:41,457 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:42:41,464 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:42:41,657 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-01-09 22:42:41,657 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2025-01-09 22:42:41,658 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:42:41,658 INFO L85 PathProgramCache]: Analyzing trace with hash 1735445346, now seen corresponding path program 1 times [2025-01-09 22:42:41,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:42:41,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [852572371] [2025-01-09 22:42:41,658 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:42:41,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:42:41,668 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-01-09 22:42:41,673 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-01-09 22:42:41,673 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:42:41,673 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:42:41,761 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-01-09 22:42:41,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:42:41,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [852572371] [2025-01-09 22:42:41,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [852572371] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:42:41,762 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:42:41,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 22:42:41,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1258329312] [2025-01-09 22:42:41,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:42:41,762 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 22:42:41,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:42:41,763 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 22:42:41,763 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 22:42:41,763 INFO L87 Difference]: Start difference. First operand 101 states and 107 transitions. Second operand has 6 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-09 22:42:41,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:42:41,847 INFO L93 Difference]: Finished difference Result 98 states and 104 transitions. [2025-01-09 22:42:41,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 22:42:41,847 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 45 [2025-01-09 22:42:41,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:42:41,847 INFO L225 Difference]: With dead ends: 98 [2025-01-09 22:42:41,848 INFO L226 Difference]: Without dead ends: 98 [2025-01-09 22:42:41,848 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:42:41,848 INFO L435 NwaCegarLoop]: 81 mSDtfsCounter, 13 mSDsluCounter, 220 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 301 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:42:41,848 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 301 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:42:41,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2025-01-09 22:42:41,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2025-01-09 22:42:41,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 72 states have (on average 1.3611111111111112) internal successors, (98), 92 states have internal predecessors, (98), 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:42:41,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 104 transitions. [2025-01-09 22:42:41,850 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 104 transitions. Word has length 45 [2025-01-09 22:42:41,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:42:41,851 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 104 transitions. [2025-01-09 22:42:41,851 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-09 22:42:41,851 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 104 transitions. [2025-01-09 22:42:41,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-01-09 22:42:41,851 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:42:41,851 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:42:41,851 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-09 22:42:41,851 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2025-01-09 22:42:41,852 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:42:41,852 INFO L85 PathProgramCache]: Analyzing trace with hash 1315667299, now seen corresponding path program 1 times [2025-01-09 22:42:41,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:42:41,852 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [541117798] [2025-01-09 22:42:41,852 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:42:41,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:42:41,863 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-01-09 22:42:41,868 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-01-09 22:42:41,868 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:42:41,868 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:42:41,952 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-01-09 22:42:41,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:42:41,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [541117798] [2025-01-09 22:42:41,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [541117798] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:42:41,953 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:42:41,953 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 22:42:41,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1686752155] [2025-01-09 22:42:41,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:42:41,953 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 22:42:41,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:42:41,954 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 22:42:41,954 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-01-09 22:42:41,954 INFO L87 Difference]: Start difference. First operand 98 states and 104 transitions. Second operand has 6 states, 4 states have (on average 7.25) internal successors, (29), 6 states have internal predecessors, (29), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-01-09 22:42:42,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:42:42,009 INFO L93 Difference]: Finished difference Result 96 states and 102 transitions. [2025-01-09 22:42:42,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 22:42:42,009 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 7.25) internal successors, (29), 6 states have internal predecessors, (29), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 47 [2025-01-09 22:42:42,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:42:42,009 INFO L225 Difference]: With dead ends: 96 [2025-01-09 22:42:42,010 INFO L226 Difference]: Without dead ends: 96 [2025-01-09 22:42:42,010 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:42:42,010 INFO L435 NwaCegarLoop]: 75 mSDtfsCounter, 78 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 191 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 22:42:42,010 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 191 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:42:42,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2025-01-09 22:42:42,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 95. [2025-01-09 22:42:42,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 72 states have (on average 1.3194444444444444) internal successors, (95), 89 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:42:42,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 101 transitions. [2025-01-09 22:42:42,012 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 101 transitions. Word has length 47 [2025-01-09 22:42:42,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:42:42,013 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 101 transitions. [2025-01-09 22:42:42,013 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 7.25) internal successors, (29), 6 states have internal predecessors, (29), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-01-09 22:42:42,013 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 101 transitions. [2025-01-09 22:42:42,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-01-09 22:42:42,013 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:42:42,013 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:42:42,013 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-01-09 22:42:42,013 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2025-01-09 22:42:42,013 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:42:42,014 INFO L85 PathProgramCache]: Analyzing trace with hash 1635890086, now seen corresponding path program 1 times [2025-01-09 22:42:42,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:42:42,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [273624253] [2025-01-09 22:42:42,014 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:42:42,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:42:42,025 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-01-09 22:42:42,029 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-01-09 22:42:42,029 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:42:42,029 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:42:42,143 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-01-09 22:42:42,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:42:42,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [273624253] [2025-01-09 22:42:42,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [273624253] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:42:42,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2111824528] [2025-01-09 22:42:42,143 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:42:42,143 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:42:42,143 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:42:42,145 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:42:42,146 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:42:42,262 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-01-09 22:42:42,294 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-01-09 22:42:42,294 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:42:42,294 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:42:42,296 INFO L256 TraceCheckSpWp]: Trace formula consists of 411 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-01-09 22:42:42,297 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:42:42,299 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:42:42,353 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:42:42,368 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:42:42,392 INFO L349 Elim1Store]: treesize reduction 32, result has 36.0 percent of original size [2025-01-09 22:42:42,392 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:42:42,407 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:42:42,409 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 6 not checked. [2025-01-09 22:42:42,409 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:42:42,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2111824528] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:42:42,458 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 22:42:42,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 12] total 15 [2025-01-09 22:42:42,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [918997113] [2025-01-09 22:42:42,458 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 22:42:42,459 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-01-09 22:42:42,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:42:42,459 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-01-09 22:42:42,459 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=211, Unknown=1, NotChecked=28, Total=272 [2025-01-09 22:42:42,459 INFO L87 Difference]: Start difference. First operand 95 states and 101 transitions. Second operand has 16 states, 15 states have (on average 3.6666666666666665) internal successors, (55), 14 states have internal predecessors, (55), 3 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2025-01-09 22:42:42,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:42:42,762 INFO L93 Difference]: Finished difference Result 121 states and 128 transitions. [2025-01-09 22:42:42,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-01-09 22:42:42,762 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 3.6666666666666665) internal successors, (55), 14 states have internal predecessors, (55), 3 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) Word has length 49 [2025-01-09 22:42:42,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:42:42,763 INFO L225 Difference]: With dead ends: 121 [2025-01-09 22:42:42,763 INFO L226 Difference]: Without dead ends: 121 [2025-01-09 22:42:42,763 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=442, Unknown=1, NotChecked=42, Total=552 [2025-01-09 22:42:42,764 INFO L435 NwaCegarLoop]: 60 mSDtfsCounter, 69 mSDsluCounter, 580 mSDsCounter, 0 mSdLazyCounter, 617 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 640 SdHoareTripleChecker+Invalid, 738 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 617 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 116 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 22:42:42,764 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 640 Invalid, 738 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 617 Invalid, 0 Unknown, 116 Unchecked, 0.2s Time] [2025-01-09 22:42:42,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2025-01-09 22:42:42,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 98. [2025-01-09 22:42:42,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 76 states have (on average 1.3026315789473684) internal successors, (99), 92 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:42:42,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 105 transitions. [2025-01-09 22:42:42,767 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 105 transitions. Word has length 49 [2025-01-09 22:42:42,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:42:42,767 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 105 transitions. [2025-01-09 22:42:42,767 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 3.6666666666666665) internal successors, (55), 14 states have internal predecessors, (55), 3 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2025-01-09 22:42:42,767 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 105 transitions. [2025-01-09 22:42:42,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-01-09 22:42:42,768 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:42:42,768 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:42:42,778 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:42:42,968 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,11 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:42:42,968 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2025-01-09 22:42:42,969 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:42:42,969 INFO L85 PathProgramCache]: Analyzing trace with hash 1635890087, now seen corresponding path program 1 times [2025-01-09 22:42:42,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:42:42,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1646713865] [2025-01-09 22:42:42,969 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:42:42,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:42:42,986 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-01-09 22:42:42,993 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-01-09 22:42:42,993 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:42:42,993 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:42:43,517 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 15 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 22:42:43,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:42:43,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1646713865] [2025-01-09 22:42:43,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1646713865] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:42:43,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1588071058] [2025-01-09 22:42:43,517 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:42:43,517 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:42:43,517 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:42:43,519 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:42:43,520 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:42:43,626 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-01-09 22:42:43,662 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-01-09 22:42:43,662 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:42:43,662 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:42:43,669 INFO L256 TraceCheckSpWp]: Trace formula consists of 411 conjuncts, 47 conjuncts are in the unsatisfiable core [2025-01-09 22:42:43,671 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:42:43,676 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:42:43,679 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:42:43,861 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:42:43,864 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:42:43,897 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_8| Int) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6| Int)) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_8|) 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:42:43,929 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 22:42:43,929 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:42:43,934 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2025-01-09 22:42:43,934 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:42:43,988 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:42:43,992 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 6 not checked. [2025-01-09 22:42:43,992 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:42:44,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1588071058] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:42:44,175 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 22:42:44,175 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 13] total 26 [2025-01-09 22:42:44,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1114211265] [2025-01-09 22:42:44,176 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 22:42:44,176 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-01-09 22:42:44,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:42:44,176 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-01-09 22:42:44,176 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=796, Unknown=1, NotChecked=56, Total=930 [2025-01-09 22:42:44,177 INFO L87 Difference]: Start difference. First operand 98 states and 105 transitions. Second operand has 27 states, 25 states have (on average 2.84) internal successors, (71), 23 states have internal predecessors, (71), 3 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2025-01-09 22:42:44,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:42:44,910 INFO L93 Difference]: Finished difference Result 119 states and 127 transitions. [2025-01-09 22:42:44,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-01-09 22:42:44,913 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 25 states have (on average 2.84) internal successors, (71), 23 states have internal predecessors, (71), 3 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Word has length 49 [2025-01-09 22:42:44,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:42:44,913 INFO L225 Difference]: With dead ends: 119 [2025-01-09 22:42:44,913 INFO L226 Difference]: Without dead ends: 119 [2025-01-09 22:42:44,914 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 51 SyntacticMatches, 2 SemanticMatches, 44 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 175 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=169, Invalid=1814, Unknown=1, NotChecked=86, Total=2070 [2025-01-09 22:42:44,915 INFO L435 NwaCegarLoop]: 60 mSDtfsCounter, 73 mSDsluCounter, 996 mSDsCounter, 0 mSdLazyCounter, 1258 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 1056 SdHoareTripleChecker+Invalid, 1383 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1258 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 121 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 22:42:44,915 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 1056 Invalid, 1383 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1258 Invalid, 0 Unknown, 121 Unchecked, 0.5s Time] [2025-01-09 22:42:44,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2025-01-09 22:42:44,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 100. [2025-01-09 22:42:44,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 78 states have (on average 1.294871794871795) internal successors, (101), 94 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:42:44,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 107 transitions. [2025-01-09 22:42:44,917 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 107 transitions. Word has length 49 [2025-01-09 22:42:44,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:42:44,917 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 107 transitions. [2025-01-09 22:42:44,917 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 25 states have (on average 2.84) internal successors, (71), 23 states have internal predecessors, (71), 3 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2025-01-09 22:42:44,917 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 107 transitions. [2025-01-09 22:42:44,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-01-09 22:42:44,917 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:42:44,918 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:42:44,926 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2025-01-09 22:42:45,122 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,SelfDestructingSolverStorable21 [2025-01-09 22:42:45,122 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2025-01-09 22:42:45,122 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:42:45,122 INFO L85 PathProgramCache]: Analyzing trace with hash -995889515, now seen corresponding path program 1 times [2025-01-09 22:42:45,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:42:45,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1544404099] [2025-01-09 22:42:45,123 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:42:45,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:42:45,134 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-01-09 22:42:45,138 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-01-09 22:42:45,138 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:42:45,138 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:42:45,215 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-01-09 22:42:45,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:42:45,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1544404099] [2025-01-09 22:42:45,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1544404099] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:42:45,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1415571905] [2025-01-09 22:42:45,216 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:42:45,216 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:42:45,216 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:42:45,218 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:42:45,219 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:42:45,332 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-01-09 22:42:45,364 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-01-09 22:42:45,364 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:42:45,364 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:42:45,366 INFO L256 TraceCheckSpWp]: Trace formula consists of 409 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-01-09 22:42:45,368 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:42:45,379 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:42:45,394 WARN L873 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| (select |c_#valid| |node_create_~temp~0#1.base|))) (not (= |node_create_~temp~0#1.base| 0)))) is different from true [2025-01-09 22:42:45,409 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:42:45,434 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:42:45,464 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:42:45,512 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-09 22:42:45,513 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-01-09 22:42:45,527 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-01-09 22:42:45,527 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:42:45,780 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-01-09 22:42:45,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1415571905] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 22:42:45,780 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 22:42:45,780 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 7] total 20 [2025-01-09 22:42:45,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [882230411] [2025-01-09 22:42:45,780 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 22:42:45,780 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-01-09 22:42:45,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:42:45,781 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-01-09 22:42:45,781 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=280, Unknown=1, NotChecked=34, Total=380 [2025-01-09 22:42:45,781 INFO L87 Difference]: Start difference. First operand 100 states and 107 transitions. Second operand has 20 states, 20 states have (on average 4.2) internal successors, (84), 19 states have internal predecessors, (84), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2025-01-09 22:42:45,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:42:45,968 INFO L93 Difference]: Finished difference Result 85 states and 90 transitions. [2025-01-09 22:42:45,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 22:42:45,969 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 4.2) internal successors, (84), 19 states have internal predecessors, (84), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 50 [2025-01-09 22:42:45,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:42:45,969 INFO L225 Difference]: With dead ends: 85 [2025-01-09 22:42:45,969 INFO L226 Difference]: Without dead ends: 85 [2025-01-09 22:42:45,969 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 80 SyntacticMatches, 7 SemanticMatches, 24 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=123, Invalid=472, Unknown=9, NotChecked=46, Total=650 [2025-01-09 22:42:45,970 INFO L435 NwaCegarLoop]: 48 mSDtfsCounter, 222 mSDsluCounter, 392 mSDsCounter, 0 mSdLazyCounter, 344 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 222 SdHoareTripleChecker+Valid, 440 SdHoareTripleChecker+Invalid, 439 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 344 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 74 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:42:45,970 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [222 Valid, 440 Invalid, 439 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 344 Invalid, 0 Unknown, 74 Unchecked, 0.1s Time] [2025-01-09 22:42:45,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2025-01-09 22:42:45,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2025-01-09 22:42:45,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 65 states have (on average 1.2923076923076924) internal successors, (84), 79 states have internal predecessors, (84), 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:42:45,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 90 transitions. [2025-01-09 22:42:45,971 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 90 transitions. Word has length 50 [2025-01-09 22:42:45,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:42:45,971 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 90 transitions. [2025-01-09 22:42:45,972 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 4.2) internal successors, (84), 19 states have internal predecessors, (84), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2025-01-09 22:42:45,972 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 90 transitions. [2025-01-09 22:42:45,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-01-09 22:42:45,972 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:42:45,972 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:42:45,979 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:42:46,172 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,13 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:42:46,173 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2025-01-09 22:42:46,173 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:42:46,173 INFO L85 PathProgramCache]: Analyzing trace with hash -1666057852, now seen corresponding path program 1 times [2025-01-09 22:42:46,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:42:46,173 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1731043944] [2025-01-09 22:42:46,173 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:42:46,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:42:46,189 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-01-09 22:42:46,200 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-01-09 22:42:46,200 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:42:46,200 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:42:47,369 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 9 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:42:47,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:42:47,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1731043944] [2025-01-09 22:42:47,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1731043944] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:42:47,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1204764448] [2025-01-09 22:42:47,369 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:42:47,369 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:42:47,369 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:42:47,371 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:42:47,372 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:42:47,487 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-01-09 22:42:47,571 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-01-09 22:42:47,572 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:42:47,572 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:42:47,574 INFO L256 TraceCheckSpWp]: Trace formula consists of 420 conjuncts, 109 conjuncts are in the unsatisfiable core [2025-01-09 22:42:47,578 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:42:47,615 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:42:47,774 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:42:47,848 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-09 22:42:47,848 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-01-09 22:42:47,932 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-01-09 22:42:48,027 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-01-09 22:42:48,152 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2025-01-09 22:42:48,154 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:42:48,341 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2025-01-09 22:42:48,342 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 23 [2025-01-09 22:42:48,355 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2025-01-09 22:42:48,355 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:42:48,732 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 22:42:48,733 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 15 [2025-01-09 22:42:48,797 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2025-01-09 22:42:48,866 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-01-09 22:42:48,968 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 3 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:42:48,968 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:42:49,058 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1965 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store |c_#memory_int#2| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_1965) (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)))) is different from false [2025-01-09 22:42:49,066 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1965 (Array Int Int)) (v_ArrVal_1964 (Array Int Int))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#2| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_1964) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_1965) (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (not (= (store (select |c_#memory_int#2| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset| (select v_ArrVal_1964 |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset|)) v_ArrVal_1964)))) is different from false [2025-01-09 22:42:49,091 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1965 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_26| Int) (v_ArrVal_1964 (Array Int Int))) (or (not (= v_ArrVal_1964 (store (select |c_#memory_int#2| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base|) |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_26| (select v_ArrVal_1964 |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_26|)))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#2| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base| v_ArrVal_1964) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_1965) (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (< |c_ULTIMATE.start_sll_circular_insert_~last~1#1.offset| |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_26|))) is different from false [2025-01-09 22:42:49,100 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1965 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_26| Int) (v_ArrVal_1964 (Array Int Int))) (or (not (= (store (select |c_#memory_int#2| |c_ULTIMATE.start_sll_circular_insert_#t~mem10#1.base|) |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_26| (select v_ArrVal_1964 |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_26|)) v_ArrVal_1964)) (< |c_ULTIMATE.start_sll_circular_insert_#t~mem10#1.offset| |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_26|) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#2| |c_ULTIMATE.start_sll_circular_insert_#t~mem10#1.base| v_ArrVal_1964) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_1965) (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))))) is different from false [2025-01-09 22:42:49,113 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1965 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_26| Int) (v_ArrVal_1964 (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (< (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|) |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_26|) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#2| .cse0 v_ArrVal_1964) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_1965) (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (not (= v_ArrVal_1964 (store (select |c_#memory_int#2| .cse0) |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_26| (select v_ArrVal_1964 |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_26|))))))) is different from false [2025-01-09 22:42:49,124 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1965 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_26| Int) (v_ArrVal_1964 (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (< (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|) |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_26|) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#2| .cse0 v_ArrVal_1964) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| v_ArrVal_1965) (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (not (= v_ArrVal_1964 (store (select |c_#memory_int#2| .cse0) |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_26| (select v_ArrVal_1964 |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_26|))))))) is different from false [2025-01-09 22:42:49,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1204764448] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:42:49,237 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 22:42:49,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 32] total 61 [2025-01-09 22:42:49,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1485801783] [2025-01-09 22:42:49,237 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 22:42:49,237 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 61 states [2025-01-09 22:42:49,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:42:49,238 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2025-01-09 22:42:49,239 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=246, Invalid=3932, Unknown=6, NotChecked=786, Total=4970 [2025-01-09 22:42:49,239 INFO L87 Difference]: Start difference. First operand 85 states and 90 transitions. Second operand has 61 states, 57 states have (on average 1.543859649122807) internal successors, (88), 52 states have internal predecessors, (88), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-01-09 22:42:50,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:42:50,323 INFO L93 Difference]: Finished difference Result 89 states and 92 transitions. [2025-01-09 22:42:50,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2025-01-09 22:42:50,323 INFO L78 Accepts]: Start accepts. Automaton has has 61 states, 57 states have (on average 1.543859649122807) internal successors, (88), 52 states have internal predecessors, (88), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 53 [2025-01-09 22:42:50,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:42:50,324 INFO L225 Difference]: With dead ends: 89 [2025-01-09 22:42:50,324 INFO L226 Difference]: Without dead ends: 89 [2025-01-09 22:42:50,326 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 1936 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=452, Invalid=7048, Unknown=6, NotChecked=1050, Total=8556 [2025-01-09 22:42:50,326 INFO L435 NwaCegarLoop]: 50 mSDtfsCounter, 67 mSDsluCounter, 1344 mSDsCounter, 0 mSdLazyCounter, 1371 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 1394 SdHoareTripleChecker+Invalid, 1385 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 1371 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 22:42:50,326 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 1394 Invalid, 1385 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 1371 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 22:42:50,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2025-01-09 22:42:50,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 85. [2025-01-09 22:42:50,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 65 states have (on average 1.2769230769230768) internal successors, (83), 79 states have internal predecessors, (83), 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:42:50,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 89 transitions. [2025-01-09 22:42:50,328 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 89 transitions. Word has length 53 [2025-01-09 22:42:50,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:42:50,328 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 89 transitions. [2025-01-09 22:42:50,328 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 61 states, 57 states have (on average 1.543859649122807) internal successors, (88), 52 states have internal predecessors, (88), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-01-09 22:42:50,329 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 89 transitions. [2025-01-09 22:42:50,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-01-09 22:42:50,329 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:42:50,329 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:42:50,336 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:42:50,529 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,14 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:42:50,530 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2025-01-09 22:42:50,530 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:42:50,530 INFO L85 PathProgramCache]: Analyzing trace with hash 942103671, now seen corresponding path program 1 times [2025-01-09 22:42:50,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:42:50,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [931224355] [2025-01-09 22:42:50,530 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:42:50,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:42:50,544 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-01-09 22:42:50,553 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-01-09 22:42:50,553 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:42:50,553 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:42:51,022 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 19 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-09 22:42:51,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:42:51,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [931224355] [2025-01-09 22:42:51,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [931224355] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:42:51,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1169806836] [2025-01-09 22:42:51,023 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:42:51,023 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:42:51,023 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:42:51,024 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:42:51,025 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:42:51,145 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-01-09 22:42:51,190 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-01-09 22:42:51,190 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:42:51,190 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:42:51,192 INFO L256 TraceCheckSpWp]: Trace formula consists of 442 conjuncts, 76 conjuncts are in the unsatisfiable core [2025-01-09 22:42:51,194 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:42:51,196 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:42:51,293 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-01-09 22:42:51,293 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:42:51,341 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-01-09 22:42:51,402 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-01-09 22:42:51,403 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 33 [2025-01-09 22:42:51,482 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 14 [2025-01-09 22:42:51,485 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:42:51,602 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 22:42:51,603 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 35 [2025-01-09 22:42:51,621 INFO L349 Elim1Store]: treesize reduction 84, result has 37.8 percent of original size [2025-01-09 22:42:51,621 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 38 treesize of output 65 [2025-01-09 22:42:51,783 INFO L349 Elim1Store]: treesize reduction 33, result has 48.4 percent of original size [2025-01-09 22:42:51,783 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 56 [2025-01-09 22:42:51,879 INFO L349 Elim1Store]: treesize reduction 25, result has 26.5 percent of original size [2025-01-09 22:42:51,879 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 104 treesize of output 88 [2025-01-09 22:42:51,896 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:42:52,007 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 143 treesize of output 115 [2025-01-09 22:42:52,206 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 123 treesize of output 67 [2025-01-09 22:42:52,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 73 treesize of output 53 [2025-01-09 22:42:52,449 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 21 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 22:42:52,449 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:42:56,518 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2114 (Array Int Int)) (|ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| Int) (|ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset| Int)) (= (select |c_#valid| (select (select (store (store |c_#memory_$Pointer$#2.base| |ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| (store (select |c_#memory_$Pointer$#2.base| |ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base|) |ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|)) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_2114) (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) 1)) is different from false [2025-01-09 22:42:56,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1169806836] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:42:56,688 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 22:42:56,688 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 28] total 47 [2025-01-09 22:42:56,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1809293349] [2025-01-09 22:42:56,688 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 22:42:56,689 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2025-01-09 22:42:56,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:42:56,689 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2025-01-09 22:42:56,690 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=2349, Unknown=39, NotChecked=98, Total=2652 [2025-01-09 22:42:56,690 INFO L87 Difference]: Start difference. First operand 85 states and 89 transitions. Second operand has 48 states, 45 states have (on average 2.022222222222222) internal successors, (91), 41 states have internal predecessors, (91), 4 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2025-01-09 22:43:01,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:43:01,826 INFO L93 Difference]: Finished difference Result 99 states and 105 transitions. [2025-01-09 22:43:01,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2025-01-09 22:43:01,826 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 45 states have (on average 2.022222222222222) internal successors, (91), 41 states have internal predecessors, (91), 4 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 55 [2025-01-09 22:43:01,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:43:01,827 INFO L225 Difference]: With dead ends: 99 [2025-01-09 22:43:01,827 INFO L226 Difference]: Without dead ends: 99 [2025-01-09 22:43:01,828 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 808 ImplicationChecksByTransitivity, 9.6s TimeCoverageRelationStatistics Valid=326, Invalid=3798, Unknown=40, NotChecked=126, Total=4290 [2025-01-09 22:43:01,828 INFO L435 NwaCegarLoop]: 50 mSDtfsCounter, 68 mSDsluCounter, 1083 mSDsCounter, 0 mSdLazyCounter, 1578 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 1133 SdHoareTripleChecker+Invalid, 1583 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1578 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 22:43:01,828 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 1133 Invalid, 1583 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1578 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 22:43:01,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2025-01-09 22:43:01,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 89. [2025-01-09 22:43:01,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 69 states have (on average 1.289855072463768) internal successors, (89), 83 states have internal predecessors, (89), 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:43:01,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 95 transitions. [2025-01-09 22:43:01,831 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 95 transitions. Word has length 55 [2025-01-09 22:43:01,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:43:01,831 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 95 transitions. [2025-01-09 22:43:01,832 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 45 states have (on average 2.022222222222222) internal successors, (91), 41 states have internal predecessors, (91), 4 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2025-01-09 22:43:01,832 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 95 transitions. [2025-01-09 22:43:01,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-01-09 22:43:01,832 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:43:01,832 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:43:01,839 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2025-01-09 22:43:02,032 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2025-01-09 22:43:02,033 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2025-01-09 22:43:02,033 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:43:02,033 INFO L85 PathProgramCache]: Analyzing trace with hash 942103672, now seen corresponding path program 1 times [2025-01-09 22:43:02,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:43:02,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1191591303] [2025-01-09 22:43:02,033 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:43:02,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:43:02,044 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-01-09 22:43:02,051 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-01-09 22:43:02,051 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:43:02,051 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:43:02,688 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 15 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-09 22:43:02,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:43:02,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1191591303] [2025-01-09 22:43:02,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1191591303] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:43:02,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [367176443] [2025-01-09 22:43:02,688 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:43:02,688 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:43:02,688 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:43:02,690 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 22:43:02,691 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-01-09 22:43:02,815 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-01-09 22:43:02,856 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-01-09 22:43:02,856 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:43:02,856 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:43:02,859 INFO L256 TraceCheckSpWp]: Trace formula consists of 442 conjuncts, 125 conjuncts are in the unsatisfiable core [2025-01-09 22:43:02,862 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:43:02,864 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-01-09 22:43:02,869 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:03,100 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-01-09 22:43:03,101 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:43:03,108 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:03,190 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-01-09 22:43:03,193 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-01-09 22:43:03,286 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-01-09 22:43:03,286 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 59 treesize of output 52 [2025-01-09 22:43:03,289 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:43:03,411 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 19 [2025-01-09 22:43:03,414 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2025-01-09 22:43:03,416 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2025-01-09 22:43:03,419 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:43:03,698 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2025-01-09 22:43:03,698 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 23 [2025-01-09 22:43:03,704 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 22:43:03,709 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 34 [2025-01-09 22:43:03,723 INFO L349 Elim1Store]: treesize reduction 29, result has 46.3 percent of original size [2025-01-09 22:43:03,723 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 29 [2025-01-09 22:43:03,737 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2025-01-09 22:43:03,737 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2025-01-09 22:43:03,978 INFO L349 Elim1Store]: treesize reduction 25, result has 47.9 percent of original size [2025-01-09 22:43:03,978 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 48 [2025-01-09 22:43:03,989 INFO L349 Elim1Store]: treesize reduction 37, result has 22.9 percent of original size [2025-01-09 22:43:03,989 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 22 [2025-01-09 22:43:04,143 INFO L349 Elim1Store]: treesize reduction 25, result has 26.5 percent of original size [2025-01-09 22:43:04,143 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 98 treesize of output 82 [2025-01-09 22:43:04,160 INFO L349 Elim1Store]: treesize reduction 25, result has 26.5 percent of original size [2025-01-09 22:43:04,160 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 107 treesize of output 109 [2025-01-09 22:43:04,205 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:04,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 5 treesize of output 3 [2025-01-09 22:43:04,267 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:04,538 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 245 treesize of output 169 [2025-01-09 22:43:04,998 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:43:04,998 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 166 treesize of output 122 [2025-01-09 22:43:05,015 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:43:05,015 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 114 treesize of output 138 [2025-01-09 22:43:05,930 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 3 proven. 20 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 22:43:05,930 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:43:06,183 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse1 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (and (forall ((v_ArrVal_2274 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_2274) .cse0) .cse1) 4))) (forall ((v_ArrVal_2274 (Array Int Int)) (v_ArrVal_2273 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_2274) .cse0) .cse1) 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_2273) .cse0) .cse1)))))) is different from false [2025-01-09 22:43:07,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [367176443] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:43:07,290 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 22:43:07,290 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 28] total 49 [2025-01-09 22:43:07,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2033991105] [2025-01-09 22:43:07,290 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 22:43:07,290 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2025-01-09 22:43:07,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:43:07,291 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2025-01-09 22:43:07,291 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=3114, Unknown=37, NotChecked=112, Total=3422 [2025-01-09 22:43:07,291 INFO L87 Difference]: Start difference. First operand 89 states and 95 transitions. Second operand has 50 states, 47 states have (on average 2.0) internal successors, (94), 42 states have internal predecessors, (94), 4 states have call successors, (5), 4 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2025-01-09 22:43:09,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:43:09,828 INFO L93 Difference]: Finished difference Result 95 states and 100 transitions. [2025-01-09 22:43:09,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2025-01-09 22:43:09,828 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 47 states have (on average 2.0) internal successors, (94), 42 states have internal predecessors, (94), 4 states have call successors, (5), 4 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 55 [2025-01-09 22:43:09,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:43:09,828 INFO L225 Difference]: With dead ends: 95 [2025-01-09 22:43:09,828 INFO L226 Difference]: Without dead ends: 95 [2025-01-09 22:43:09,830 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 886 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=356, Invalid=5617, Unknown=37, NotChecked=152, Total=6162 [2025-01-09 22:43:09,830 INFO L435 NwaCegarLoop]: 52 mSDtfsCounter, 107 mSDsluCounter, 1451 mSDsCounter, 0 mSdLazyCounter, 2009 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 1503 SdHoareTripleChecker+Invalid, 2015 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 2009 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-01-09 22:43:09,830 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 1503 Invalid, 2015 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 2009 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-01-09 22:43:09,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2025-01-09 22:43:09,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 91. [2025-01-09 22:43:09,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 71 states have (on average 1.2816901408450705) internal successors, (91), 85 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:43:09,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 97 transitions. [2025-01-09 22:43:09,833 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 97 transitions. Word has length 55 [2025-01-09 22:43:09,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:43:09,833 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 97 transitions. [2025-01-09 22:43:09,833 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 47 states have (on average 2.0) internal successors, (94), 42 states have internal predecessors, (94), 4 states have call successors, (5), 4 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2025-01-09 22:43:09,833 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 97 transitions. [2025-01-09 22:43:09,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-01-09 22:43:09,834 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:43:09,834 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:43:09,841 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2025-01-09 22:43:10,038 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2025-01-09 22:43:10,039 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2025-01-09 22:43:10,039 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:43:10,039 INFO L85 PathProgramCache]: Analyzing trace with hash -1398070706, now seen corresponding path program 1 times [2025-01-09 22:43:10,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:43:10,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719870117] [2025-01-09 22:43:10,039 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:43:10,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:43:10,050 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-01-09 22:43:10,057 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-01-09 22:43:10,057 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:43:10,057 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:43:10,575 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 15 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-09 22:43:10,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:43:10,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1719870117] [2025-01-09 22:43:10,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1719870117] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:43:10,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [151168953] [2025-01-09 22:43:10,575 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:43:10,575 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:43:10,575 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:43:10,577 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 22:43:10,579 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2025-01-09 22:43:10,701 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-01-09 22:43:10,741 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-01-09 22:43:10,741 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:43:10,741 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:43:10,743 INFO L256 TraceCheckSpWp]: Trace formula consists of 448 conjuncts, 71 conjuncts are in the unsatisfiable core [2025-01-09 22:43:10,745 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:43:10,746 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:10,796 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-09 22:43:10,797 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-01-09 22:43:10,834 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-01-09 22:43:10,892 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-01-09 22:43:10,892 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 26 [2025-01-09 22:43:10,960 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 20 treesize of output 8 [2025-01-09 22:43:10,961 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:11,060 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2025-01-09 22:43:11,061 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:43:11,066 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 24 [2025-01-09 22:43:11,122 INFO L349 Elim1Store]: treesize reduction 33, result has 48.4 percent of original size [2025-01-09 22:43:11,122 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 32 treesize of output 47 [2025-01-09 22:43:11,174 INFO L349 Elim1Store]: treesize reduction 25, result has 26.5 percent of original size [2025-01-09 22:43:11,174 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 53 treesize of output 49 [2025-01-09 22:43:11,186 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:11,191 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 28 treesize of output 20 [2025-01-09 22:43:11,245 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 28 treesize of output 12 [2025-01-09 22:43:11,249 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2025-01-09 22:43:11,250 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 9 proven. 13 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 22:43:11,250 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:43:11,269 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2428 (Array Int Int))) (not (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= .cse0 (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_2428) .cse0) (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))))) is different from false [2025-01-09 22:43:11,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [151168953] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:43:11,473 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 22:43:11,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 29] total 41 [2025-01-09 22:43:11,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [928618702] [2025-01-09 22:43:11,473 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 22:43:11,473 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2025-01-09 22:43:11,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:43:11,473 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2025-01-09 22:43:11,474 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=1753, Unknown=34, NotChecked=84, Total=1980 [2025-01-09 22:43:11,474 INFO L87 Difference]: Start difference. First operand 91 states and 97 transitions. Second operand has 41 states, 39 states have (on average 2.128205128205128) internal successors, (83), 34 states have internal predecessors, (83), 4 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2025-01-09 22:43:12,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:43:12,201 INFO L93 Difference]: Finished difference Result 95 states and 99 transitions. [2025-01-09 22:43:12,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-01-09 22:43:12,202 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 39 states have (on average 2.128205128205128) internal successors, (83), 34 states have internal predecessors, (83), 4 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 58 [2025-01-09 22:43:12,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:43:12,202 INFO L225 Difference]: With dead ends: 95 [2025-01-09 22:43:12,202 INFO L226 Difference]: Without dead ends: 95 [2025-01-09 22:43:12,203 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 517 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=236, Invalid=3514, Unknown=36, NotChecked=120, Total=3906 [2025-01-09 22:43:12,203 INFO L435 NwaCegarLoop]: 50 mSDtfsCounter, 88 mSDsluCounter, 1260 mSDsCounter, 0 mSdLazyCounter, 1312 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 1310 SdHoareTripleChecker+Invalid, 1318 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1312 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 22:43:12,203 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 1310 Invalid, 1318 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1312 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 22:43:12,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2025-01-09 22:43:12,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 91. [2025-01-09 22:43:12,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 71 states have (on average 1.267605633802817) internal successors, (90), 85 states have internal predecessors, (90), 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:43:12,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 96 transitions. [2025-01-09 22:43:12,205 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 96 transitions. Word has length 58 [2025-01-09 22:43:12,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:43:12,205 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 96 transitions. [2025-01-09 22:43:12,206 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 39 states have (on average 2.128205128205128) internal successors, (83), 34 states have internal predecessors, (83), 4 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2025-01-09 22:43:12,206 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 96 transitions. [2025-01-09 22:43:12,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2025-01-09 22:43:12,206 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:43:12,206 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:43:12,215 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2025-01-09 22:43:12,407 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26,17 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:43:12,407 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2025-01-09 22:43:12,407 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:43:12,407 INFO L85 PathProgramCache]: Analyzing trace with hash -473640491, now seen corresponding path program 1 times [2025-01-09 22:43:12,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:43:12,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [110333890] [2025-01-09 22:43:12,408 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:43:12,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:43:12,421 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-01-09 22:43:12,433 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-01-09 22:43:12,433 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:43:12,433 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:43:13,217 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 15 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-09 22:43:13,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:43:13,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [110333890] [2025-01-09 22:43:13,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [110333890] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:43:13,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1747763371] [2025-01-09 22:43:13,217 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:43:13,217 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:43:13,217 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:43:13,219 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 22:43:13,220 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2025-01-09 22:43:13,353 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-01-09 22:43:13,528 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-01-09 22:43:13,528 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:43:13,528 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:43:13,532 INFO L256 TraceCheckSpWp]: Trace formula consists of 451 conjuncts, 126 conjuncts are in the unsatisfiable core [2025-01-09 22:43:13,535 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:43:13,815 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:13,890 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:43:13,975 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2025-01-09 22:43:13,976 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:43:14,319 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:43:14,325 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 11 [2025-01-09 22:43:14,333 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 11 [2025-01-09 22:43:14,410 INFO L349 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2025-01-09 22:43:14,410 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 119 treesize of output 76 [2025-01-09 22:43:14,412 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 36 treesize of output 15 [2025-01-09 22:43:14,416 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 55 treesize of output 19 [2025-01-09 22:43:14,480 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 50 treesize of output 30 [2025-01-09 22:43:14,570 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 27 treesize of output 15 [2025-01-09 22:43:14,572 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2025-01-09 22:43:14,687 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 15 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-01-09 22:43:14,687 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:43:14,846 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2577 (Array Int Int)) (v_ArrVal_2576 (Array Int Int)) (v_ArrVal_2575 (Array Int Int))) (or (not (= (store (select |c_#memory_int#2| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| (select v_ArrVal_2577 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)) v_ArrVal_2577)) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse1 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select (store |c_#memory_int#2| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_2577) (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_2575) .cse0) .cse1)) (+ (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_2576) .cse0) .cse1) 4)))))) is different from false [2025-01-09 22:43:14,853 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:43:14,853 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 61 treesize of output 62 [2025-01-09 22:43:14,861 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:43:14,862 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 120 treesize of output 123 [2025-01-09 22:43:14,869 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:43:14,869 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 100 treesize of output 92 [2025-01-09 22:43:14,882 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:43:14,882 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 170 treesize of output 161 [2025-01-09 22:43:14,888 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 35 treesize of output 29 [2025-01-09 22:43:14,892 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 23 [2025-01-09 22:43:15,136 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse14 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse4 (= .cse14 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|))) (let ((.cse11 (+ 4 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)) (.cse1 (not .cse4)) (.cse13 (forall ((v_ArrVal_2577 (Array Int Int)) (v_arrayElimCell_133 Int) (v_arrayElimCell_132 Int) (v_ArrVal_2571 (Array Int Int))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#2| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_2571) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_2577) v_arrayElimCell_132) (+ v_arrayElimCell_133 4))) (not (= (store (select |c_#memory_int#2| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| (select v_ArrVal_2577 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)) v_ArrVal_2577)))))) (let ((.cse3 (or .cse1 .cse13)) (.cse2 (forall ((v_arrayElimCell_130 Int) (v_ArrVal_2577 (Array Int Int)) (v_ArrVal_2571 (Array Int Int))) (let ((.cse21 (store |c_#memory_int#2| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_2571))) (or (not (= (store (select .cse21 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| (select v_ArrVal_2577 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)) v_ArrVal_2577)) (= |c_ULTIMATE.start_main_~data~0#1| (select v_ArrVal_2577 (+ v_arrayElimCell_130 4))) (forall ((v_arrayElimCell_133 Int) (v_arrayElimCell_132 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store .cse21 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_2577) v_arrayElimCell_132) (+ v_arrayElimCell_133 4)))))))) (.cse6 (forall ((v_ArrVal_2577 (Array Int Int)) (v_arrayElimCell_128 Int) (v_ArrVal_2571 (Array Int Int))) (let ((.cse19 (store |c_#memory_int#2| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_2571))) (let ((.cse20 (store .cse19 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_2577))) (or (not (= (store (select .cse19 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| (select v_ArrVal_2577 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)) v_ArrVal_2577)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse20 v_arrayElimCell_128) .cse11)) (forall ((v_arrayElimCell_133 Int) (v_arrayElimCell_132 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse20 v_arrayElimCell_132) (+ v_arrayElimCell_133 4))))))))) (.cse7 (or .cse4 (forall ((v_arrayElimCell_130 Int) (v_ArrVal_2577 (Array Int Int)) (v_ArrVal_2571 (Array Int Int)) (v_arrayElimCell_128 Int)) (let ((.cse18 (store |c_#memory_int#2| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_2571))) (or (not (= (store (select .cse18 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| (select v_ArrVal_2577 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)) v_ArrVal_2577)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store .cse18 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_2577) v_arrayElimCell_128) (+ v_arrayElimCell_130 4)))))))) (.cse8 (or (forall ((v_ArrVal_2577 (Array Int Int)) (v_ArrVal_2571 (Array Int Int)) (v_arrayElimCell_128 Int)) (let ((.cse17 (store |c_#memory_int#2| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_2571))) (or (not (= (store (select .cse17 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| (select v_ArrVal_2577 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)) v_ArrVal_2577)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store .cse17 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_2577) v_arrayElimCell_128) .cse11))))) .cse4)) (.cse9 (forall ((v_arrayElimCell_130 Int) (v_ArrVal_2577 (Array Int Int)) (v_arrayElimCell_128 Int) (v_ArrVal_2571 (Array Int Int))) (let ((.cse15 (store |c_#memory_int#2| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_2571))) (let ((.cse16 (store .cse15 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_2577))) (or (not (= (store (select .cse15 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| (select v_ArrVal_2577 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)) v_ArrVal_2577)) (forall ((v_arrayElimCell_133 Int) (v_arrayElimCell_132 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse16 v_arrayElimCell_132) (+ v_arrayElimCell_133 4)))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse16 v_arrayElimCell_128) (+ v_arrayElimCell_130 4)))))))) (.cse5 (= |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| .cse14)) (.cse12 (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset|))) (and (or (forall ((v_ArrVal_2577 (Array Int Int)) (v_arrayElimCell_133 Int) (v_arrayElimCell_132 Int) (v_ArrVal_2571 (Array Int Int))) (let ((.cse0 (store |c_#memory_int#2| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_2571))) (or (not (= (store (select .cse0 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| (select v_ArrVal_2577 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)) v_ArrVal_2577)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store .cse0 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_2577) v_arrayElimCell_132) (+ v_arrayElimCell_133 4)))))) .cse1) (or (and .cse2 .cse3 (or .cse4 (forall ((v_arrayElimCell_130 Int) (v_DerPreprocessor_7 Int) (v_ArrVal_2571 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (store (select (store |c_#memory_int#2| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_2571) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| v_DerPreprocessor_7) (+ v_arrayElimCell_130 4)))))) .cse5) (or .cse5 (and .cse6 .cse3 .cse7 .cse8 .cse9)) (forall ((v_ArrVal_2577 (Array Int Int)) (v_ArrVal_2571 (Array Int Int))) (let ((.cse10 (store |c_#memory_int#2| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_2571))) (or (not (= (store (select .cse10 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| (select v_ArrVal_2577 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)) v_ArrVal_2577)) (= (select v_ArrVal_2577 .cse11) |c_ULTIMATE.start_main_~data~0#1|) (forall ((v_arrayElimCell_133 Int) (v_arrayElimCell_132 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store .cse10 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_2577) v_arrayElimCell_132) (+ v_arrayElimCell_133 4))))))) (or (and .cse2 (or (forall ((v_arrayElimCell_130 Int) (v_DerPreprocessor_6 Int) (v_ArrVal_2571 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (store (select (store |c_#memory_int#2| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_2571) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| v_DerPreprocessor_6) (+ v_arrayElimCell_130 4)))) .cse4)) .cse12) (or .cse4 (forall ((v_ArrVal_2571 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store |c_#memory_int#2| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_2571) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) .cse11)))) (or (and .cse6 .cse7 .cse8 .cse9 (or .cse5 .cse1 .cse13)) .cse12)))))) is different from false [2025-01-09 22:43:15,819 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse15 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse9 (= .cse15 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|))) (let ((.cse3 (forall ((v_ArrVal_2577 (Array Int Int)) (v_arrayElimCell_133 Int) (v_arrayElimCell_132 Int) (v_ArrVal_2571 (Array Int Int))) (or (not (= (store (select |c_#memory_int#2| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| (select v_ArrVal_2577 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)) v_ArrVal_2577)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#2| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base| v_ArrVal_2571) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_2577) v_arrayElimCell_132) (+ v_arrayElimCell_133 4)))))) (.cse4 (not .cse9)) (.cse11 (+ 4 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|))) (let ((.cse0 (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) |c_ULTIMATE.start_sll_circular_insert_~last~1#1.offset|)) (.cse1 (forall ((v_ArrVal_2577 (Array Int Int)) (v_arrayElimCell_128 Int) (v_ArrVal_2571 (Array Int Int))) (let ((.cse21 (store |c_#memory_int#2| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base| v_ArrVal_2571))) (let ((.cse20 (store .cse21 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_2577))) (or (forall ((v_arrayElimCell_133 Int) (v_arrayElimCell_132 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse20 v_arrayElimCell_132) (+ v_arrayElimCell_133 4)))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse20 v_arrayElimCell_128) .cse11)) (not (= (store (select .cse21 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| (select v_ArrVal_2577 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)) v_ArrVal_2577))))))) (.cse5 (or .cse9 (forall ((v_ArrVal_2577 (Array Int Int)) (v_ArrVal_2571 (Array Int Int)) (v_arrayElimCell_128 Int)) (let ((.cse19 (store |c_#memory_int#2| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base| v_ArrVal_2571))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store .cse19 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_2577) v_arrayElimCell_128) .cse11)) (not (= (store (select .cse19 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| (select v_ArrVal_2577 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)) v_ArrVal_2577))))))) (.cse6 (or (forall ((v_arrayElimCell_130 Int) (v_ArrVal_2577 (Array Int Int)) (v_ArrVal_2571 (Array Int Int)) (v_arrayElimCell_128 Int)) (let ((.cse18 (store |c_#memory_int#2| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base| v_ArrVal_2571))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store .cse18 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_2577) v_arrayElimCell_128) (+ v_arrayElimCell_130 4))) (not (= (store (select .cse18 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| (select v_ArrVal_2577 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)) v_ArrVal_2577))))) .cse9)) (.cse7 (forall ((v_arrayElimCell_130 Int) (v_ArrVal_2577 (Array Int Int)) (v_arrayElimCell_128 Int) (v_ArrVal_2571 (Array Int Int))) (let ((.cse17 (store |c_#memory_int#2| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base| v_ArrVal_2571))) (let ((.cse16 (store .cse17 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_2577))) (or (forall ((v_arrayElimCell_133 Int) (v_arrayElimCell_132 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse16 v_arrayElimCell_132) (+ v_arrayElimCell_133 4)))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse16 v_arrayElimCell_128) (+ v_arrayElimCell_130 4))) (not (= (store (select .cse17 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| (select v_ArrVal_2577 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)) v_ArrVal_2577))))))) (.cse2 (= .cse15 |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base|)) (.cse13 (or .cse3 .cse4)) (.cse10 (forall ((v_arrayElimCell_130 Int) (v_ArrVal_2577 (Array Int Int)) (v_ArrVal_2571 (Array Int Int))) (let ((.cse14 (store |c_#memory_int#2| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base| v_ArrVal_2571))) (or (forall ((v_arrayElimCell_133 Int) (v_arrayElimCell_132 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store .cse14 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_2577) v_arrayElimCell_132) (+ v_arrayElimCell_133 4)))) (= |c_ULTIMATE.start_main_~data~0#1| (select v_ArrVal_2577 (+ v_arrayElimCell_130 4))) (not (= (store (select .cse14 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| (select v_ArrVal_2577 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)) v_ArrVal_2577))))))) (and (or .cse0 (and .cse1 (or .cse2 .cse3 .cse4) .cse5 .cse6 .cse7)) (or (forall ((v_ArrVal_2577 (Array Int Int)) (v_arrayElimCell_133 Int) (v_arrayElimCell_132 Int) (v_ArrVal_2571 (Array Int Int))) (let ((.cse8 (store |c_#memory_int#2| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base| v_ArrVal_2571))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store .cse8 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_2577) v_arrayElimCell_132) (+ v_arrayElimCell_133 4))) (not (= (store (select .cse8 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| (select v_ArrVal_2577 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)) v_ArrVal_2577))))) .cse4) (or .cse0 (and (or .cse9 (forall ((v_arrayElimCell_130 Int) (v_DerPreprocessor_6 Int) (v_ArrVal_2571 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (store (select (store |c_#memory_int#2| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base| v_ArrVal_2571) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| v_DerPreprocessor_6) (+ v_arrayElimCell_130 4))))) .cse10)) (forall ((v_ArrVal_2577 (Array Int Int)) (v_ArrVal_2571 (Array Int Int))) (let ((.cse12 (store |c_#memory_int#2| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base| v_ArrVal_2571))) (or (= (select v_ArrVal_2577 .cse11) |c_ULTIMATE.start_main_~data~0#1|) (forall ((v_arrayElimCell_133 Int) (v_arrayElimCell_132 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store .cse12 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_2577) v_arrayElimCell_132) (+ v_arrayElimCell_133 4)))) (not (= (store (select .cse12 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| (select v_ArrVal_2577 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)) v_ArrVal_2577))))) (or (forall ((v_ArrVal_2571 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store |c_#memory_int#2| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base| v_ArrVal_2571) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) .cse11))) .cse9) (or .cse2 (and .cse1 .cse13 .cse5 .cse6 .cse7)) (or .cse2 (and .cse13 .cse10 (or .cse9 (forall ((v_arrayElimCell_130 Int) (v_DerPreprocessor_7 Int) (v_ArrVal_2571 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (store (select (store |c_#memory_int#2| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base| v_ArrVal_2571) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| v_DerPreprocessor_7) (+ v_arrayElimCell_130 4)))))))))))) is different from false [2025-01-09 22:43:15,957 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse15 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse0 (= .cse15 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|))) (let ((.cse12 (forall ((v_ArrVal_2577 (Array Int Int)) (v_arrayElimCell_133 Int) (v_arrayElimCell_132 Int) (v_ArrVal_2571 (Array Int Int))) (or (not (= (store (select |c_#memory_int#2| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| (select v_ArrVal_2577 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)) v_ArrVal_2577)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#2| |c_ULTIMATE.start_sll_circular_insert_#t~mem10#1.base| v_ArrVal_2571) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_2577) v_arrayElimCell_132) (+ v_arrayElimCell_133 4)))))) (.cse3 (not .cse0)) (.cse1 (+ 4 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|))) (let ((.cse4 (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) |c_ULTIMATE.start_sll_circular_insert_#t~mem10#1.offset|)) (.cse6 (forall ((v_arrayElimCell_130 Int) (v_ArrVal_2577 (Array Int Int)) (v_arrayElimCell_128 Int) (v_ArrVal_2571 (Array Int Int))) (let ((.cse21 (store |c_#memory_int#2| |c_ULTIMATE.start_sll_circular_insert_#t~mem10#1.base| v_ArrVal_2571))) (let ((.cse20 (store .cse21 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_2577))) (or (forall ((v_arrayElimCell_133 Int) (v_arrayElimCell_132 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse20 v_arrayElimCell_132) (+ v_arrayElimCell_133 4)))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse20 v_arrayElimCell_128) (+ v_arrayElimCell_130 4))) (not (= v_ArrVal_2577 (store (select .cse21 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| (select v_ArrVal_2577 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|))))))))) (.cse7 (or (forall ((v_arrayElimCell_130 Int) (v_ArrVal_2577 (Array Int Int)) (v_ArrVal_2571 (Array Int Int)) (v_arrayElimCell_128 Int)) (let ((.cse19 (store |c_#memory_int#2| |c_ULTIMATE.start_sll_circular_insert_#t~mem10#1.base| v_ArrVal_2571))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store .cse19 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_2577) v_arrayElimCell_128) (+ v_arrayElimCell_130 4))) (not (= v_ArrVal_2577 (store (select .cse19 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| (select v_ArrVal_2577 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|))))))) .cse0)) (.cse8 (or .cse0 (forall ((v_ArrVal_2577 (Array Int Int)) (v_ArrVal_2571 (Array Int Int)) (v_arrayElimCell_128 Int)) (let ((.cse18 (store |c_#memory_int#2| |c_ULTIMATE.start_sll_circular_insert_#t~mem10#1.base| v_ArrVal_2571))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store .cse18 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_2577) v_arrayElimCell_128) .cse1)) (not (= v_ArrVal_2577 (store (select .cse18 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| (select v_ArrVal_2577 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|))))))))) (.cse10 (forall ((v_ArrVal_2577 (Array Int Int)) (v_arrayElimCell_128 Int) (v_ArrVal_2571 (Array Int Int))) (let ((.cse17 (store |c_#memory_int#2| |c_ULTIMATE.start_sll_circular_insert_#t~mem10#1.base| v_ArrVal_2571))) (let ((.cse16 (store .cse17 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_2577))) (or (forall ((v_arrayElimCell_133 Int) (v_arrayElimCell_132 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse16 v_arrayElimCell_132) (+ v_arrayElimCell_133 4)))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse16 v_arrayElimCell_128) .cse1)) (not (= v_ArrVal_2577 (store (select .cse17 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| (select v_ArrVal_2577 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|))))))))) (.cse11 (= |c_ULTIMATE.start_sll_circular_insert_#t~mem10#1.base| .cse15)) (.cse9 (or .cse12 .cse3)) (.cse5 (forall ((v_arrayElimCell_130 Int) (v_ArrVal_2577 (Array Int Int)) (v_ArrVal_2571 (Array Int Int))) (let ((.cse14 (store |c_#memory_int#2| |c_ULTIMATE.start_sll_circular_insert_#t~mem10#1.base| v_ArrVal_2571))) (or (forall ((v_arrayElimCell_133 Int) (v_arrayElimCell_132 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store .cse14 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_2577) v_arrayElimCell_132) (+ v_arrayElimCell_133 4)))) (= |c_ULTIMATE.start_main_~data~0#1| (select v_ArrVal_2577 (+ v_arrayElimCell_130 4))) (not (= v_ArrVal_2577 (store (select .cse14 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| (select v_ArrVal_2577 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|))))))))) (and (or .cse0 (forall ((v_ArrVal_2571 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store |c_#memory_int#2| |c_ULTIMATE.start_sll_circular_insert_#t~mem10#1.base| v_ArrVal_2571) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) .cse1)))) (or (forall ((v_ArrVal_2577 (Array Int Int)) (v_arrayElimCell_133 Int) (v_arrayElimCell_132 Int) (v_ArrVal_2571 (Array Int Int))) (let ((.cse2 (store |c_#memory_int#2| |c_ULTIMATE.start_sll_circular_insert_#t~mem10#1.base| v_ArrVal_2571))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store .cse2 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_2577) v_arrayElimCell_132) (+ v_arrayElimCell_133 4))) (not (= v_ArrVal_2577 (store (select .cse2 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| (select v_ArrVal_2577 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|))))))) .cse3) (or .cse4 (and (or .cse0 (forall ((v_arrayElimCell_130 Int) (v_DerPreprocessor_6 Int) (v_ArrVal_2571 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (store (select (store |c_#memory_int#2| |c_ULTIMATE.start_sll_circular_insert_#t~mem10#1.base| v_ArrVal_2571) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| v_DerPreprocessor_6) (+ v_arrayElimCell_130 4))))) .cse5)) (or (and .cse6 .cse7 .cse8 .cse9 .cse10) .cse11) (or .cse4 (and .cse6 .cse7 (or .cse12 .cse11 .cse3) .cse8 .cse10)) (or .cse11 (and .cse9 (or (forall ((v_arrayElimCell_130 Int) (v_DerPreprocessor_7 Int) (v_ArrVal_2571 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (store (select (store |c_#memory_int#2| |c_ULTIMATE.start_sll_circular_insert_#t~mem10#1.base| v_ArrVal_2571) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| v_DerPreprocessor_7) (+ v_arrayElimCell_130 4)))) .cse0) .cse5)) (forall ((v_ArrVal_2577 (Array Int Int)) (v_ArrVal_2571 (Array Int Int))) (let ((.cse13 (store |c_#memory_int#2| |c_ULTIMATE.start_sll_circular_insert_#t~mem10#1.base| v_ArrVal_2571))) (or (forall ((v_arrayElimCell_133 Int) (v_arrayElimCell_132 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store .cse13 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_2577) v_arrayElimCell_132) (+ v_arrayElimCell_133 4)))) (= (select v_ArrVal_2577 .cse1) |c_ULTIMATE.start_main_~data~0#1|) (not (= v_ArrVal_2577 (store (select .cse13 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| (select v_ArrVal_2577 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)))))))))))) is different from false [2025-01-09 22:43:16,120 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse17 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse0 (= .cse17 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|)) (.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse2 (+ 4 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)) (.cse11 (forall ((v_ArrVal_2577 (Array Int Int)) (v_arrayElimCell_133 Int) (v_arrayElimCell_132 Int) (v_ArrVal_2571 (Array Int Int))) (or (not (= (store (select |c_#memory_int#2| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| (select v_ArrVal_2577 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)) v_ArrVal_2577)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#2| .cse1 v_ArrVal_2571) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_2577) v_arrayElimCell_132) (+ v_arrayElimCell_133 4)))))) (.cse12 (not .cse0))) (let ((.cse4 (or .cse11 .cse12)) (.cse3 (forall ((v_arrayElimCell_130 Int) (v_ArrVal_2577 (Array Int Int)) (v_ArrVal_2571 (Array Int Int))) (let ((.cse22 (store |c_#memory_int#2| .cse1 v_ArrVal_2571))) (or (not (= v_ArrVal_2577 (store (select .cse22 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| (select v_ArrVal_2577 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)))) (= |c_ULTIMATE.start_main_~data~0#1| (select v_ArrVal_2577 (+ v_arrayElimCell_130 4))) (forall ((v_arrayElimCell_133 Int) (v_arrayElimCell_132 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store .cse22 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_2577) v_arrayElimCell_132) (+ v_arrayElimCell_133 4)))))))) (.cse6 (or .cse0 (forall ((v_arrayElimCell_130 Int) (v_ArrVal_2577 (Array Int Int)) (v_ArrVal_2571 (Array Int Int)) (v_arrayElimCell_128 Int)) (let ((.cse21 (store |c_#memory_int#2| .cse1 v_ArrVal_2571))) (or (not (= v_ArrVal_2577 (store (select .cse21 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| (select v_ArrVal_2577 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store .cse21 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_2577) v_arrayElimCell_128) (+ v_arrayElimCell_130 4)))))))) (.cse7 (forall ((v_ArrVal_2577 (Array Int Int)) (v_arrayElimCell_128 Int) (v_ArrVal_2571 (Array Int Int))) (let ((.cse19 (store |c_#memory_int#2| .cse1 v_ArrVal_2571))) (let ((.cse20 (store .cse19 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_2577))) (or (not (= v_ArrVal_2577 (store (select .cse19 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| (select v_ArrVal_2577 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)))) (forall ((v_arrayElimCell_133 Int) (v_arrayElimCell_132 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse20 v_arrayElimCell_132) (+ v_arrayElimCell_133 4)))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse20 v_arrayElimCell_128) .cse2))))))) (.cse8 (or (forall ((v_ArrVal_2577 (Array Int Int)) (v_ArrVal_2571 (Array Int Int)) (v_arrayElimCell_128 Int)) (let ((.cse18 (store |c_#memory_int#2| .cse1 v_ArrVal_2571))) (or (not (= v_ArrVal_2577 (store (select .cse18 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| (select v_ArrVal_2577 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store .cse18 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_2577) v_arrayElimCell_128) .cse2))))) .cse0)) (.cse5 (= .cse17 .cse1)) (.cse9 (forall ((v_arrayElimCell_130 Int) (v_ArrVal_2577 (Array Int Int)) (v_arrayElimCell_128 Int) (v_ArrVal_2571 (Array Int Int))) (let ((.cse15 (store |c_#memory_int#2| .cse1 v_ArrVal_2571))) (let ((.cse16 (store .cse15 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_2577))) (or (not (= v_ArrVal_2577 (store (select .cse15 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| (select v_ArrVal_2577 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)))) (forall ((v_arrayElimCell_133 Int) (v_arrayElimCell_132 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse16 v_arrayElimCell_132) (+ v_arrayElimCell_133 4)))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse16 v_arrayElimCell_128) (+ v_arrayElimCell_130 4)))))))) (.cse10 (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|)))) (and (or .cse0 (forall ((v_ArrVal_2571 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store |c_#memory_int#2| .cse1 v_ArrVal_2571) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) .cse2)))) (or (and .cse3 .cse4 (or .cse0 (forall ((v_arrayElimCell_130 Int) (v_DerPreprocessor_7 Int) (v_ArrVal_2571 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (store (select (store |c_#memory_int#2| .cse1 v_ArrVal_2571) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| v_DerPreprocessor_7) (+ v_arrayElimCell_130 4)))))) .cse5) (or (and .cse6 .cse4 .cse7 .cse8 .cse9) .cse5) (or (and (or .cse0 (forall ((v_arrayElimCell_130 Int) (v_DerPreprocessor_6 Int) (v_ArrVal_2571 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (store (select (store |c_#memory_int#2| .cse1 v_ArrVal_2571) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| v_DerPreprocessor_6) (+ v_arrayElimCell_130 4))))) .cse3) .cse10) (or (and .cse6 .cse7 .cse8 (or .cse11 .cse5 .cse12) .cse9) .cse10) (forall ((v_ArrVal_2577 (Array Int Int)) (v_ArrVal_2571 (Array Int Int))) (let ((.cse13 (store |c_#memory_int#2| .cse1 v_ArrVal_2571))) (or (not (= v_ArrVal_2577 (store (select .cse13 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| (select v_ArrVal_2577 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)))) (= (select v_ArrVal_2577 .cse2) |c_ULTIMATE.start_main_~data~0#1|) (forall ((v_arrayElimCell_133 Int) (v_arrayElimCell_132 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store .cse13 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_2577) v_arrayElimCell_132) (+ v_arrayElimCell_133 4))))))) (or .cse12 (forall ((v_ArrVal_2577 (Array Int Int)) (v_arrayElimCell_133 Int) (v_arrayElimCell_132 Int) (v_ArrVal_2571 (Array Int Int))) (let ((.cse14 (store |c_#memory_int#2| .cse1 v_ArrVal_2571))) (or (not (= v_ArrVal_2577 (store (select .cse14 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| (select v_ArrVal_2577 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store .cse14 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_2577) v_arrayElimCell_132) (+ v_arrayElimCell_133 4)))))))))))) is different from false [2025-01-09 22:43:16,267 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse21 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse13 (= .cse21 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|)) (.cse9 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse11 (+ |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.offset| 4)) (.cse4 (forall ((v_ArrVal_2577 (Array Int Int)) (v_arrayElimCell_133 Int) (v_arrayElimCell_132 Int) (v_ArrVal_2571 (Array Int Int))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#2| .cse9 v_ArrVal_2571) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| v_ArrVal_2577) v_arrayElimCell_132) (+ v_arrayElimCell_133 4))) (not (= (store (select |c_#memory_int#2| |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.offset| (select v_ArrVal_2577 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.offset|)) v_ArrVal_2577))))) (.cse5 (not .cse13))) (let ((.cse14 (forall ((v_arrayElimCell_130 Int) (v_ArrVal_2577 (Array Int Int)) (v_ArrVal_2571 (Array Int Int))) (let ((.cse22 (store |c_#memory_int#2| .cse9 v_ArrVal_2571))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select v_ArrVal_2577 (+ v_arrayElimCell_130 4))) (forall ((v_arrayElimCell_133 Int) (v_arrayElimCell_132 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store .cse22 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| v_ArrVal_2577) v_arrayElimCell_132) (+ v_arrayElimCell_133 4)))) (not (= (store (select .cse22 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.offset| (select v_ArrVal_2577 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.offset|)) v_ArrVal_2577)))))) (.cse7 (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (.cse6 (= .cse21 .cse9)) (.cse0 (forall ((v_arrayElimCell_130 Int) (v_ArrVal_2577 (Array Int Int)) (v_arrayElimCell_128 Int) (v_ArrVal_2571 (Array Int Int))) (let ((.cse20 (store |c_#memory_int#2| .cse9 v_ArrVal_2571))) (let ((.cse19 (store .cse20 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| v_ArrVal_2577))) (or (forall ((v_arrayElimCell_133 Int) (v_arrayElimCell_132 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse19 v_arrayElimCell_132) (+ v_arrayElimCell_133 4)))) (= (select (select .cse19 v_arrayElimCell_128) (+ v_arrayElimCell_130 4)) |c_ULTIMATE.start_main_~data~0#1|) (not (= (store (select .cse20 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.offset| (select v_ArrVal_2577 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.offset|)) v_ArrVal_2577))))))) (.cse12 (or .cse4 .cse5)) (.cse1 (forall ((v_ArrVal_2577 (Array Int Int)) (v_arrayElimCell_128 Int) (v_ArrVal_2571 (Array Int Int))) (let ((.cse18 (store |c_#memory_int#2| .cse9 v_ArrVal_2571))) (let ((.cse17 (store .cse18 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| v_ArrVal_2577))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse17 v_arrayElimCell_128) .cse11)) (forall ((v_arrayElimCell_133 Int) (v_arrayElimCell_132 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse17 v_arrayElimCell_132) (+ v_arrayElimCell_133 4)))) (not (= (store (select .cse18 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.offset| (select v_ArrVal_2577 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.offset|)) v_ArrVal_2577))))))) (.cse2 (or (forall ((v_arrayElimCell_130 Int) (v_ArrVal_2577 (Array Int Int)) (v_ArrVal_2571 (Array Int Int)) (v_arrayElimCell_128 Int)) (let ((.cse16 (store |c_#memory_int#2| .cse9 v_ArrVal_2571))) (or (= (select (select (store .cse16 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| v_ArrVal_2577) v_arrayElimCell_128) (+ v_arrayElimCell_130 4)) |c_ULTIMATE.start_main_~data~0#1|) (not (= (store (select .cse16 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.offset| (select v_ArrVal_2577 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.offset|)) v_ArrVal_2577))))) .cse13)) (.cse3 (or (forall ((v_ArrVal_2577 (Array Int Int)) (v_ArrVal_2571 (Array Int Int)) (v_arrayElimCell_128 Int)) (let ((.cse15 (store |c_#memory_int#2| .cse9 v_ArrVal_2571))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store .cse15 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| v_ArrVal_2577) v_arrayElimCell_128) .cse11)) (not (= (store (select .cse15 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.offset| (select v_ArrVal_2577 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.offset|)) v_ArrVal_2577))))) .cse13))) (and (or (and .cse0 .cse1 .cse2 .cse3 (or .cse4 .cse5 .cse6)) .cse7) (or (forall ((v_ArrVal_2577 (Array Int Int)) (v_arrayElimCell_133 Int) (v_arrayElimCell_132 Int) (v_ArrVal_2571 (Array Int Int))) (let ((.cse8 (store |c_#memory_int#2| .cse9 v_ArrVal_2571))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store .cse8 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| v_ArrVal_2577) v_arrayElimCell_132) (+ v_arrayElimCell_133 4))) (not (= (store (select .cse8 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.offset| (select v_ArrVal_2577 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.offset|)) v_ArrVal_2577))))) .cse5) (forall ((v_ArrVal_2577 (Array Int Int)) (v_ArrVal_2571 (Array Int Int))) (let ((.cse10 (store |c_#memory_int#2| .cse9 v_ArrVal_2571))) (or (forall ((v_arrayElimCell_133 Int) (v_arrayElimCell_132 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store .cse10 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| v_ArrVal_2577) v_arrayElimCell_132) (+ v_arrayElimCell_133 4)))) (= |c_ULTIMATE.start_main_~data~0#1| (select v_ArrVal_2577 .cse11)) (not (= (store (select .cse10 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.offset| (select v_ArrVal_2577 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.offset|)) v_ArrVal_2577))))) (or .cse6 (and .cse12 (or (forall ((v_arrayElimCell_130 Int) (v_DerPreprocessor_7 Int) (v_ArrVal_2571 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (store (select (store |c_#memory_int#2| .cse9 v_ArrVal_2571) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.offset| v_DerPreprocessor_7) (+ v_arrayElimCell_130 4)))) .cse13) .cse14)) (or (and (or (forall ((v_arrayElimCell_130 Int) (v_DerPreprocessor_6 Int) (v_ArrVal_2571 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (store (select (store |c_#memory_int#2| .cse9 v_ArrVal_2571) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.offset| v_DerPreprocessor_6) (+ v_arrayElimCell_130 4)))) .cse13) .cse14) .cse7) (or .cse6 (and .cse0 .cse12 .cse1 .cse2 .cse3)) (or (forall ((v_ArrVal_2571 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store |c_#memory_int#2| .cse9 v_ArrVal_2571) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|) .cse11))) .cse13)))))) is different from false [2025-01-09 22:43:18,396 INFO L349 Elim1Store]: treesize reduction 1615, result has 18.7 percent of original size [2025-01-09 22:43:18,397 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 20 select indices, 20 select index equivalence classes, 0 disjoint index pairs (out of 190 index pairs), introduced 21 new quantified variables, introduced 211 case distinctions, treesize of input 2503 treesize of output 2696 [2025-01-09 22:43:18,501 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 1745 treesize of output 1741 [2025-01-09 22:43:18,694 INFO L224 Elim1Store]: Index analysis took 123 ms [2025-01-09 22:43:20,563 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:43:20,564 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 20 select indices, 20 select index equivalence classes, 0 disjoint index pairs (out of 190 index pairs), introduced 20 new quantified variables, introduced 190 case distinctions, treesize of input 2255 treesize of output 3705 [2025-01-09 22:43:21,379 INFO L349 Elim1Store]: treesize reduction 32, result has 59.5 percent of original size [2025-01-09 22:43:21,380 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 3 new quantified variables, introduced 4 case distinctions, treesize of input 2046 treesize of output 2080 [2025-01-09 22:43:21,817 INFO L349 Elim1Store]: treesize reduction 24, result has 55.6 percent of original size [2025-01-09 22:43:21,818 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 2033 treesize of output 2052 [2025-01-09 22:43:22,638 INFO L349 Elim1Store]: treesize reduction 16, result has 60.0 percent of original size [2025-01-09 22:43:22,638 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 2024 treesize of output 2039 [2025-01-09 22:43:23,173 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:43:23,174 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 2015 treesize of output 2023 [2025-01-09 22:43:24,129 INFO L349 Elim1Store]: treesize reduction 16, result has 60.0 percent of original size [2025-01-09 22:43:24,129 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 2010 treesize of output 2025 [2025-01-09 22:43:24,641 INFO L349 Elim1Store]: treesize reduction 16, result has 60.0 percent of original size [2025-01-09 22:43:24,642 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 2001 treesize of output 2016 [2025-01-09 22:43:25,137 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 2006 treesize of output 2002 [2025-01-09 22:43:25,660 INFO L349 Elim1Store]: treesize reduction 16, result has 60.0 percent of original size [2025-01-09 22:43:25,661 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 2002 treesize of output 2017 [2025-01-09 22:43:26,212 INFO L349 Elim1Store]: treesize reduction 32, result has 59.5 percent of original size [2025-01-09 22:43:26,212 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 3 new quantified variables, introduced 4 case distinctions, treesize of input 1993 treesize of output 2027 [2025-01-09 22:43:26,746 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:43:26,747 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 1980 treesize of output 1988 [2025-01-09 22:43:27,699 INFO L349 Elim1Store]: treesize reduction 16, result has 60.0 percent of original size [2025-01-09 22:43:27,700 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 1975 treesize of output 1990 [2025-01-09 22:43:28,221 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 1966 treesize of output 1962 [2025-01-09 22:43:28,768 INFO L349 Elim1Store]: treesize reduction 16, result has 60.0 percent of original size [2025-01-09 22:43:28,768 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 1962 treesize of output 1977 [2025-01-09 22:43:29,278 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 1967 treesize of output 1963 [2025-01-09 22:43:29,894 INFO L349 Elim1Store]: treesize reduction 24, result has 55.6 percent of original size [2025-01-09 22:43:29,894 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 1963 treesize of output 1982 [2025-01-09 22:43:30,837 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 1954 treesize of output 1952 [2025-01-09 22:43:31,436 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 1952 treesize of output 1948