./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/list-simple/sll2n_append_equal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/list-simple/sll2n_append_equal.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f218eac2d2b52810cb44bb8b3f3f80463ec7e46c8818b20f079ed947cc8e9fd0 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 17:43:46,224 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 17:43:46,281 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-16 17:43:46,285 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 17:43:46,288 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 17:43:46,313 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 17:43:46,314 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 17:43:46,314 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 17:43:46,314 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 17:43:46,314 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 17:43:46,314 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 17:43:46,314 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 17:43:46,315 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 17:43:46,315 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 17:43:46,315 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 17:43:46,315 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 17:43:46,315 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 17:43:46,315 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 17:43:46,315 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 17:43:46,315 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 17:43:46,315 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 17:43:46,315 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 17:43:46,315 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 17:43:46,315 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 17:43:46,315 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 17:43:46,315 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 17:43:46,315 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 17:43:46,315 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 17:43:46,315 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 17:43:46,315 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 17:43:46,315 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 17:43:46,316 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 17:43:46,316 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 17:43:46,316 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 17:43:46,316 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 17:43:46,316 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 17:43:46,316 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 17:43:46,316 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 17:43:46,316 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 17:43:46,316 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 17:43:46,316 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 17:43:46,316 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 17:43:46,316 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 17:43:46,316 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/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 ! call(reach_error())) ) 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 -> f218eac2d2b52810cb44bb8b3f3f80463ec7e46c8818b20f079ed947cc8e9fd0 [2025-03-16 17:43:46,558 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 17:43:46,567 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 17:43:46,568 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 17:43:46,569 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 17:43:46,569 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 17:43:46,571 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-simple/sll2n_append_equal.i [2025-03-16 17:43:47,711 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b3b2151fe/8082e8d81f694cf2a2fe1eabe3d90746/FLAG6aefe42d9 [2025-03-16 17:43:48,037 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 17:43:48,039 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2n_append_equal.i [2025-03-16 17:43:48,052 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b3b2151fe/8082e8d81f694cf2a2fe1eabe3d90746/FLAG6aefe42d9 [2025-03-16 17:43:48,070 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b3b2151fe/8082e8d81f694cf2a2fe1eabe3d90746 [2025-03-16 17:43:48,073 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 17:43:48,074 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 17:43:48,075 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 17:43:48,075 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 17:43:48,081 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 17:43:48,082 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 05:43:48" (1/1) ... [2025-03-16 17:43:48,082 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@65f93a33 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:43:48, skipping insertion in model container [2025-03-16 17:43:48,082 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 05:43:48" (1/1) ... [2025-03-16 17:43:48,106 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 17:43:48,299 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2n_append_equal.i[24197,24210] [2025-03-16 17:43:48,302 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 17:43:48,308 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 17:43:48,349 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2n_append_equal.i[24197,24210] [2025-03-16 17:43:48,350 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 17:43:48,372 INFO L204 MainTranslator]: Completed translation [2025-03-16 17:43:48,373 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:43:48 WrapperNode [2025-03-16 17:43:48,373 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 17:43:48,374 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 17:43:48,374 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 17:43:48,374 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 17:43:48,379 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:43:48" (1/1) ... [2025-03-16 17:43:48,392 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:43:48" (1/1) ... [2025-03-16 17:43:48,410 INFO L138 Inliner]: procedures = 127, calls = 33, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 111 [2025-03-16 17:43:48,410 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 17:43:48,411 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 17:43:48,411 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 17:43:48,411 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 17:43:48,416 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:43:48" (1/1) ... [2025-03-16 17:43:48,417 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:43:48" (1/1) ... [2025-03-16 17:43:48,420 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:43:48" (1/1) ... [2025-03-16 17:43:48,444 INFO L175 MemorySlicer]: Split 17 memory accesses to 3 slices as follows [2, 9, 6]. 53 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 0, 1]. The 5 writes are split as follows [0, 4, 1]. [2025-03-16 17:43:48,444 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:43:48" (1/1) ... [2025-03-16 17:43:48,444 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:43:48" (1/1) ... [2025-03-16 17:43:48,449 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:43:48" (1/1) ... [2025-03-16 17:43:48,450 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:43:48" (1/1) ... [2025-03-16 17:43:48,451 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:43:48" (1/1) ... [2025-03-16 17:43:48,452 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:43:48" (1/1) ... [2025-03-16 17:43:48,456 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 17:43:48,457 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 17:43:48,457 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 17:43:48,457 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 17:43:48,458 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:43:48" (1/1) ... [2025-03-16 17:43:48,463 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 17:43:48,471 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 17:43:48,482 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-16 17:43:48,483 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-16 17:43:48,499 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-16 17:43:48,500 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-16 17:43:48,500 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-16 17:43:48,500 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-16 17:43:48,500 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-16 17:43:48,500 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-16 17:43:48,500 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2025-03-16 17:43:48,500 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2025-03-16 17:43:48,500 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-16 17:43:48,500 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 17:43:48,500 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-16 17:43:48,500 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-16 17:43:48,501 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-16 17:43:48,501 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-16 17:43:48,501 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-16 17:43:48,501 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-16 17:43:48,501 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-16 17:43:48,501 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-16 17:43:48,501 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-03-16 17:43:48,501 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-03-16 17:43:48,501 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-03-16 17:43:48,501 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 17:43:48,501 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-16 17:43:48,501 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-16 17:43:48,501 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 17:43:48,501 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 17:43:48,586 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 17:43:48,587 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 17:43:48,728 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L614: call ULTIMATE.dealloc(main_~#s~0#1.base, main_~#s~0#1.offset);havoc main_~#s~0#1.base, main_~#s~0#1.offset; [2025-03-16 17:43:48,746 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L577: havoc myexit_~s#1;havoc myexit_#in~s#1;assume { :end_inline_myexit } true; [2025-03-16 17:43:48,759 INFO L? ?]: Removed 38 outVars from TransFormulas that were not future-live. [2025-03-16 17:43:48,759 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 17:43:48,766 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 17:43:48,767 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 17:43:48,767 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 05:43:48 BoogieIcfgContainer [2025-03-16 17:43:48,767 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 17:43:48,769 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 17:43:48,769 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 17:43:48,772 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 17:43:48,772 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 05:43:48" (1/3) ... [2025-03-16 17:43:48,774 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1617e547 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 05:43:48, skipping insertion in model container [2025-03-16 17:43:48,774 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:43:48" (2/3) ... [2025-03-16 17:43:48,774 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1617e547 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 05:43:48, skipping insertion in model container [2025-03-16 17:43:48,774 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 05:43:48" (3/3) ... [2025-03-16 17:43:48,775 INFO L128 eAbstractionObserver]: Analyzing ICFG sll2n_append_equal.i [2025-03-16 17:43:48,786 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 17:43:48,787 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG sll2n_append_equal.i that has 2 procedures, 26 locations, 1 initial locations, 4 loop locations, and 1 error locations. [2025-03-16 17:43:48,830 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 17:43:48,839 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=LoopHeads, 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;@2ac85efa, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 17:43:48,840 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 17:43:48,843 INFO L276 IsEmpty]: Start isEmpty. Operand has 26 states, 21 states have (on average 1.4761904761904763) internal successors, (31), 22 states have internal predecessors, (31), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-16 17:43:48,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-03-16 17:43:48,848 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 17:43:48,848 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 17:43:48,849 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 17:43:48,852 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 17:43:48,852 INFO L85 PathProgramCache]: Analyzing trace with hash 760389571, now seen corresponding path program 1 times [2025-03-16 17:43:48,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 17:43:48,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1558502269] [2025-03-16 17:43:48,860 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 17:43:48,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 17:43:48,919 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-16 17:43:48,933 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-16 17:43:48,934 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 17:43:48,934 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:43:49,068 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 17:43:49,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 17:43:49,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1558502269] [2025-03-16 17:43:49,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1558502269] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 17:43:49,070 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 17:43:49,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 17:43:49,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1093283481] [2025-03-16 17:43:49,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 17:43:49,074 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 17:43:49,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 17:43:49,085 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 17:43:49,085 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 17:43:49,087 INFO L87 Difference]: Start difference. First operand has 26 states, 21 states have (on average 1.4761904761904763) internal successors, (31), 22 states have internal predecessors, (31), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-16 17:43:49,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 17:43:49,104 INFO L93 Difference]: Finished difference Result 51 states and 69 transitions. [2025-03-16 17:43:49,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 17:43:49,105 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2025-03-16 17:43:49,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 17:43:49,112 INFO L225 Difference]: With dead ends: 51 [2025-03-16 17:43:49,112 INFO L226 Difference]: Without dead ends: 24 [2025-03-16 17:43:49,114 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-03-16 17:43:49,116 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 1 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 17:43:49,117 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 60 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 17:43:49,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2025-03-16 17:43:49,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 22. [2025-03-16 17:43:49,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 18 states have internal predecessors, (23), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-16 17:43:49,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 27 transitions. [2025-03-16 17:43:49,139 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 27 transitions. Word has length 14 [2025-03-16 17:43:49,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 17:43:49,139 INFO L471 AbstractCegarLoop]: Abstraction has 22 states and 27 transitions. [2025-03-16 17:43:49,139 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-16 17:43:49,139 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 27 transitions. [2025-03-16 17:43:49,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-03-16 17:43:49,140 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 17:43:49,140 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 17:43:49,140 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-16 17:43:49,140 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 17:43:49,141 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 17:43:49,141 INFO L85 PathProgramCache]: Analyzing trace with hash 1190487073, now seen corresponding path program 1 times [2025-03-16 17:43:49,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 17:43:49,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [856368983] [2025-03-16 17:43:49,141 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 17:43:49,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 17:43:49,179 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-16 17:43:49,195 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-16 17:43:49,196 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 17:43:49,196 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:43:49,333 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-16 17:43:49,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 17:43:49,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [856368983] [2025-03-16 17:43:49,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [856368983] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 17:43:49,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1501620030] [2025-03-16 17:43:49,334 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 17:43:49,334 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 17:43:49,334 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 17:43:49,337 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 17:43:49,339 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-16 17:43:49,419 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-16 17:43:49,462 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-16 17:43:49,463 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 17:43:49,463 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:43:49,466 INFO L256 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-16 17:43:49,469 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 17:43:49,508 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 17:43:49,509 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 17:43:49,547 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-16 17:43:49,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1501620030] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 17:43:49,547 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 17:43:49,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2025-03-16 17:43:49,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1867107069] [2025-03-16 17:43:49,548 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 17:43:49,548 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 17:43:49,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 17:43:49,548 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 17:43:49,549 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-16 17:43:49,549 INFO L87 Difference]: Start difference. First operand 22 states and 27 transitions. Second operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-16 17:43:49,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 17:43:49,569 INFO L93 Difference]: Finished difference Result 42 states and 52 transitions. [2025-03-16 17:43:49,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 17:43:49,571 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 22 [2025-03-16 17:43:49,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 17:43:49,571 INFO L225 Difference]: With dead ends: 42 [2025-03-16 17:43:49,572 INFO L226 Difference]: Without dead ends: 25 [2025-03-16 17:43:49,572 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 41 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-16 17:43:49,573 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 1 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 17:43:49,574 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 66 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 17:43:49,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2025-03-16 17:43:49,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2025-03-16 17:43:49,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 20 states have (on average 1.25) internal successors, (25), 20 states have internal predecessors, (25), 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-03-16 17:43:49,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 31 transitions. [2025-03-16 17:43:49,579 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 31 transitions. Word has length 22 [2025-03-16 17:43:49,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 17:43:49,579 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 31 transitions. [2025-03-16 17:43:49,579 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-16 17:43:49,579 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 31 transitions. [2025-03-16 17:43:49,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-03-16 17:43:49,580 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 17:43:49,580 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 17:43:49,587 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-16 17:43:49,780 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 17:43:49,781 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 17:43:49,781 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 17:43:49,781 INFO L85 PathProgramCache]: Analyzing trace with hash 1958013567, now seen corresponding path program 2 times [2025-03-16 17:43:49,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 17:43:49,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1004726555] [2025-03-16 17:43:49,781 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-16 17:43:49,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 17:43:49,801 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 30 statements into 2 equivalence classes. [2025-03-16 17:43:49,811 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 14 of 30 statements. [2025-03-16 17:43:49,812 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-16 17:43:49,813 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:43:50,106 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-16 17:43:50,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 17:43:50,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1004726555] [2025-03-16 17:43:50,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1004726555] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 17:43:50,107 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 17:43:50,107 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-16 17:43:50,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [269224035] [2025-03-16 17:43:50,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 17:43:50,107 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-16 17:43:50,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 17:43:50,108 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-16 17:43:50,108 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-03-16 17:43:50,108 INFO L87 Difference]: Start difference. First operand 25 states and 31 transitions. Second operand has 10 states, 9 states have (on average 2.0) internal successors, (18), 9 states have internal predecessors, (18), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-16 17:43:50,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 17:43:50,227 INFO L93 Difference]: Finished difference Result 35 states and 43 transitions. [2025-03-16 17:43:50,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-16 17:43:50,228 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.0) internal successors, (18), 9 states have internal predecessors, (18), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 30 [2025-03-16 17:43:50,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 17:43:50,228 INFO L225 Difference]: With dead ends: 35 [2025-03-16 17:43:50,229 INFO L226 Difference]: Without dead ends: 33 [2025-03-16 17:43:50,229 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2025-03-16 17:43:50,229 INFO L435 NwaCegarLoop]: 15 mSDtfsCounter, 10 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 17:43:50,230 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 106 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 17:43:50,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2025-03-16 17:43:50,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 28. [2025-03-16 17:43:50,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 23 states have internal predecessors, (29), 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-03-16 17:43:50,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 35 transitions. [2025-03-16 17:43:50,233 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 35 transitions. Word has length 30 [2025-03-16 17:43:50,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 17:43:50,233 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 35 transitions. [2025-03-16 17:43:50,233 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.0) internal successors, (18), 9 states have internal predecessors, (18), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-16 17:43:50,233 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 35 transitions. [2025-03-16 17:43:50,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-03-16 17:43:50,234 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 17:43:50,234 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 17:43:50,234 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-16 17:43:50,234 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 17:43:50,235 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 17:43:50,235 INFO L85 PathProgramCache]: Analyzing trace with hash 1958014373, now seen corresponding path program 1 times [2025-03-16 17:43:50,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 17:43:50,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1646136076] [2025-03-16 17:43:50,235 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 17:43:50,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 17:43:50,249 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-16 17:43:50,257 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-16 17:43:50,259 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 17:43:50,259 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:43:50,710 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 13 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-16 17:43:50,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 17:43:50,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1646136076] [2025-03-16 17:43:50,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1646136076] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 17:43:50,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [336397448] [2025-03-16 17:43:50,712 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 17:43:50,712 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 17:43:50,712 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 17:43:50,714 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 17:43:50,716 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-16 17:43:50,802 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-16 17:43:50,838 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-16 17:43:50,838 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 17:43:50,838 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:43:50,843 INFO L256 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-03-16 17:43:50,847 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 17:43:51,032 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-03-16 17:43:51,052 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 13 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-16 17:43:51,052 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 17:43:51,093 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-16 17:43:51,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [336397448] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 17:43:51,095 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 17:43:51,095 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 9, 8] total 21 [2025-03-16 17:43:51,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [555013787] [2025-03-16 17:43:51,095 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 17:43:51,095 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-03-16 17:43:51,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 17:43:51,096 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-03-16 17:43:51,096 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=379, Unknown=0, NotChecked=0, Total=420 [2025-03-16 17:43:51,096 INFO L87 Difference]: Start difference. First operand 28 states and 35 transitions. Second operand has 21 states, 20 states have (on average 1.85) internal successors, (37), 17 states have internal predecessors, (37), 3 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) [2025-03-16 17:43:55,118 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-16 17:43:59,160 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-16 17:44:03,210 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-16 17:44:07,280 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-16 17:44:07,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 17:44:07,489 INFO L93 Difference]: Finished difference Result 39 states and 47 transitions. [2025-03-16 17:44:07,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-16 17:44:07,489 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 1.85) internal successors, (37), 17 states have internal predecessors, (37), 3 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) Word has length 30 [2025-03-16 17:44:07,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 17:44:07,490 INFO L225 Difference]: With dead ends: 39 [2025-03-16 17:44:07,490 INFO L226 Difference]: Without dead ends: 31 [2025-03-16 17:44:07,490 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 52 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=107, Invalid=949, Unknown=0, NotChecked=0, Total=1056 [2025-03-16 17:44:07,491 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 17 mSDsluCounter, 270 mSDsCounter, 0 mSdLazyCounter, 287 mSolverCounterSat, 4 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 288 SdHoareTripleChecker+Invalid, 295 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 287 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 16.2s IncrementalHoareTripleChecker+Time [2025-03-16 17:44:07,491 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 288 Invalid, 295 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 287 Invalid, 4 Unknown, 0 Unchecked, 16.2s Time] [2025-03-16 17:44:07,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2025-03-16 17:44:07,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2025-03-16 17:44:07,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 25 states have (on average 1.16) internal successors, (29), 25 states have internal predecessors, (29), 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-03-16 17:44:07,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 35 transitions. [2025-03-16 17:44:07,495 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 35 transitions. Word has length 30 [2025-03-16 17:44:07,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 17:44:07,495 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 35 transitions. [2025-03-16 17:44:07,495 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 1.85) internal successors, (37), 17 states have internal predecessors, (37), 3 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) [2025-03-16 17:44:07,495 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2025-03-16 17:44:07,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-03-16 17:44:07,496 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 17:44:07,496 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 17:44:07,503 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-16 17:44:07,698 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2025-03-16 17:44:07,698 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 17:44:07,698 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 17:44:07,698 INFO L85 PathProgramCache]: Analyzing trace with hash 118862615, now seen corresponding path program 1 times [2025-03-16 17:44:07,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 17:44:07,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [896659213] [2025-03-16 17:44:07,699 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 17:44:07,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 17:44:07,717 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-16 17:44:07,733 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-16 17:44:07,733 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 17:44:07,734 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:44:08,430 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 10 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-16 17:44:08,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 17:44:08,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [896659213] [2025-03-16 17:44:08,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [896659213] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 17:44:08,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1420633272] [2025-03-16 17:44:08,431 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 17:44:08,431 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 17:44:08,431 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 17:44:08,433 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 17:44:08,435 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-16 17:44:08,508 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-16 17:44:08,555 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-16 17:44:08,556 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 17:44:08,556 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:44:08,558 INFO L256 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 74 conjuncts are in the unsatisfiable core [2025-03-16 17:44:08,561 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 17:44:08,605 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-03-16 17:44:08,618 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-03-16 17:44:08,671 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-03-16 17:44:08,767 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-03-16 17:44:08,774 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-03-16 17:44:08,847 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((|v_node_create_~temp~0#1.base_24| Int)) (and (= (select |c_old(#valid)| |v_node_create_~temp~0#1.base_24|) 0) (= |c_#memory_int#1| (store |c_old(#memory_int#1)| |v_node_create_~temp~0#1.base_24| (select |c_#memory_int#1| |v_node_create_~temp~0#1.base_24|))))) (exists ((|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_3| Int)) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_3|) 0) 0))) is different from true [2025-03-16 17:44:08,886 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2025-03-16 17:44:08,887 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-03-16 17:44:08,893 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-03-16 17:44:09,038 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 39 treesize of output 15 [2025-03-16 17:44:09,087 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-03-16 17:44:09,132 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 10 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 2 not checked. [2025-03-16 17:44:09,132 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 17:44:09,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1420633272] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 17:44:09,338 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-16 17:44:09,338 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 28 [2025-03-16 17:44:09,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1391983165] [2025-03-16 17:44:09,338 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-16 17:44:09,338 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-03-16 17:44:09,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 17:44:09,339 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-03-16 17:44:09,339 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=765, Unknown=13, NotChecked=56, Total=930 [2025-03-16 17:44:09,339 INFO L87 Difference]: Start difference. First operand 31 states and 35 transitions. Second operand has 28 states, 26 states have (on average 1.6538461538461537) internal successors, (43), 24 states have internal predecessors, (43), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2025-03-16 17:44:09,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 17:44:09,746 INFO L93 Difference]: Finished difference Result 44 states and 50 transitions. [2025-03-16 17:44:09,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-16 17:44:09,747 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 26 states have (on average 1.6538461538461537) internal successors, (43), 24 states have internal predecessors, (43), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 33 [2025-03-16 17:44:09,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 17:44:09,748 INFO L225 Difference]: With dead ends: 44 [2025-03-16 17:44:09,748 INFO L226 Difference]: Without dead ends: 42 [2025-03-16 17:44:09,749 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 268 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=141, Invalid=1256, Unknown=13, NotChecked=72, Total=1482 [2025-03-16 17:44:09,749 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 26 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 318 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 364 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 318 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 43 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 17:44:09,749 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 148 Invalid, 364 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 318 Invalid, 0 Unknown, 43 Unchecked, 0.2s Time] [2025-03-16 17:44:09,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2025-03-16 17:44:09,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 37. [2025-03-16 17:44:09,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 31 states have (on average 1.1612903225806452) internal successors, (36), 31 states have internal predecessors, (36), 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-03-16 17:44:09,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 42 transitions. [2025-03-16 17:44:09,754 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 42 transitions. Word has length 33 [2025-03-16 17:44:09,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 17:44:09,754 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 42 transitions. [2025-03-16 17:44:09,754 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 26 states have (on average 1.6538461538461537) internal successors, (43), 24 states have internal predecessors, (43), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2025-03-16 17:44:09,754 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 42 transitions. [2025-03-16 17:44:09,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-03-16 17:44:09,755 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 17:44:09,755 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 17:44:09,762 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-16 17:44:09,955 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 17:44:09,955 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 17:44:09,956 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 17:44:09,956 INFO L85 PathProgramCache]: Analyzing trace with hash -1737070472, now seen corresponding path program 1 times [2025-03-16 17:44:09,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 17:44:09,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2095404169] [2025-03-16 17:44:09,956 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 17:44:09,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 17:44:09,967 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-16 17:44:09,980 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-16 17:44:09,981 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 17:44:09,981 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:44:10,737 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 13 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-16 17:44:10,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 17:44:10,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2095404169] [2025-03-16 17:44:10,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2095404169] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 17:44:10,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1206706817] [2025-03-16 17:44:10,737 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 17:44:10,737 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 17:44:10,738 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 17:44:10,739 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 17:44:10,740 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-16 17:44:10,814 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-16 17:44:10,895 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-16 17:44:10,895 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 17:44:10,895 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:44:10,898 INFO L256 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 61 conjuncts are in the unsatisfiable core [2025-03-16 17:44:10,900 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 17:44:11,000 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-03-16 17:44:11,084 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-03-16 17:44:11,163 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 4 [2025-03-16 17:44:11,166 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-03-16 17:44:11,224 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v_node_create_~temp~0#1.base_33| Int)) (and (= (select |c_old(#valid)| |v_node_create_~temp~0#1.base_33|) 0) (= |c_#memory_$Pointer$#1.base| (store |c_old(#memory_$Pointer$#1.base)| |v_node_create_~temp~0#1.base_33| (select |c_#memory_$Pointer$#1.base| |v_node_create_~temp~0#1.base_33|))))) is different from true [2025-03-16 17:44:11,240 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-16 17:44:11,240 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 22 [2025-03-16 17:44:11,247 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2025-03-16 17:44:11,247 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-03-16 17:44:11,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 36 treesize of output 8 [2025-03-16 17:44:11,370 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 4 not checked. [2025-03-16 17:44:11,370 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 17:44:11,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1206706817] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 17:44:11,518 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-16 17:44:11,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 34 [2025-03-16 17:44:11,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1062397234] [2025-03-16 17:44:11,518 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-16 17:44:11,518 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-03-16 17:44:11,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 17:44:11,519 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-03-16 17:44:11,519 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=1244, Unknown=1, NotChecked=70, Total=1406 [2025-03-16 17:44:11,519 INFO L87 Difference]: Start difference. First operand 37 states and 42 transitions. Second operand has 34 states, 32 states have (on average 1.71875) internal successors, (55), 28 states have internal predecessors, (55), 5 states have call successors, (5), 3 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2025-03-16 17:44:12,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 17:44:12,046 INFO L93 Difference]: Finished difference Result 43 states and 50 transitions. [2025-03-16 17:44:12,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-16 17:44:12,046 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 32 states have (on average 1.71875) internal successors, (55), 28 states have internal predecessors, (55), 5 states have call successors, (5), 3 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 35 [2025-03-16 17:44:12,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 17:44:12,047 INFO L225 Difference]: With dead ends: 43 [2025-03-16 17:44:12,048 INFO L226 Difference]: Without dead ends: 34 [2025-03-16 17:44:12,048 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 179 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=164, Invalid=2095, Unknown=1, NotChecked=92, Total=2352 [2025-03-16 17:44:12,049 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 15 mSDsluCounter, 346 mSDsCounter, 0 mSdLazyCounter, 523 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 363 SdHoareTripleChecker+Invalid, 557 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 523 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 32 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 17:44:12,049 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 363 Invalid, 557 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 523 Invalid, 0 Unknown, 32 Unchecked, 0.3s Time] [2025-03-16 17:44:12,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2025-03-16 17:44:12,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2025-03-16 17:44:12,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 27 states have (on average 1.1481481481481481) internal successors, (31), 27 states have internal predecessors, (31), 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-03-16 17:44:12,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2025-03-16 17:44:12,053 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 35 [2025-03-16 17:44:12,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 17:44:12,054 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2025-03-16 17:44:12,054 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 32 states have (on average 1.71875) internal successors, (55), 28 states have internal predecessors, (55), 5 states have call successors, (5), 3 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2025-03-16 17:44:12,054 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2025-03-16 17:44:12,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-03-16 17:44:12,054 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 17:44:12,054 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 17:44:12,062 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-16 17:44:12,259 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 17:44:12,259 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 17:44:12,259 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 17:44:12,259 INFO L85 PathProgramCache]: Analyzing trace with hash 295220184, now seen corresponding path program 1 times [2025-03-16 17:44:12,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 17:44:12,259 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [634562848] [2025-03-16 17:44:12,260 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 17:44:12,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 17:44:12,269 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-16 17:44:12,277 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-16 17:44:12,277 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 17:44:12,277 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:44:13,009 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 8 proven. 13 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-16 17:44:13,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 17:44:13,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [634562848] [2025-03-16 17:44:13,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [634562848] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 17:44:13,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [415899670] [2025-03-16 17:44:13,010 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 17:44:13,010 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 17:44:13,010 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 17:44:13,012 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 17:44:13,013 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-16 17:44:13,077 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-16 17:44:13,141 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-16 17:44:13,141 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 17:44:13,141 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:44:13,143 INFO L256 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 108 conjuncts are in the unsatisfiable core [2025-03-16 17:44:13,148 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 17:44:13,178 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-03-16 17:44:13,325 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-03-16 17:44:13,375 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-03-16 17:44:13,375 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-03-16 17:44:13,420 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-03-16 17:44:13,434 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-16 17:44:13,532 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2025-03-16 17:44:13,535 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-03-16 17:44:13,538 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-03-16 17:44:13,626 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2025-03-16 17:44:13,635 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((|v_node_create_~temp~0#1.base_42| Int)) (let ((.cse0 (select |c_#memory_int#1| |v_node_create_~temp~0#1.base_42|))) (and (= 0 (select |c_old(#valid)| |v_node_create_~temp~0#1.base_42|)) (= |c_#memory_int#1| (store |c_old(#memory_int#1)| |v_node_create_~temp~0#1.base_42| .cse0)) (= |c_node_create_#in~data#1| (select .cse0 0)) (= |c_#memory_$Pointer$#1.base| (store |c_old(#memory_$Pointer$#1.base)| |v_node_create_~temp~0#1.base_42| (select |c_#memory_$Pointer$#1.base| |v_node_create_~temp~0#1.base_42|)))))) (exists ((|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_5| Int)) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_5|) 0) 0))) is different from true [2025-03-16 17:44:13,661 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-16 17:44:13,663 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 27 [2025-03-16 17:44:13,674 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2025-03-16 17:44:13,674 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-03-16 17:44:13,683 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2025-03-16 17:44:13,867 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 40 treesize of output 16 [2025-03-16 17:44:13,979 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 25 [2025-03-16 17:44:14,033 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-03-16 17:44:14,094 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 9 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2025-03-16 17:44:14,094 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 17:44:14,099 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_631 (Array Int Int))) (= (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_sll_append_~last~0#1.base| v_ArrVal_631) (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) |c_ULTIMATE.start_main_~data~0#1|)) is different from false [2025-03-16 17:44:14,160 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_631 (Array Int Int))) (= (select (select (store |c_#memory_int#1| (select (select |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|)) (+ (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 4)) v_ArrVal_631) (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) |c_ULTIMATE.start_main_~data~0#1|)) is different from false [2025-03-16 17:44:14,211 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-16 17:44:14,212 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 45 [2025-03-16 17:44:14,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [415899670] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 17:44:14,258 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-16 17:44:14,258 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 42 [2025-03-16 17:44:14,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [318245387] [2025-03-16 17:44:14,258 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-16 17:44:14,258 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2025-03-16 17:44:14,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 17:44:14,259 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2025-03-16 17:44:14,259 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=1666, Unknown=18, NotChecked=252, Total=2070 [2025-03-16 17:44:14,260 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. Second operand has 42 states, 40 states have (on average 1.425) internal successors, (57), 34 states have internal predecessors, (57), 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-03-16 17:44:15,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 17:44:15,098 INFO L93 Difference]: Finished difference Result 47 states and 54 transitions. [2025-03-16 17:44:15,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-16 17:44:15,098 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 40 states have (on average 1.425) internal successors, (57), 34 states have internal predecessors, (57), 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 35 [2025-03-16 17:44:15,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 17:44:15,099 INFO L225 Difference]: With dead ends: 47 [2025-03-16 17:44:15,099 INFO L226 Difference]: Without dead ends: 45 [2025-03-16 17:44:15,100 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 787 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=266, Invalid=3150, Unknown=18, NotChecked=348, Total=3782 [2025-03-16 17:44:15,100 INFO L435 NwaCegarLoop]: 15 mSDtfsCounter, 28 mSDsluCounter, 213 mSDsCounter, 0 mSdLazyCounter, 496 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 228 SdHoareTripleChecker+Invalid, 555 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 496 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 49 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 17:44:15,100 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 228 Invalid, 555 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 496 Invalid, 0 Unknown, 49 Unchecked, 0.3s Time] [2025-03-16 17:44:15,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2025-03-16 17:44:15,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 39. [2025-03-16 17:44:15,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 33 states have (on average 1.1515151515151516) internal successors, (38), 33 states have internal predecessors, (38), 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-03-16 17:44:15,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 44 transitions. [2025-03-16 17:44:15,105 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 44 transitions. Word has length 35 [2025-03-16 17:44:15,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 17:44:15,106 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 44 transitions. [2025-03-16 17:44:15,106 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 40 states have (on average 1.425) internal successors, (57), 34 states have internal predecessors, (57), 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-03-16 17:44:15,106 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 44 transitions. [2025-03-16 17:44:15,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-03-16 17:44:15,106 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 17:44:15,106 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 17:44:15,113 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-16 17:44:15,306 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 17:44:15,307 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 17:44:15,307 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 17:44:15,307 INFO L85 PathProgramCache]: Analyzing trace with hash 238828793, now seen corresponding path program 1 times [2025-03-16 17:44:15,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 17:44:15,307 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1486816346] [2025-03-16 17:44:15,307 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 17:44:15,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 17:44:15,317 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-16 17:44:15,336 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-16 17:44:15,337 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 17:44:15,337 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:44:16,885 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 3 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 17:44:16,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 17:44:16,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1486816346] [2025-03-16 17:44:16,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1486816346] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 17:44:16,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [566336047] [2025-03-16 17:44:16,885 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 17:44:16,885 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 17:44:16,885 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 17:44:16,888 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 17:44:16,889 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-16 17:44:16,961 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-16 17:44:17,049 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-16 17:44:17,049 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 17:44:17,049 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:44:17,051 INFO L256 TraceCheckSpWp]: Trace formula consists of 344 conjuncts, 125 conjuncts are in the unsatisfiable core [2025-03-16 17:44:17,056 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 17:44:17,103 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-03-16 17:44:17,111 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-03-16 17:44:17,159 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-03-16 17:44:17,272 WARN L851 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_#valid_BEFORE_CALL_10| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_10| |c_ULTIMATE.start_sll_create_#t~ret4#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_10| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 1) (= |c_#valid| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_10| |c_#valid|))) (store |v_#valid_BEFORE_CALL_10| .cse0 (select |c_#valid| .cse0)))))) (or (= (select (select |c_#memory_int#1| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 0) 1) (exists ((|v_#memory_int#1_BEFORE_CALL_6| (Array Int (Array Int Int)))) (let ((.cse1 (@diff |v_#memory_int#1_BEFORE_CALL_6| |c_#memory_int#1|))) (and (= |c_ULTIMATE.start_sll_create_#t~ret4#1.base| .cse1) (= |c_#memory_int#1| (store |v_#memory_int#1_BEFORE_CALL_6| .cse1 (select |c_#memory_int#1| .cse1))) (= (select (select |v_#memory_int#1_BEFORE_CALL_6| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 0) 1))))) (= |c_ULTIMATE.start_sll_create_#t~ret4#1.offset| 0) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_#t~ret4#1.base|) 1)) is different from false [2025-03-16 17:44:17,275 WARN L873 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_#valid_BEFORE_CALL_10| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_10| |c_ULTIMATE.start_sll_create_#t~ret4#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_10| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 1) (= |c_#valid| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_10| |c_#valid|))) (store |v_#valid_BEFORE_CALL_10| .cse0 (select |c_#valid| .cse0)))))) (or (= (select (select |c_#memory_int#1| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 0) 1) (exists ((|v_#memory_int#1_BEFORE_CALL_6| (Array Int (Array Int Int)))) (let ((.cse1 (@diff |v_#memory_int#1_BEFORE_CALL_6| |c_#memory_int#1|))) (and (= |c_ULTIMATE.start_sll_create_#t~ret4#1.base| .cse1) (= |c_#memory_int#1| (store |v_#memory_int#1_BEFORE_CALL_6| .cse1 (select |c_#memory_int#1| .cse1))) (= (select (select |v_#memory_int#1_BEFORE_CALL_6| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 0) 1))))) (= |c_ULTIMATE.start_sll_create_#t~ret4#1.offset| 0) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_#t~ret4#1.base|) 1)) is different from true [2025-03-16 17:44:17,305 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2025-03-16 17:44:17,305 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-03-16 17:44:17,322 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-16 17:44:17,324 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-03-16 17:44:17,331 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4) 0) (exists ((|v_#valid_BEFORE_CALL_10| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_10| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_10| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 0) (= |c_#valid| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_10| |c_#valid|))) (store |v_#valid_BEFORE_CALL_10| .cse1 (select |c_#valid| .cse1)))))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 1) (= |c_ULTIMATE.start_main_~data~0#1| 1) (or (exists ((|v_#memory_int#1_111| (Array Int (Array Int Int)))) (and (exists ((|v_#memory_int#1_BEFORE_CALL_6| (Array Int (Array Int Int)))) (let ((.cse2 (@diff |v_#memory_int#1_BEFORE_CALL_6| |v_#memory_int#1_111|))) (and (= (store |v_#memory_int#1_BEFORE_CALL_6| .cse2 (select |v_#memory_int#1_111| .cse2)) |v_#memory_int#1_111|) (= .cse2 |c_ULTIMATE.start_sll_create_~head~0#1.base|) (= (select (select |v_#memory_int#1_BEFORE_CALL_6| .cse0) 0) 1)))) (= |c_#memory_int#1| (store |v_#memory_int#1_111| |c_ULTIMATE.start_sll_create_~head~0#1.base| (select |c_#memory_int#1| |c_ULTIMATE.start_sll_create_~head~0#1.base|))))) (= (select (select |c_#memory_int#1| .cse0) 0) 1) (= .cse0 |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0))) is different from false [2025-03-16 17:44:17,333 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4) 0) (exists ((|v_#valid_BEFORE_CALL_10| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_10| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_10| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 0) (= |c_#valid| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_10| |c_#valid|))) (store |v_#valid_BEFORE_CALL_10| .cse1 (select |c_#valid| .cse1)))))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 1) (= |c_ULTIMATE.start_main_~data~0#1| 1) (or (exists ((|v_#memory_int#1_111| (Array Int (Array Int Int)))) (and (exists ((|v_#memory_int#1_BEFORE_CALL_6| (Array Int (Array Int Int)))) (let ((.cse2 (@diff |v_#memory_int#1_BEFORE_CALL_6| |v_#memory_int#1_111|))) (and (= (store |v_#memory_int#1_BEFORE_CALL_6| .cse2 (select |v_#memory_int#1_111| .cse2)) |v_#memory_int#1_111|) (= .cse2 |c_ULTIMATE.start_sll_create_~head~0#1.base|) (= (select (select |v_#memory_int#1_BEFORE_CALL_6| .cse0) 0) 1)))) (= |c_#memory_int#1| (store |v_#memory_int#1_111| |c_ULTIMATE.start_sll_create_~head~0#1.base| (select |c_#memory_int#1| |c_ULTIMATE.start_sll_create_~head~0#1.base|))))) (= (select (select |c_#memory_int#1| .cse0) 0) 1) (= .cse0 |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0))) is different from true [2025-03-16 17:44:17,374 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| .cse1) 4))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (or (= (select (select |c_#memory_int#1| .cse0) 0) 1) (= .cse0 .cse1)) (= (select |c_#valid| .cse1) 1) (= |c_ULTIMATE.start_sll_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#1.offset| .cse1) 4) 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_sll_append_~head#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_10| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_10| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_10| .cse1) 0) (= |c_#valid| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_10| |c_#valid|))) (store |v_#valid_BEFORE_CALL_10| .cse2 (select |c_#valid| .cse2))))))))) is different from false [2025-03-16 17:44:17,376 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| .cse1) 4))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (or (= (select (select |c_#memory_int#1| .cse0) 0) 1) (= .cse0 .cse1)) (= (select |c_#valid| .cse1) 1) (= |c_ULTIMATE.start_sll_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#1.offset| .cse1) 4) 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_sll_append_~head#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_10| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_10| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_10| .cse1) 0) (= |c_#valid| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_10| |c_#valid|))) (store |v_#valid_BEFORE_CALL_10| .cse2 (select |c_#valid| .cse2))))))))) is different from true [2025-03-16 17:44:17,387 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 45 treesize of output 21 [2025-03-16 17:44:17,391 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2025-03-16 17:44:17,398 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-03-16 17:44:17,418 WARN L851 $PredicateComparison]: unable to prove that (and (= |c_#memory_int#1| |c_old(#memory_int#1)|) (= |c_#valid| |c_old(#valid)|) (exists ((|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_10| (Array Int Int)) (|v_#valid_BEFORE_CALL_11| (Array Int Int)) (v_arrayElimCell_34 Int)) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (= (select |v_#valid_BEFORE_CALL_10| v_arrayElimCell_34) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6|) 0) 0) (= |v_#valid_BEFORE_CALL_11| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_10| |v_#valid_BEFORE_CALL_11|))) (store |v_#valid_BEFORE_CALL_10| .cse0 (select |v_#valid_BEFORE_CALL_11| .cse0)))) (= (select |v_#valid_BEFORE_CALL_11| .cse1) 1) (= 0 (select |v_#valid_BEFORE_CALL_10| .cse1))))) (= |c_#memory_$Pointer$#1.offset| |c_old(#memory_$Pointer$#1.offset)|) (= |c_#memory_$Pointer$#1.base| |c_old(#memory_$Pointer$#1.base)|)) is different from false [2025-03-16 17:44:17,420 WARN L873 $PredicateComparison]: unable to prove that (and (= |c_#memory_int#1| |c_old(#memory_int#1)|) (= |c_#valid| |c_old(#valid)|) (exists ((|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_10| (Array Int Int)) (|v_#valid_BEFORE_CALL_11| (Array Int Int)) (v_arrayElimCell_34 Int)) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (= (select |v_#valid_BEFORE_CALL_10| v_arrayElimCell_34) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6|) 0) 0) (= |v_#valid_BEFORE_CALL_11| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_10| |v_#valid_BEFORE_CALL_11|))) (store |v_#valid_BEFORE_CALL_10| .cse0 (select |v_#valid_BEFORE_CALL_11| .cse0)))) (= (select |v_#valid_BEFORE_CALL_11| .cse1) 1) (= 0 (select |v_#valid_BEFORE_CALL_10| .cse1))))) (= |c_#memory_$Pointer$#1.offset| |c_old(#memory_$Pointer$#1.offset)|) (= |c_#memory_$Pointer$#1.base| |c_old(#memory_$Pointer$#1.base)|)) is different from true [2025-03-16 17:44:17,443 WARN L851 $PredicateComparison]: unable to prove that (and (= |c_#memory_int#1| |c_old(#memory_int#1)|) (exists ((|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_10| (Array Int Int)) (|v_#valid_BEFORE_CALL_11| (Array Int Int)) (v_arrayElimCell_34 Int)) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (= (select |v_#valid_BEFORE_CALL_10| v_arrayElimCell_34) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6|) 0) 0) (= |v_#valid_BEFORE_CALL_11| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_10| |v_#valid_BEFORE_CALL_11|))) (store |v_#valid_BEFORE_CALL_10| .cse0 (select |v_#valid_BEFORE_CALL_11| .cse0)))) (= (select |v_#valid_BEFORE_CALL_11| .cse1) 1) (= 0 (select |v_#valid_BEFORE_CALL_10| .cse1))))) (= |c_#memory_$Pointer$#1.offset| |c_old(#memory_$Pointer$#1.offset)|) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (= |c_#memory_$Pointer$#1.base| |c_old(#memory_$Pointer$#1.base)|)) is different from false [2025-03-16 17:44:17,444 WARN L873 $PredicateComparison]: unable to prove that (and (= |c_#memory_int#1| |c_old(#memory_int#1)|) (exists ((|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_10| (Array Int Int)) (|v_#valid_BEFORE_CALL_11| (Array Int Int)) (v_arrayElimCell_34 Int)) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (= (select |v_#valid_BEFORE_CALL_10| v_arrayElimCell_34) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6|) 0) 0) (= |v_#valid_BEFORE_CALL_11| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_10| |v_#valid_BEFORE_CALL_11|))) (store |v_#valid_BEFORE_CALL_10| .cse0 (select |v_#valid_BEFORE_CALL_11| .cse0)))) (= (select |v_#valid_BEFORE_CALL_11| .cse1) 1) (= 0 (select |v_#valid_BEFORE_CALL_10| .cse1))))) (= |c_#memory_$Pointer$#1.offset| |c_old(#memory_$Pointer$#1.offset)|) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (= |c_#memory_$Pointer$#1.base| |c_old(#memory_$Pointer$#1.base)|)) is different from true [2025-03-16 17:44:17,483 WARN L851 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_10| (Array Int Int)) (|v_#valid_BEFORE_CALL_11| (Array Int Int)) (v_arrayElimCell_34 Int)) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (= (select |v_#valid_BEFORE_CALL_10| v_arrayElimCell_34) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6|) 0) 0) (= |v_#valid_BEFORE_CALL_11| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_10| |v_#valid_BEFORE_CALL_11|))) (store |v_#valid_BEFORE_CALL_10| .cse0 (select |v_#valid_BEFORE_CALL_11| .cse0)))) (= (select |v_#valid_BEFORE_CALL_11| .cse1) 1) (= 0 (select |v_#valid_BEFORE_CALL_10| .cse1))))) (exists ((|v_node_create_~temp~0#1.base_51| Int)) (and (= |c_#memory_$Pointer$#1.base| (store |c_old(#memory_$Pointer$#1.base)| |v_node_create_~temp~0#1.base_51| (select |c_#memory_$Pointer$#1.base| |v_node_create_~temp~0#1.base_51|))) (= (select |c_old(#valid)| |v_node_create_~temp~0#1.base_51|) 0) (= |c_#memory_int#1| (store |c_old(#memory_int#1)| |v_node_create_~temp~0#1.base_51| (select |c_#memory_int#1| |v_node_create_~temp~0#1.base_51|))) (= |c_#memory_$Pointer$#1.offset| (store |c_old(#memory_$Pointer$#1.offset)| |v_node_create_~temp~0#1.base_51| (select |c_#memory_$Pointer$#1.offset| |v_node_create_~temp~0#1.base_51|)))))) is different from false [2025-03-16 17:44:17,485 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_10| (Array Int Int)) (|v_#valid_BEFORE_CALL_11| (Array Int Int)) (v_arrayElimCell_34 Int)) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (= (select |v_#valid_BEFORE_CALL_10| v_arrayElimCell_34) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6|) 0) 0) (= |v_#valid_BEFORE_CALL_11| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_10| |v_#valid_BEFORE_CALL_11|))) (store |v_#valid_BEFORE_CALL_10| .cse0 (select |v_#valid_BEFORE_CALL_11| .cse0)))) (= (select |v_#valid_BEFORE_CALL_11| .cse1) 1) (= 0 (select |v_#valid_BEFORE_CALL_10| .cse1))))) (exists ((|v_node_create_~temp~0#1.base_51| Int)) (and (= |c_#memory_$Pointer$#1.base| (store |c_old(#memory_$Pointer$#1.base)| |v_node_create_~temp~0#1.base_51| (select |c_#memory_$Pointer$#1.base| |v_node_create_~temp~0#1.base_51|))) (= (select |c_old(#valid)| |v_node_create_~temp~0#1.base_51|) 0) (= |c_#memory_int#1| (store |c_old(#memory_int#1)| |v_node_create_~temp~0#1.base_51| (select |c_#memory_int#1| |v_node_create_~temp~0#1.base_51|))) (= |c_#memory_$Pointer$#1.offset| (store |c_old(#memory_$Pointer$#1.offset)| |v_node_create_~temp~0#1.base_51| (select |c_#memory_$Pointer$#1.offset| |v_node_create_~temp~0#1.base_51|)))))) is different from true [2025-03-16 17:44:17,521 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-16 17:44:17,522 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 53 treesize of output 36 [2025-03-16 17:44:17,526 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-16 17:44:17,527 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 35 [2025-03-16 17:44:17,535 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-16 17:44:17,535 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-03-16 17:44:17,572 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| .cse1) 4))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (or (= (select (select |c_#memory_int#1| .cse0) 0) 1) (= .cse0 .cse1)) (= |c_ULTIMATE.start_sll_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#1.offset| .cse1) 4) 0) (exists ((|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_11| (Array Int Int)) (|v_#valid_BEFORE_CALL_13| (Array Int Int)) (v_arrayElimCell_34 Int)) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6|) 0) 0) (= (select |v_#valid_BEFORE_CALL_13| v_arrayElimCell_34) 1) (= (select |v_#valid_BEFORE_CALL_13| .cse2) 0) (= (select |v_#valid_BEFORE_CALL_11| .cse2) 1) (= |v_#valid_BEFORE_CALL_11| (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_13| |v_#valid_BEFORE_CALL_11|))) (store |v_#valid_BEFORE_CALL_13| .cse3 (select |v_#valid_BEFORE_CALL_11| .cse3))))))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_sll_append_~head#1.offset| 0) (exists ((|v_node_create_~temp~0#1.base_51| Int) (|v_#valid_BEFORE_CALL_10| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_17| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_17| |v_node_create_~temp~0#1.base_51|) 0) (= (select |v_old(#valid)_AFTER_CALL_17| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_10| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_10| .cse1) 0) (= (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_10| |v_old(#valid)_AFTER_CALL_17|))) (store |v_#valid_BEFORE_CALL_10| .cse4 (select |v_old(#valid)_AFTER_CALL_17| .cse4))) |v_old(#valid)_AFTER_CALL_17|)))))) is different from false [2025-03-16 17:44:17,574 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| .cse1) 4))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (or (= (select (select |c_#memory_int#1| .cse0) 0) 1) (= .cse0 .cse1)) (= |c_ULTIMATE.start_sll_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#1.offset| .cse1) 4) 0) (exists ((|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_11| (Array Int Int)) (|v_#valid_BEFORE_CALL_13| (Array Int Int)) (v_arrayElimCell_34 Int)) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6|) 0) 0) (= (select |v_#valid_BEFORE_CALL_13| v_arrayElimCell_34) 1) (= (select |v_#valid_BEFORE_CALL_13| .cse2) 0) (= (select |v_#valid_BEFORE_CALL_11| .cse2) 1) (= |v_#valid_BEFORE_CALL_11| (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_13| |v_#valid_BEFORE_CALL_11|))) (store |v_#valid_BEFORE_CALL_13| .cse3 (select |v_#valid_BEFORE_CALL_11| .cse3))))))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_sll_append_~head#1.offset| 0) (exists ((|v_node_create_~temp~0#1.base_51| Int) (|v_#valid_BEFORE_CALL_10| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_17| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_17| |v_node_create_~temp~0#1.base_51|) 0) (= (select |v_old(#valid)_AFTER_CALL_17| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_10| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_10| .cse1) 0) (= (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_10| |v_old(#valid)_AFTER_CALL_17|))) (store |v_#valid_BEFORE_CALL_10| .cse4 (select |v_old(#valid)_AFTER_CALL_17| .cse4))) |v_old(#valid)_AFTER_CALL_17|)))))) is different from true [2025-03-16 17:44:17,670 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| .cse1) 4))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (or (= (select (select |c_#memory_int#1| .cse0) 0) 1) (= .cse0 .cse1)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#1.offset| .cse1) 4) 0) (exists ((|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_11| (Array Int Int)) (|v_#valid_BEFORE_CALL_13| (Array Int Int)) (v_arrayElimCell_34 Int)) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6|) 0) 0) (= (select |v_#valid_BEFORE_CALL_13| v_arrayElimCell_34) 1) (= (select |v_#valid_BEFORE_CALL_13| .cse2) 0) (= (select |v_#valid_BEFORE_CALL_11| .cse2) 1) (= |v_#valid_BEFORE_CALL_11| (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_13| |v_#valid_BEFORE_CALL_11|))) (store |v_#valid_BEFORE_CALL_13| .cse3 (select |v_#valid_BEFORE_CALL_11| .cse3))))))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_node_create_~temp~0#1.base_51| Int) (|v_#valid_BEFORE_CALL_10| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_17| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_17| |v_node_create_~temp~0#1.base_51|) 0) (= (select |v_old(#valid)_AFTER_CALL_17| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_10| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_10| .cse1) 0) (= (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_10| |v_old(#valid)_AFTER_CALL_17|))) (store |v_#valid_BEFORE_CALL_10| .cse4 (select |v_old(#valid)_AFTER_CALL_17| .cse4))) |v_old(#valid)_AFTER_CALL_17|))) (= .cse1 |c_ULTIMATE.start_sll_append_~last~0#1.base|) (= |c_ULTIMATE.start_sll_append_~last~0#1.offset| 0)))) is different from false [2025-03-16 17:44:17,673 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| .cse1) 4))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (or (= (select (select |c_#memory_int#1| .cse0) 0) 1) (= .cse0 .cse1)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#1.offset| .cse1) 4) 0) (exists ((|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_11| (Array Int Int)) (|v_#valid_BEFORE_CALL_13| (Array Int Int)) (v_arrayElimCell_34 Int)) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6|) 0) 0) (= (select |v_#valid_BEFORE_CALL_13| v_arrayElimCell_34) 1) (= (select |v_#valid_BEFORE_CALL_13| .cse2) 0) (= (select |v_#valid_BEFORE_CALL_11| .cse2) 1) (= |v_#valid_BEFORE_CALL_11| (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_13| |v_#valid_BEFORE_CALL_11|))) (store |v_#valid_BEFORE_CALL_13| .cse3 (select |v_#valid_BEFORE_CALL_11| .cse3))))))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_node_create_~temp~0#1.base_51| Int) (|v_#valid_BEFORE_CALL_10| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_17| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_17| |v_node_create_~temp~0#1.base_51|) 0) (= (select |v_old(#valid)_AFTER_CALL_17| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_10| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_10| .cse1) 0) (= (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_10| |v_old(#valid)_AFTER_CALL_17|))) (store |v_#valid_BEFORE_CALL_10| .cse4 (select |v_old(#valid)_AFTER_CALL_17| .cse4))) |v_old(#valid)_AFTER_CALL_17|))) (= .cse1 |c_ULTIMATE.start_sll_append_~last~0#1.base|) (= |c_ULTIMATE.start_sll_append_~last~0#1.offset| 0)))) is different from true [2025-03-16 17:44:17,757 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| .cse1) 4))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (<= 0 |c_ULTIMATE.start_sll_append_~last~0#1.offset|) (or (= (select (select |c_#memory_int#1| .cse0) 0) 1) (= .cse0 .cse1)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#1.offset| .cse1) 4) 0) (exists ((|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_11| (Array Int Int)) (|v_#valid_BEFORE_CALL_13| (Array Int Int)) (v_arrayElimCell_34 Int)) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6|) 0) 0) (= (select |v_#valid_BEFORE_CALL_13| v_arrayElimCell_34) 1) (= (select |v_#valid_BEFORE_CALL_13| .cse2) 0) (= (select |v_#valid_BEFORE_CALL_11| .cse2) 1) (= |v_#valid_BEFORE_CALL_11| (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_13| |v_#valid_BEFORE_CALL_11|))) (store |v_#valid_BEFORE_CALL_13| .cse3 (select |v_#valid_BEFORE_CALL_11| .cse3))))))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_node_create_~temp~0#1.base_51| Int) (|v_#valid_BEFORE_CALL_10| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_17| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_17| |v_node_create_~temp~0#1.base_51|) 0) (= (select |v_old(#valid)_AFTER_CALL_17| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_10| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_10| .cse1) 0) (= (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_10| |v_old(#valid)_AFTER_CALL_17|))) (store |v_#valid_BEFORE_CALL_10| .cse4 (select |v_old(#valid)_AFTER_CALL_17| .cse4))) |v_old(#valid)_AFTER_CALL_17|))) (= .cse0 |c_ULTIMATE.start_sll_append_~last~0#1.base|)))) is different from false [2025-03-16 17:44:17,759 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| .cse1) 4))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (<= 0 |c_ULTIMATE.start_sll_append_~last~0#1.offset|) (or (= (select (select |c_#memory_int#1| .cse0) 0) 1) (= .cse0 .cse1)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#1.offset| .cse1) 4) 0) (exists ((|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_11| (Array Int Int)) (|v_#valid_BEFORE_CALL_13| (Array Int Int)) (v_arrayElimCell_34 Int)) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6|) 0) 0) (= (select |v_#valid_BEFORE_CALL_13| v_arrayElimCell_34) 1) (= (select |v_#valid_BEFORE_CALL_13| .cse2) 0) (= (select |v_#valid_BEFORE_CALL_11| .cse2) 1) (= |v_#valid_BEFORE_CALL_11| (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_13| |v_#valid_BEFORE_CALL_11|))) (store |v_#valid_BEFORE_CALL_13| .cse3 (select |v_#valid_BEFORE_CALL_11| .cse3))))))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_node_create_~temp~0#1.base_51| Int) (|v_#valid_BEFORE_CALL_10| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_17| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_17| |v_node_create_~temp~0#1.base_51|) 0) (= (select |v_old(#valid)_AFTER_CALL_17| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_10| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_10| .cse1) 0) (= (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_10| |v_old(#valid)_AFTER_CALL_17|))) (store |v_#valid_BEFORE_CALL_10| .cse4 (select |v_old(#valid)_AFTER_CALL_17| .cse4))) |v_old(#valid)_AFTER_CALL_17|))) (= .cse0 |c_ULTIMATE.start_sll_append_~last~0#1.base|)))) is different from true [2025-03-16 17:44:17,850 INFO L349 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2025-03-16 17:44:17,850 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 136 treesize of output 87 [2025-03-16 17:44:17,858 INFO L349 Elim1Store]: treesize reduction 37, result has 40.3 percent of original size [2025-03-16 17:44:17,859 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 36 treesize of output 31 [2025-03-16 17:44:17,887 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-16 17:44:17,887 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 75 treesize of output 35 [2025-03-16 17:44:17,916 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| .cse4) 4))) (let ((.cse1 (= .cse0 .cse4))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (or (= (select (select |c_#memory_int#1| .cse0) 0) 1) .cse1) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_11| (Array Int Int)) (|v_#valid_BEFORE_CALL_13| (Array Int Int)) (v_arrayElimCell_34 Int)) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6|) 0) 0) (= (select |v_#valid_BEFORE_CALL_13| v_arrayElimCell_34) 1) (= (select |v_#valid_BEFORE_CALL_13| .cse2) 0) (= (select |v_#valid_BEFORE_CALL_11| .cse2) 1) (= |v_#valid_BEFORE_CALL_11| (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_13| |v_#valid_BEFORE_CALL_11|))) (store |v_#valid_BEFORE_CALL_13| .cse3 (select |v_#valid_BEFORE_CALL_11| .cse3))))))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_node_create_~temp~0#1.base_51| Int) (|v_#valid_BEFORE_CALL_10| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_17| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_17| |v_node_create_~temp~0#1.base_51|) 0) (= (select |v_old(#valid)_AFTER_CALL_17| .cse4) 1) (= (select |v_#valid_BEFORE_CALL_10| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_10| .cse4) 0) (= (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_10| |v_old(#valid)_AFTER_CALL_17|))) (store |v_#valid_BEFORE_CALL_10| .cse5 (select |v_old(#valid)_AFTER_CALL_17| .cse5))) |v_old(#valid)_AFTER_CALL_17|))) (or (= (select (select |c_#memory_$Pointer$#1.offset| .cse4) 4) 0) .cse1))))) is different from false [2025-03-16 17:44:17,918 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse4 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| .cse4) 4))) (let ((.cse1 (= .cse0 .cse4))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (or (= (select (select |c_#memory_int#1| .cse0) 0) 1) .cse1) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_11| (Array Int Int)) (|v_#valid_BEFORE_CALL_13| (Array Int Int)) (v_arrayElimCell_34 Int)) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6|) 0) 0) (= (select |v_#valid_BEFORE_CALL_13| v_arrayElimCell_34) 1) (= (select |v_#valid_BEFORE_CALL_13| .cse2) 0) (= (select |v_#valid_BEFORE_CALL_11| .cse2) 1) (= |v_#valid_BEFORE_CALL_11| (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_13| |v_#valid_BEFORE_CALL_11|))) (store |v_#valid_BEFORE_CALL_13| .cse3 (select |v_#valid_BEFORE_CALL_11| .cse3))))))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_node_create_~temp~0#1.base_51| Int) (|v_#valid_BEFORE_CALL_10| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_17| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_17| |v_node_create_~temp~0#1.base_51|) 0) (= (select |v_old(#valid)_AFTER_CALL_17| .cse4) 1) (= (select |v_#valid_BEFORE_CALL_10| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_10| .cse4) 0) (= (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_10| |v_old(#valid)_AFTER_CALL_17|))) (store |v_#valid_BEFORE_CALL_10| .cse5 (select |v_old(#valid)_AFTER_CALL_17| .cse5))) |v_old(#valid)_AFTER_CALL_17|))) (or (= (select (select |c_#memory_$Pointer$#1.offset| .cse4) 4) 0) .cse1))))) is different from true [2025-03-16 17:44:17,936 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-16 17:44:17,936 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 115 treesize of output 75 [2025-03-16 17:44:17,942 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-03-16 17:44:17,943 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 7 [2025-03-16 17:44:17,966 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~ptr~0#1.base|) 4))) (let ((.cse0 (= .cse1 |c_ULTIMATE.start_main_~ptr~0#1.base|))) (and (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (or .cse0 (= (select (select |c_#memory_int#1| .cse1) 0) 1)) (exists ((|v_node_create_~temp~0#1.base_51| Int) (|v_#valid_BEFORE_CALL_10| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_17| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_17| |v_node_create_~temp~0#1.base_51|) 0) (= (select |v_old(#valid)_AFTER_CALL_17| |c_ULTIMATE.start_main_~ptr~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_10| .cse1) 1) (= (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_10| |v_old(#valid)_AFTER_CALL_17|))) (store |v_#valid_BEFORE_CALL_10| .cse2 (select |v_old(#valid)_AFTER_CALL_17| .cse2))) |v_old(#valid)_AFTER_CALL_17|) (= (select |v_#valid_BEFORE_CALL_10| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0))) (or (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~ptr~0#1.base|) 4) 0) .cse0) (= |c_ULTIMATE.start_main_~data~0#1| 1)))) is different from false [2025-03-16 17:44:17,968 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~ptr~0#1.base|) 4))) (let ((.cse0 (= .cse1 |c_ULTIMATE.start_main_~ptr~0#1.base|))) (and (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (or .cse0 (= (select (select |c_#memory_int#1| .cse1) 0) 1)) (exists ((|v_node_create_~temp~0#1.base_51| Int) (|v_#valid_BEFORE_CALL_10| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_17| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_17| |v_node_create_~temp~0#1.base_51|) 0) (= (select |v_old(#valid)_AFTER_CALL_17| |c_ULTIMATE.start_main_~ptr~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_10| .cse1) 1) (= (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_10| |v_old(#valid)_AFTER_CALL_17|))) (store |v_#valid_BEFORE_CALL_10| .cse2 (select |v_old(#valid)_AFTER_CALL_17| .cse2))) |v_old(#valid)_AFTER_CALL_17|) (= (select |v_#valid_BEFORE_CALL_10| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0))) (or (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~ptr~0#1.base|) 4) 0) .cse0) (= |c_ULTIMATE.start_main_~data~0#1| 1)))) is different from true [2025-03-16 17:44:17,977 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 51 treesize of output 31 [2025-03-16 17:44:17,981 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-03-16 17:44:18,002 WARN L851 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int#1| |c_ULTIMATE.start_main_~temp~2#1.base|) 0) 1) (exists ((|v_node_create_~temp~0#1.base_51| Int) (|v_ULTIMATE.start_main_~ptr~0#1.base_15| Int) (|v_#valid_BEFORE_CALL_10| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_17| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_10| |v_ULTIMATE.start_main_~ptr~0#1.base_15|) 0) (= (select |v_old(#valid)_AFTER_CALL_17| |v_node_create_~temp~0#1.base_51|) 0) (= 1 (select |v_#valid_BEFORE_CALL_10| |c_ULTIMATE.start_main_~temp~2#1.base|)) (= (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_10| |v_old(#valid)_AFTER_CALL_17|))) (store |v_#valid_BEFORE_CALL_10| .cse0 (select |v_old(#valid)_AFTER_CALL_17| .cse0))) |v_old(#valid)_AFTER_CALL_17|) (= (select |v_old(#valid)_AFTER_CALL_17| |v_ULTIMATE.start_main_~ptr~0#1.base_15|) 1))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_main_~temp~2#1.offset| 0)) is different from false [2025-03-16 17:44:18,003 WARN L873 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int#1| |c_ULTIMATE.start_main_~temp~2#1.base|) 0) 1) (exists ((|v_node_create_~temp~0#1.base_51| Int) (|v_ULTIMATE.start_main_~ptr~0#1.base_15| Int) (|v_#valid_BEFORE_CALL_10| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_17| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_10| |v_ULTIMATE.start_main_~ptr~0#1.base_15|) 0) (= (select |v_old(#valid)_AFTER_CALL_17| |v_node_create_~temp~0#1.base_51|) 0) (= 1 (select |v_#valid_BEFORE_CALL_10| |c_ULTIMATE.start_main_~temp~2#1.base|)) (= (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_10| |v_old(#valid)_AFTER_CALL_17|))) (store |v_#valid_BEFORE_CALL_10| .cse0 (select |v_old(#valid)_AFTER_CALL_17| .cse0))) |v_old(#valid)_AFTER_CALL_17|) (= (select |v_old(#valid)_AFTER_CALL_17| |v_ULTIMATE.start_main_~ptr~0#1.base_15|) 1))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_main_~temp~2#1.offset| 0)) is different from true [2025-03-16 17:44:18,024 WARN L851 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (exists ((|v_node_create_~temp~0#1.base_51| Int) (|v_ULTIMATE.start_main_~ptr~0#1.base_15| Int) (|v_#valid_BEFORE_CALL_10| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_17| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_10| |v_ULTIMATE.start_main_~ptr~0#1.base_15|) 0) (= (select |v_old(#valid)_AFTER_CALL_17| |v_node_create_~temp~0#1.base_51|) 0) (= (select |v_#valid_BEFORE_CALL_10| |c_ULTIMATE.start_main_~ptr~0#1.base|) 1) (= (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_10| |v_old(#valid)_AFTER_CALL_17|))) (store |v_#valid_BEFORE_CALL_10| .cse0 (select |v_old(#valid)_AFTER_CALL_17| .cse0))) |v_old(#valid)_AFTER_CALL_17|) (= (select |v_old(#valid)_AFTER_CALL_17| |v_ULTIMATE.start_main_~ptr~0#1.base_15|) 1))) (= (select (select |c_#memory_int#1| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) 1) (= |c_ULTIMATE.start_main_~data~0#1| 1)) is different from false [2025-03-16 17:44:18,025 WARN L873 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (exists ((|v_node_create_~temp~0#1.base_51| Int) (|v_ULTIMATE.start_main_~ptr~0#1.base_15| Int) (|v_#valid_BEFORE_CALL_10| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_17| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_10| |v_ULTIMATE.start_main_~ptr~0#1.base_15|) 0) (= (select |v_old(#valid)_AFTER_CALL_17| |v_node_create_~temp~0#1.base_51|) 0) (= (select |v_#valid_BEFORE_CALL_10| |c_ULTIMATE.start_main_~ptr~0#1.base|) 1) (= (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_10| |v_old(#valid)_AFTER_CALL_17|))) (store |v_#valid_BEFORE_CALL_10| .cse0 (select |v_old(#valid)_AFTER_CALL_17| .cse0))) |v_old(#valid)_AFTER_CALL_17|) (= (select |v_old(#valid)_AFTER_CALL_17| |v_ULTIMATE.start_main_~ptr~0#1.base_15|) 1))) (= (select (select |c_#memory_int#1| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) 1) (= |c_ULTIMATE.start_main_~data~0#1| 1)) is different from true [2025-03-16 17:44:18,058 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 16 not checked. [2025-03-16 17:44:18,058 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 17:44:18,120 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_768 (Array Int Int)) (v_ArrVal_769 (Array Int Int)) (v_ArrVal_770 (Array Int Int))) (or (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse1 (+ (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_sll_append_~last~0#1.base| v_ArrVal_768) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_append_~last~0#1.base| v_ArrVal_769) .cse0) .cse1)) (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_append_~last~0#1.base| v_ArrVal_770) .cse0) .cse1)))) (not (= (let ((.cse2 (+ |c_ULTIMATE.start_sll_append_~last~0#1.offset| 4))) (store (select |c_#memory_int#1| |c_ULTIMATE.start_sll_append_~last~0#1.base|) .cse2 (select v_ArrVal_768 .cse2))) v_ArrVal_768)))) is different from false [2025-03-16 17:44:18,158 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_768 (Array Int Int)) (v_ArrVal_769 (Array Int Int)) (|v_ULTIMATE.start_sll_append_~last~0#1.offset_24| Int) (v_ArrVal_770 (Array Int Int))) (let ((.cse4 (+ |c_ULTIMATE.start_sll_append_~last~0#1.offset| 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_append_~last~0#1.base|) .cse4))) (or (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2 (+ (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (select (select (store |c_#memory_int#1| .cse0 v_ArrVal_768) (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_769) .cse1) .cse2)) (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_770) .cse1) .cse2)))) (not (= v_ArrVal_768 (let ((.cse3 (+ |v_ULTIMATE.start_sll_append_~last~0#1.offset_24| 4))) (store (select |c_#memory_int#1| .cse0) .cse3 (select v_ArrVal_768 .cse3))))) (< |v_ULTIMATE.start_sll_append_~last~0#1.offset_24| (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_append_~last~0#1.base|) .cse4)))))) is different from false [2025-03-16 17:44:18,178 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_768 (Array Int Int)) (v_ArrVal_769 (Array Int Int)) (|v_ULTIMATE.start_sll_append_~last~0#1.offset_24| Int) (v_ArrVal_770 (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|)) (.cse1 (+ (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 4))) (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| .cse0) .cse1))) (or (< |v_ULTIMATE.start_sll_append_~last~0#1.offset_24| (select (select |c_#memory_$Pointer$#1.offset| .cse0) .cse1)) (not (= v_ArrVal_768 (let ((.cse3 (+ |v_ULTIMATE.start_sll_append_~last~0#1.offset_24| 4))) (store (select |c_#memory_int#1| .cse2) .cse3 (select v_ArrVal_768 .cse3))))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse4 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse5 (+ (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (select (select (store |c_#memory_int#1| .cse2 v_ArrVal_768) (select (select (store |c_#memory_$Pointer$#1.base| .cse2 v_ArrVal_769) .cse4) .cse5)) (select (select (store |c_#memory_$Pointer$#1.offset| .cse2 v_ArrVal_770) .cse4) .cse5)))))))) is different from false [2025-03-16 17:44:18,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [566336047] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 17:44:18,322 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-16 17:44:18,322 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 24] total 45 [2025-03-16 17:44:18,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [619305291] [2025-03-16 17:44:18,322 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-16 17:44:18,322 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2025-03-16 17:44:18,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 17:44:18,323 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2025-03-16 17:44:18,323 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=1097, Unknown=29, NotChecked=1296, Total=2550 [2025-03-16 17:44:18,323 INFO L87 Difference]: Start difference. First operand 39 states and 44 transitions. Second operand has 45 states, 43 states have (on average 1.2325581395348837) internal successors, (53), 36 states have internal predecessors, (53), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-16 17:44:18,579 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_int#1| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 0))) (let ((.cse0 (= .cse2 1))) (and (= (select (select |c_#memory_int#1| |c_ULTIMATE.start_sll_create_#t~ret4#1.base|) 0) 1) (not (= |c_ULTIMATE.start_sll_create_#t~ret4#1.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|)) .cse0 (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 1) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_#valid_BEFORE_CALL_10| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_10| |c_ULTIMATE.start_sll_create_#t~ret4#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_10| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 1) (= |c_#valid| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_10| |c_#valid|))) (store |v_#valid_BEFORE_CALL_10| .cse1 (select |c_#valid| .cse1)))))) (= |c_ULTIMATE.start_main_~data~0#1| .cse2) (or .cse0 (exists ((|v_#memory_int#1_BEFORE_CALL_6| (Array Int (Array Int Int)))) (let ((.cse3 (@diff |v_#memory_int#1_BEFORE_CALL_6| |c_#memory_int#1|))) (and (= |c_ULTIMATE.start_sll_create_#t~ret4#1.base| .cse3) (= |c_#memory_int#1| (store |v_#memory_int#1_BEFORE_CALL_6| .cse3 (select |c_#memory_int#1| .cse3))) (= (select (select |v_#memory_int#1_BEFORE_CALL_6| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 0) 1))))) (= |c_ULTIMATE.start_sll_create_#t~ret4#1.offset| 0) (= |c_ULTIMATE.start_sll_create_~data#1| 1) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_#t~ret4#1.base|) 1)))) is different from false [2025-03-16 17:44:18,582 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_int#1| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 0))) (let ((.cse0 (= .cse2 1))) (and (= (select (select |c_#memory_int#1| |c_ULTIMATE.start_sll_create_#t~ret4#1.base|) 0) 1) (not (= |c_ULTIMATE.start_sll_create_#t~ret4#1.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|)) .cse0 (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 1) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_#valid_BEFORE_CALL_10| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_10| |c_ULTIMATE.start_sll_create_#t~ret4#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_10| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 1) (= |c_#valid| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_10| |c_#valid|))) (store |v_#valid_BEFORE_CALL_10| .cse1 (select |c_#valid| .cse1)))))) (= |c_ULTIMATE.start_main_~data~0#1| .cse2) (or .cse0 (exists ((|v_#memory_int#1_BEFORE_CALL_6| (Array Int (Array Int Int)))) (let ((.cse3 (@diff |v_#memory_int#1_BEFORE_CALL_6| |c_#memory_int#1|))) (and (= |c_ULTIMATE.start_sll_create_#t~ret4#1.base| .cse3) (= |c_#memory_int#1| (store |v_#memory_int#1_BEFORE_CALL_6| .cse3 (select |c_#memory_int#1| .cse3))) (= (select (select |v_#memory_int#1_BEFORE_CALL_6| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 0) 1))))) (= |c_ULTIMATE.start_sll_create_#t~ret4#1.offset| 0) (= |c_ULTIMATE.start_sll_create_~data#1| 1) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_#t~ret4#1.base|) 1)))) is different from true [2025-03-16 17:44:18,585 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4))) (let ((.cse0 (select |c_#memory_int#1| |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (.cse5 (= .cse1 |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (.cse4 (select (select |c_#memory_int#1| .cse1) 0))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4) 0) (= (select .cse0 0) 1) (= (select |c_#valid| .cse1) 1) (exists ((|v_#valid_BEFORE_CALL_10| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_10| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_10| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 0) (= |c_#valid| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_10| |c_#valid|))) (store |v_#valid_BEFORE_CALL_10| .cse2 (select |c_#valid| .cse2)))))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 1) (= |c_ULTIMATE.start_main_~data~0#1| 1) (or (exists ((|v_#memory_int#1_111| (Array Int (Array Int Int)))) (and (exists ((|v_#memory_int#1_BEFORE_CALL_6| (Array Int (Array Int Int)))) (let ((.cse3 (@diff |v_#memory_int#1_BEFORE_CALL_6| |v_#memory_int#1_111|))) (and (= (store |v_#memory_int#1_BEFORE_CALL_6| .cse3 (select |v_#memory_int#1_111| .cse3)) |v_#memory_int#1_111|) (= .cse3 |c_ULTIMATE.start_sll_create_~head~0#1.base|) (= (select (select |v_#memory_int#1_BEFORE_CALL_6| .cse1) 0) 1)))) (= |c_#memory_int#1| (store |v_#memory_int#1_111| |c_ULTIMATE.start_sll_create_~head~0#1.base| .cse0)))) (= .cse4 1) .cse5) (not .cse5) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| .cse4)))) is different from false [2025-03-16 17:44:18,587 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4))) (let ((.cse0 (select |c_#memory_int#1| |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (.cse5 (= .cse1 |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (.cse4 (select (select |c_#memory_int#1| .cse1) 0))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4) 0) (= (select .cse0 0) 1) (= (select |c_#valid| .cse1) 1) (exists ((|v_#valid_BEFORE_CALL_10| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_10| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_10| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 0) (= |c_#valid| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_10| |c_#valid|))) (store |v_#valid_BEFORE_CALL_10| .cse2 (select |c_#valid| .cse2)))))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 1) (= |c_ULTIMATE.start_main_~data~0#1| 1) (or (exists ((|v_#memory_int#1_111| (Array Int (Array Int Int)))) (and (exists ((|v_#memory_int#1_BEFORE_CALL_6| (Array Int (Array Int Int)))) (let ((.cse3 (@diff |v_#memory_int#1_BEFORE_CALL_6| |v_#memory_int#1_111|))) (and (= (store |v_#memory_int#1_BEFORE_CALL_6| .cse3 (select |v_#memory_int#1_111| .cse3)) |v_#memory_int#1_111|) (= .cse3 |c_ULTIMATE.start_sll_create_~head~0#1.base|) (= (select (select |v_#memory_int#1_BEFORE_CALL_6| .cse1) 0) 1)))) (= |c_#memory_int#1| (store |v_#memory_int#1_111| |c_ULTIMATE.start_sll_create_~head~0#1.base| .cse0)))) (= .cse4 1) .cse5) (not .cse5) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| .cse4)))) is different from true [2025-03-16 17:44:18,591 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse6 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|)) (.cse2 (select .cse4 0))) (let ((.cse0 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse1 (select (select |c_#memory_$Pointer$#1.base| .cse2) 4)) (.cse3 (select (select |c_#memory_$Pointer$#1.base| .cse6) 4))) (and (= (select .cse0 0) 0) (= (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (or (= (select (select |c_#memory_int#1| .cse1) 0) 1) (= .cse1 .cse2)) (= (select |c_#valid| .cse2) 1) (= |c_ULTIMATE.start_sll_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#1.offset| .cse2) 4) 0) (= 1 (select |c_#valid| .cse3)) (not (= .cse3 (select .cse4 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_sll_append_~head#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_10| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_10| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_10| .cse2) 0) (= |c_#valid| (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_10| |c_#valid|))) (store |v_#valid_BEFORE_CALL_10| .cse5 (select |c_#valid| .cse5)))))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int#1| .cse3) 0)) (= (select |c_#valid| .cse6) 1) (= |c_ULTIMATE.start_sll_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= (select (select |c_#memory_$Pointer$#1.offset| .cse6) 4) 0))))) is different from false [2025-03-16 17:44:18,593 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse6 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|)) (.cse2 (select .cse4 0))) (let ((.cse0 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse1 (select (select |c_#memory_$Pointer$#1.base| .cse2) 4)) (.cse3 (select (select |c_#memory_$Pointer$#1.base| .cse6) 4))) (and (= (select .cse0 0) 0) (= (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (or (= (select (select |c_#memory_int#1| .cse1) 0) 1) (= .cse1 .cse2)) (= (select |c_#valid| .cse2) 1) (= |c_ULTIMATE.start_sll_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#1.offset| .cse2) 4) 0) (= 1 (select |c_#valid| .cse3)) (not (= .cse3 (select .cse4 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_sll_append_~head#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_10| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_10| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_10| .cse2) 0) (= |c_#valid| (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_10| |c_#valid|))) (store |v_#valid_BEFORE_CALL_10| .cse5 (select |c_#valid| .cse5)))))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int#1| .cse3) 0)) (= (select |c_#valid| .cse6) 1) (= |c_ULTIMATE.start_sll_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= (select (select |c_#memory_$Pointer$#1.offset| .cse6) 4) 0))))) is different from true [2025-03-16 17:44:18,602 WARN L851 $PredicateComparison]: unable to prove that (and (= |c_#memory_int#1| |c_old(#memory_int#1)|) (exists ((|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_10| (Array Int Int)) (|v_#valid_BEFORE_CALL_11| (Array Int Int)) (v_arrayElimCell_34 Int)) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (= (select |v_#valid_BEFORE_CALL_10| v_arrayElimCell_34) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6|) 0) 0) (= |v_#valid_BEFORE_CALL_11| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_10| |v_#valid_BEFORE_CALL_11|))) (store |v_#valid_BEFORE_CALL_10| .cse0 (select |v_#valid_BEFORE_CALL_11| .cse0)))) (= (select |v_#valid_BEFORE_CALL_11| .cse1) 1) (= 0 (select |v_#valid_BEFORE_CALL_10| .cse1))))) (= |c_#memory_$Pointer$#1.offset| |c_old(#memory_$Pointer$#1.offset)|) (= |c_node_create_#in~data#1| |c_node_create_~data#1|) (= |c_node_create_~temp~0#1.offset| 0) (= (select |c_#valid| |c_node_create_~temp~0#1.base|) 1) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (= |c_#memory_$Pointer$#1.base| |c_old(#memory_$Pointer$#1.base)|)) is different from false [2025-03-16 17:44:18,603 WARN L873 $PredicateComparison]: unable to prove that (and (= |c_#memory_int#1| |c_old(#memory_int#1)|) (exists ((|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_10| (Array Int Int)) (|v_#valid_BEFORE_CALL_11| (Array Int Int)) (v_arrayElimCell_34 Int)) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (= (select |v_#valid_BEFORE_CALL_10| v_arrayElimCell_34) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6|) 0) 0) (= |v_#valid_BEFORE_CALL_11| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_10| |v_#valid_BEFORE_CALL_11|))) (store |v_#valid_BEFORE_CALL_10| .cse0 (select |v_#valid_BEFORE_CALL_11| .cse0)))) (= (select |v_#valid_BEFORE_CALL_11| .cse1) 1) (= 0 (select |v_#valid_BEFORE_CALL_10| .cse1))))) (= |c_#memory_$Pointer$#1.offset| |c_old(#memory_$Pointer$#1.offset)|) (= |c_node_create_#in~data#1| |c_node_create_~data#1|) (= |c_node_create_~temp~0#1.offset| 0) (= (select |c_#valid| |c_node_create_~temp~0#1.base|) 1) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (= |c_#memory_$Pointer$#1.base| |c_old(#memory_$Pointer$#1.base)|)) is different from true [2025-03-16 17:44:18,611 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (@diff |c_old(#memory_int#1)| |c_#memory_int#1|))) (let ((.cse2 (store |c_old(#memory_int#1)| .cse1 (select |c_#memory_int#1| .cse1)))) (let ((.cse3 (@diff .cse2 |c_#memory_int#1|)) (.cse6 (@diff |c_old(#memory_$Pointer$#1.offset)| |c_#memory_$Pointer$#1.offset|)) (.cse0 (@diff |c_old(#memory_$Pointer$#1.base)| |c_#memory_$Pointer$#1.base|))) (and (= |c_node_create_#res#1.offset| 0) (= (select |c_#valid| |c_node_create_#res#1.base|) 1) (= |c_#memory_$Pointer$#1.base| (store |c_old(#memory_$Pointer$#1.base)| .cse0 (select |c_#memory_$Pointer$#1.base| .cse0))) (or (= |c_#memory_int#1| |c_old(#memory_int#1)|) (= (select |c_old(#valid)| .cse1) 0)) (= |c_#memory_int#1| (store .cse2 .cse3 (select |c_#memory_int#1| .cse3))) (exists ((|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_10| (Array Int Int)) (|v_#valid_BEFORE_CALL_11| (Array Int Int)) (v_arrayElimCell_34 Int)) (let ((.cse5 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (= (select |v_#valid_BEFORE_CALL_10| v_arrayElimCell_34) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6|) 0) 0) (= |v_#valid_BEFORE_CALL_11| (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_10| |v_#valid_BEFORE_CALL_11|))) (store |v_#valid_BEFORE_CALL_10| .cse4 (select |v_#valid_BEFORE_CALL_11| .cse4)))) (= (select |v_#valid_BEFORE_CALL_11| .cse5) 1) (= 0 (select |v_#valid_BEFORE_CALL_10| .cse5))))) (or (= |c_#memory_int#1| .cse2) (= (select |c_old(#valid)| .cse3) 0)) (exists ((|v_node_create_~temp~0#1.base_51| Int)) (and (= |c_#memory_$Pointer$#1.base| (store |c_old(#memory_$Pointer$#1.base)| |v_node_create_~temp~0#1.base_51| (select |c_#memory_$Pointer$#1.base| |v_node_create_~temp~0#1.base_51|))) (= (select |c_old(#valid)| |v_node_create_~temp~0#1.base_51|) 0) (= |c_#memory_int#1| (store |c_old(#memory_int#1)| |v_node_create_~temp~0#1.base_51| (select |c_#memory_int#1| |v_node_create_~temp~0#1.base_51|))) (= |c_#memory_$Pointer$#1.offset| (store |c_old(#memory_$Pointer$#1.offset)| |v_node_create_~temp~0#1.base_51| (select |c_#memory_$Pointer$#1.offset| |v_node_create_~temp~0#1.base_51|))))) (or (= |c_#memory_$Pointer$#1.offset| |c_old(#memory_$Pointer$#1.offset)|) (= (select |c_old(#valid)| .cse6) 0)) (= |c_#memory_$Pointer$#1.offset| (store |c_old(#memory_$Pointer$#1.offset)| .cse6 (select |c_#memory_$Pointer$#1.offset| .cse6))) (or (= (select |c_old(#valid)| .cse0) 0) (= |c_#memory_$Pointer$#1.base| |c_old(#memory_$Pointer$#1.base)|)) (= |c_node_create_#in~data#1| (select (select |c_#memory_int#1| |c_node_create_#res#1.base|) 0)))))) is different from false [2025-03-16 17:44:18,615 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 (@diff |c_old(#memory_int#1)| |c_#memory_int#1|))) (let ((.cse2 (store |c_old(#memory_int#1)| .cse1 (select |c_#memory_int#1| .cse1)))) (let ((.cse3 (@diff .cse2 |c_#memory_int#1|)) (.cse6 (@diff |c_old(#memory_$Pointer$#1.offset)| |c_#memory_$Pointer$#1.offset|)) (.cse0 (@diff |c_old(#memory_$Pointer$#1.base)| |c_#memory_$Pointer$#1.base|))) (and (= |c_node_create_#res#1.offset| 0) (= (select |c_#valid| |c_node_create_#res#1.base|) 1) (= |c_#memory_$Pointer$#1.base| (store |c_old(#memory_$Pointer$#1.base)| .cse0 (select |c_#memory_$Pointer$#1.base| .cse0))) (or (= |c_#memory_int#1| |c_old(#memory_int#1)|) (= (select |c_old(#valid)| .cse1) 0)) (= |c_#memory_int#1| (store .cse2 .cse3 (select |c_#memory_int#1| .cse3))) (exists ((|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_10| (Array Int Int)) (|v_#valid_BEFORE_CALL_11| (Array Int Int)) (v_arrayElimCell_34 Int)) (let ((.cse5 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (= (select |v_#valid_BEFORE_CALL_10| v_arrayElimCell_34) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6|) 0) 0) (= |v_#valid_BEFORE_CALL_11| (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_10| |v_#valid_BEFORE_CALL_11|))) (store |v_#valid_BEFORE_CALL_10| .cse4 (select |v_#valid_BEFORE_CALL_11| .cse4)))) (= (select |v_#valid_BEFORE_CALL_11| .cse5) 1) (= 0 (select |v_#valid_BEFORE_CALL_10| .cse5))))) (or (= |c_#memory_int#1| .cse2) (= (select |c_old(#valid)| .cse3) 0)) (exists ((|v_node_create_~temp~0#1.base_51| Int)) (and (= |c_#memory_$Pointer$#1.base| (store |c_old(#memory_$Pointer$#1.base)| |v_node_create_~temp~0#1.base_51| (select |c_#memory_$Pointer$#1.base| |v_node_create_~temp~0#1.base_51|))) (= (select |c_old(#valid)| |v_node_create_~temp~0#1.base_51|) 0) (= |c_#memory_int#1| (store |c_old(#memory_int#1)| |v_node_create_~temp~0#1.base_51| (select |c_#memory_int#1| |v_node_create_~temp~0#1.base_51|))) (= |c_#memory_$Pointer$#1.offset| (store |c_old(#memory_$Pointer$#1.offset)| |v_node_create_~temp~0#1.base_51| (select |c_#memory_$Pointer$#1.offset| |v_node_create_~temp~0#1.base_51|))))) (or (= |c_#memory_$Pointer$#1.offset| |c_old(#memory_$Pointer$#1.offset)|) (= (select |c_old(#valid)| .cse6) 0)) (= |c_#memory_$Pointer$#1.offset| (store |c_old(#memory_$Pointer$#1.offset)| .cse6 (select |c_#memory_$Pointer$#1.offset| .cse6))) (or (= (select |c_old(#valid)| .cse0) 0) (= |c_#memory_$Pointer$#1.base| |c_old(#memory_$Pointer$#1.base)|)) (= |c_node_create_#in~data#1| (select (select |c_#memory_int#1| |c_node_create_#res#1.base|) 0)))))) is different from true [2025-03-16 17:44:18,626 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse8 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|)) (.cse2 (select .cse4 0))) (let ((.cse0 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse1 (select (select |c_#memory_$Pointer$#1.base| .cse2) 4)) (.cse3 (select (select |c_#memory_$Pointer$#1.base| .cse8) 4))) (and (= (select .cse0 0) 0) (= (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (or (= (select (select |c_#memory_int#1| .cse1) 0) 1) (= .cse1 .cse2)) (= |c_ULTIMATE.start_sll_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#1.offset| .cse2) 4) 0) (not (= .cse3 (select .cse4 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (exists ((|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_11| (Array Int Int)) (|v_#valid_BEFORE_CALL_13| (Array Int Int)) (v_arrayElimCell_34 Int)) (let ((.cse5 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6|) 0) 0) (= (select |v_#valid_BEFORE_CALL_13| v_arrayElimCell_34) 1) (= (select |v_#valid_BEFORE_CALL_13| .cse5) 0) (= (select |v_#valid_BEFORE_CALL_11| .cse5) 1) (= |v_#valid_BEFORE_CALL_11| (let ((.cse6 (@diff |v_#valid_BEFORE_CALL_13| |v_#valid_BEFORE_CALL_11|))) (store |v_#valid_BEFORE_CALL_13| .cse6 (select |v_#valid_BEFORE_CALL_11| .cse6))))))) (= |c_ULTIMATE.start_sll_append_#t~ret7#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_sll_append_~head#1.offset| 0) (exists ((|v_node_create_~temp~0#1.base_51| Int) (|v_#valid_BEFORE_CALL_10| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_17| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_17| |v_node_create_~temp~0#1.base_51|) 0) (= (select |v_old(#valid)_AFTER_CALL_17| .cse2) 1) (= (select |v_#valid_BEFORE_CALL_10| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_10| .cse2) 0) (= (let ((.cse7 (@diff |v_#valid_BEFORE_CALL_10| |v_old(#valid)_AFTER_CALL_17|))) (store |v_#valid_BEFORE_CALL_10| .cse7 (select |v_old(#valid)_AFTER_CALL_17| .cse7))) |v_old(#valid)_AFTER_CALL_17|))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int#1| .cse3) 0)) (= |c_ULTIMATE.start_sll_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= (select (select |c_#memory_$Pointer$#1.offset| .cse8) 4) 0))))) is different from false [2025-03-16 17:44:18,629 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse8 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|)) (.cse2 (select .cse4 0))) (let ((.cse0 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse1 (select (select |c_#memory_$Pointer$#1.base| .cse2) 4)) (.cse3 (select (select |c_#memory_$Pointer$#1.base| .cse8) 4))) (and (= (select .cse0 0) 0) (= (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (or (= (select (select |c_#memory_int#1| .cse1) 0) 1) (= .cse1 .cse2)) (= |c_ULTIMATE.start_sll_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#1.offset| .cse2) 4) 0) (not (= .cse3 (select .cse4 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (exists ((|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_11| (Array Int Int)) (|v_#valid_BEFORE_CALL_13| (Array Int Int)) (v_arrayElimCell_34 Int)) (let ((.cse5 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6|) 0) 0) (= (select |v_#valid_BEFORE_CALL_13| v_arrayElimCell_34) 1) (= (select |v_#valid_BEFORE_CALL_13| .cse5) 0) (= (select |v_#valid_BEFORE_CALL_11| .cse5) 1) (= |v_#valid_BEFORE_CALL_11| (let ((.cse6 (@diff |v_#valid_BEFORE_CALL_13| |v_#valid_BEFORE_CALL_11|))) (store |v_#valid_BEFORE_CALL_13| .cse6 (select |v_#valid_BEFORE_CALL_11| .cse6))))))) (= |c_ULTIMATE.start_sll_append_#t~ret7#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_sll_append_~head#1.offset| 0) (exists ((|v_node_create_~temp~0#1.base_51| Int) (|v_#valid_BEFORE_CALL_10| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_17| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_17| |v_node_create_~temp~0#1.base_51|) 0) (= (select |v_old(#valid)_AFTER_CALL_17| .cse2) 1) (= (select |v_#valid_BEFORE_CALL_10| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_10| .cse2) 0) (= (let ((.cse7 (@diff |v_#valid_BEFORE_CALL_10| |v_old(#valid)_AFTER_CALL_17|))) (store |v_#valid_BEFORE_CALL_10| .cse7 (select |v_old(#valid)_AFTER_CALL_17| .cse7))) |v_old(#valid)_AFTER_CALL_17|))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int#1| .cse3) 0)) (= |c_ULTIMATE.start_sll_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= (select (select |c_#memory_$Pointer$#1.offset| .cse8) 4) 0))))) is different from true [2025-03-16 17:44:18,639 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse8 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|)) (.cse2 (select .cse4 0))) (let ((.cse0 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse1 (select (select |c_#memory_$Pointer$#1.base| .cse2) 4)) (.cse3 (select (select |c_#memory_$Pointer$#1.base| .cse8) 4))) (and (= (select .cse0 0) 0) (= (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (or (= (select (select |c_#memory_int#1| .cse1) 0) 1) (= .cse1 .cse2)) (= |c_ULTIMATE.start_sll_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#1.offset| .cse2) 4) 0) (not (= .cse3 (select .cse4 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (exists ((|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_11| (Array Int Int)) (|v_#valid_BEFORE_CALL_13| (Array Int Int)) (v_arrayElimCell_34 Int)) (let ((.cse5 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6|) 0) 0) (= (select |v_#valid_BEFORE_CALL_13| v_arrayElimCell_34) 1) (= (select |v_#valid_BEFORE_CALL_13| .cse5) 0) (= (select |v_#valid_BEFORE_CALL_11| .cse5) 1) (= |v_#valid_BEFORE_CALL_11| (let ((.cse6 (@diff |v_#valid_BEFORE_CALL_13| |v_#valid_BEFORE_CALL_11|))) (store |v_#valid_BEFORE_CALL_13| .cse6 (select |v_#valid_BEFORE_CALL_11| .cse6))))))) (= |c_ULTIMATE.start_sll_append_~new_last~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_sll_append_~head#1.offset| 0) (exists ((|v_node_create_~temp~0#1.base_51| Int) (|v_#valid_BEFORE_CALL_10| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_17| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_17| |v_node_create_~temp~0#1.base_51|) 0) (= (select |v_old(#valid)_AFTER_CALL_17| .cse2) 1) (= (select |v_#valid_BEFORE_CALL_10| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_10| .cse2) 0) (= (let ((.cse7 (@diff |v_#valid_BEFORE_CALL_10| |v_old(#valid)_AFTER_CALL_17|))) (store |v_#valid_BEFORE_CALL_10| .cse7 (select |v_old(#valid)_AFTER_CALL_17| .cse7))) |v_old(#valid)_AFTER_CALL_17|))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int#1| .cse3) 0)) (= |c_ULTIMATE.start_sll_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= (select (select |c_#memory_$Pointer$#1.offset| .cse8) 4) 0))))) is different from false [2025-03-16 17:44:18,645 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse8 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|)) (.cse2 (select .cse4 0))) (let ((.cse0 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse1 (select (select |c_#memory_$Pointer$#1.base| .cse2) 4)) (.cse3 (select (select |c_#memory_$Pointer$#1.base| .cse8) 4))) (and (= (select .cse0 0) 0) (= (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (or (= (select (select |c_#memory_int#1| .cse1) 0) 1) (= .cse1 .cse2)) (= |c_ULTIMATE.start_sll_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#1.offset| .cse2) 4) 0) (not (= .cse3 (select .cse4 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (exists ((|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_11| (Array Int Int)) (|v_#valid_BEFORE_CALL_13| (Array Int Int)) (v_arrayElimCell_34 Int)) (let ((.cse5 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6|) 0) 0) (= (select |v_#valid_BEFORE_CALL_13| v_arrayElimCell_34) 1) (= (select |v_#valid_BEFORE_CALL_13| .cse5) 0) (= (select |v_#valid_BEFORE_CALL_11| .cse5) 1) (= |v_#valid_BEFORE_CALL_11| (let ((.cse6 (@diff |v_#valid_BEFORE_CALL_13| |v_#valid_BEFORE_CALL_11|))) (store |v_#valid_BEFORE_CALL_13| .cse6 (select |v_#valid_BEFORE_CALL_11| .cse6))))))) (= |c_ULTIMATE.start_sll_append_~new_last~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_sll_append_~head#1.offset| 0) (exists ((|v_node_create_~temp~0#1.base_51| Int) (|v_#valid_BEFORE_CALL_10| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_17| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_17| |v_node_create_~temp~0#1.base_51|) 0) (= (select |v_old(#valid)_AFTER_CALL_17| .cse2) 1) (= (select |v_#valid_BEFORE_CALL_10| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_10| .cse2) 0) (= (let ((.cse7 (@diff |v_#valid_BEFORE_CALL_10| |v_old(#valid)_AFTER_CALL_17|))) (store |v_#valid_BEFORE_CALL_10| .cse7 (select |v_old(#valid)_AFTER_CALL_17| .cse7))) |v_old(#valid)_AFTER_CALL_17|))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int#1| .cse3) 0)) (= |c_ULTIMATE.start_sll_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= (select (select |c_#memory_$Pointer$#1.offset| .cse8) 4) 0))))) is different from true [2025-03-16 17:44:18,654 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse3 (select .cse4 0))) (let ((.cse0 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse2 (select (select |c_#memory_$Pointer$#1.base| .cse3) 4)) (.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_append_~last~0#1.base|) 4))) (and (= (select .cse0 0) 0) (not (= .cse1 |c_ULTIMATE.start_sll_append_~last~0#1.base|)) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_append_~last~0#1.base|) 4) 0) (= (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (or (= (select (select |c_#memory_int#1| .cse2) 0) 1) (= .cse2 .cse3)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#1.offset| .cse3) 4) 0) (= |c_ULTIMATE.start_sll_append_~last~0#1.base| (select .cse4 |c_ULTIMATE.start_main_~#s~0#1.offset|)) (exists ((|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_11| (Array Int Int)) (|v_#valid_BEFORE_CALL_13| (Array Int Int)) (v_arrayElimCell_34 Int)) (let ((.cse5 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6|) 0) 0) (= (select |v_#valid_BEFORE_CALL_13| v_arrayElimCell_34) 1) (= (select |v_#valid_BEFORE_CALL_13| .cse5) 0) (= (select |v_#valid_BEFORE_CALL_11| .cse5) 1) (= |v_#valid_BEFORE_CALL_11| (let ((.cse6 (@diff |v_#valid_BEFORE_CALL_13| |v_#valid_BEFORE_CALL_11|))) (store |v_#valid_BEFORE_CALL_13| .cse6 (select |v_#valid_BEFORE_CALL_11| .cse6))))))) (= |c_ULTIMATE.start_sll_append_~new_last~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_node_create_~temp~0#1.base_51| Int) (|v_#valid_BEFORE_CALL_10| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_17| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_17| |v_node_create_~temp~0#1.base_51|) 0) (= (select |v_old(#valid)_AFTER_CALL_17| .cse3) 1) (= (select |v_#valid_BEFORE_CALL_10| .cse2) 1) (= (select |v_#valid_BEFORE_CALL_10| .cse3) 0) (= (let ((.cse7 (@diff |v_#valid_BEFORE_CALL_10| |v_old(#valid)_AFTER_CALL_17|))) (store |v_#valid_BEFORE_CALL_10| .cse7 (select |v_old(#valid)_AFTER_CALL_17| .cse7))) |v_old(#valid)_AFTER_CALL_17|))) (= .cse3 |c_ULTIMATE.start_sll_append_~last~0#1.base|) (= |c_ULTIMATE.start_sll_append_~last~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int#1| .cse1) 0)))))) is different from false [2025-03-16 17:44:18,657 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse3 (select .cse4 0))) (let ((.cse0 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse2 (select (select |c_#memory_$Pointer$#1.base| .cse3) 4)) (.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_append_~last~0#1.base|) 4))) (and (= (select .cse0 0) 0) (not (= .cse1 |c_ULTIMATE.start_sll_append_~last~0#1.base|)) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_append_~last~0#1.base|) 4) 0) (= (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (or (= (select (select |c_#memory_int#1| .cse2) 0) 1) (= .cse2 .cse3)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#1.offset| .cse3) 4) 0) (= |c_ULTIMATE.start_sll_append_~last~0#1.base| (select .cse4 |c_ULTIMATE.start_main_~#s~0#1.offset|)) (exists ((|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_11| (Array Int Int)) (|v_#valid_BEFORE_CALL_13| (Array Int Int)) (v_arrayElimCell_34 Int)) (let ((.cse5 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6|) 0) 0) (= (select |v_#valid_BEFORE_CALL_13| v_arrayElimCell_34) 1) (= (select |v_#valid_BEFORE_CALL_13| .cse5) 0) (= (select |v_#valid_BEFORE_CALL_11| .cse5) 1) (= |v_#valid_BEFORE_CALL_11| (let ((.cse6 (@diff |v_#valid_BEFORE_CALL_13| |v_#valid_BEFORE_CALL_11|))) (store |v_#valid_BEFORE_CALL_13| .cse6 (select |v_#valid_BEFORE_CALL_11| .cse6))))))) (= |c_ULTIMATE.start_sll_append_~new_last~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_node_create_~temp~0#1.base_51| Int) (|v_#valid_BEFORE_CALL_10| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_17| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_17| |v_node_create_~temp~0#1.base_51|) 0) (= (select |v_old(#valid)_AFTER_CALL_17| .cse3) 1) (= (select |v_#valid_BEFORE_CALL_10| .cse2) 1) (= (select |v_#valid_BEFORE_CALL_10| .cse3) 0) (= (let ((.cse7 (@diff |v_#valid_BEFORE_CALL_10| |v_old(#valid)_AFTER_CALL_17|))) (store |v_#valid_BEFORE_CALL_10| .cse7 (select |v_old(#valid)_AFTER_CALL_17| .cse7))) |v_old(#valid)_AFTER_CALL_17|))) (= .cse3 |c_ULTIMATE.start_sll_append_~last~0#1.base|) (= |c_ULTIMATE.start_sll_append_~last~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int#1| .cse1) 0)))))) is different from true [2025-03-16 17:44:18,665 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse3 (select .cse4 0))) (let ((.cse0 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse2 (select (select |c_#memory_$Pointer$#1.base| .cse3) 4)) (.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_append_~last~0#1.base|) 4))) (and (= (select .cse0 0) 0) (not (= .cse1 |c_ULTIMATE.start_sll_append_~last~0#1.base|)) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_append_~last~0#1.base|) 4) 0) (= (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (or (= (select (select |c_#memory_int#1| .cse2) 0) 1) (= .cse2 .cse3)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#1.offset| .cse3) 4) 0) (= |c_ULTIMATE.start_sll_append_~last~0#1.base| (select .cse4 |c_ULTIMATE.start_main_~#s~0#1.offset|)) (exists ((|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_11| (Array Int Int)) (|v_#valid_BEFORE_CALL_13| (Array Int Int)) (v_arrayElimCell_34 Int)) (let ((.cse5 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6|) 0) 0) (= (select |v_#valid_BEFORE_CALL_13| v_arrayElimCell_34) 1) (= (select |v_#valid_BEFORE_CALL_13| .cse5) 0) (= (select |v_#valid_BEFORE_CALL_11| .cse5) 1) (= |v_#valid_BEFORE_CALL_11| (let ((.cse6 (@diff |v_#valid_BEFORE_CALL_13| |v_#valid_BEFORE_CALL_11|))) (store |v_#valid_BEFORE_CALL_13| .cse6 (select |v_#valid_BEFORE_CALL_11| .cse6))))))) (= |c_ULTIMATE.start_sll_append_~new_last~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_node_create_~temp~0#1.base_51| Int) (|v_#valid_BEFORE_CALL_10| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_17| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_17| |v_node_create_~temp~0#1.base_51|) 0) (= (select |v_old(#valid)_AFTER_CALL_17| .cse3) 1) (= (select |v_#valid_BEFORE_CALL_10| .cse2) 1) (= (select |v_#valid_BEFORE_CALL_10| .cse3) 0) (= (let ((.cse7 (@diff |v_#valid_BEFORE_CALL_10| |v_old(#valid)_AFTER_CALL_17|))) (store |v_#valid_BEFORE_CALL_10| .cse7 (select |v_old(#valid)_AFTER_CALL_17| .cse7))) |v_old(#valid)_AFTER_CALL_17|))) (= |c_ULTIMATE.start_sll_append_#t~mem10#1.offset| 0) (= .cse3 |c_ULTIMATE.start_sll_append_~last~0#1.base|) (= |c_ULTIMATE.start_sll_append_~last~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int#1| .cse1) 0)))))) is different from false [2025-03-16 17:44:18,668 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse3 (select .cse4 0))) (let ((.cse0 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse2 (select (select |c_#memory_$Pointer$#1.base| .cse3) 4)) (.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_append_~last~0#1.base|) 4))) (and (= (select .cse0 0) 0) (not (= .cse1 |c_ULTIMATE.start_sll_append_~last~0#1.base|)) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_append_~last~0#1.base|) 4) 0) (= (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (or (= (select (select |c_#memory_int#1| .cse2) 0) 1) (= .cse2 .cse3)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#1.offset| .cse3) 4) 0) (= |c_ULTIMATE.start_sll_append_~last~0#1.base| (select .cse4 |c_ULTIMATE.start_main_~#s~0#1.offset|)) (exists ((|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_11| (Array Int Int)) (|v_#valid_BEFORE_CALL_13| (Array Int Int)) (v_arrayElimCell_34 Int)) (let ((.cse5 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6|) 0) 0) (= (select |v_#valid_BEFORE_CALL_13| v_arrayElimCell_34) 1) (= (select |v_#valid_BEFORE_CALL_13| .cse5) 0) (= (select |v_#valid_BEFORE_CALL_11| .cse5) 1) (= |v_#valid_BEFORE_CALL_11| (let ((.cse6 (@diff |v_#valid_BEFORE_CALL_13| |v_#valid_BEFORE_CALL_11|))) (store |v_#valid_BEFORE_CALL_13| .cse6 (select |v_#valid_BEFORE_CALL_11| .cse6))))))) (= |c_ULTIMATE.start_sll_append_~new_last~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_node_create_~temp~0#1.base_51| Int) (|v_#valid_BEFORE_CALL_10| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_17| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_17| |v_node_create_~temp~0#1.base_51|) 0) (= (select |v_old(#valid)_AFTER_CALL_17| .cse3) 1) (= (select |v_#valid_BEFORE_CALL_10| .cse2) 1) (= (select |v_#valid_BEFORE_CALL_10| .cse3) 0) (= (let ((.cse7 (@diff |v_#valid_BEFORE_CALL_10| |v_old(#valid)_AFTER_CALL_17|))) (store |v_#valid_BEFORE_CALL_10| .cse7 (select |v_old(#valid)_AFTER_CALL_17| .cse7))) |v_old(#valid)_AFTER_CALL_17|))) (= |c_ULTIMATE.start_sll_append_#t~mem10#1.offset| 0) (= .cse3 |c_ULTIMATE.start_sll_append_~last~0#1.base|) (= |c_ULTIMATE.start_sll_append_~last~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int#1| .cse1) 0)))))) is different from true [2025-03-16 17:44:18,677 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse9 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse4 (select .cse9 0)) (.cse2 (select .cse9 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse0 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse1 (select (select |c_#memory_$Pointer$#1.offset| .cse2) 4)) (.cse7 (+ |c_ULTIMATE.start_sll_append_~last~0#1.offset| 4)) (.cse3 (select (select |c_#memory_$Pointer$#1.base| .cse4) 4))) (and (= (select .cse0 0) 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int#1| |c_ULTIMATE.start_sll_append_~last~0#1.base|) .cse1)) (<= 0 |c_ULTIMATE.start_sll_append_~last~0#1.offset|) (= (select (select |c_#memory_$Pointer$#1.base| .cse2) 4) |c_ULTIMATE.start_sll_append_~last~0#1.base|) (= (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (or (= (select (select |c_#memory_int#1| .cse3) 0) 1) (= .cse3 .cse4)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#1.offset| .cse4) 4) 0) (exists ((|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_11| (Array Int Int)) (|v_#valid_BEFORE_CALL_13| (Array Int Int)) (v_arrayElimCell_34 Int)) (let ((.cse5 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6|) 0) 0) (= (select |v_#valid_BEFORE_CALL_13| v_arrayElimCell_34) 1) (= (select |v_#valid_BEFORE_CALL_13| .cse5) 0) (= (select |v_#valid_BEFORE_CALL_11| .cse5) 1) (= |v_#valid_BEFORE_CALL_11| (let ((.cse6 (@diff |v_#valid_BEFORE_CALL_13| |v_#valid_BEFORE_CALL_11|))) (store |v_#valid_BEFORE_CALL_13| .cse6 (select |v_#valid_BEFORE_CALL_11| .cse6))))))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (not (= .cse7 .cse1)) (exists ((|v_node_create_~temp~0#1.base_51| Int) (|v_#valid_BEFORE_CALL_10| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_17| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_17| |v_node_create_~temp~0#1.base_51|) 0) (= (select |v_old(#valid)_AFTER_CALL_17| .cse4) 1) (= (select |v_#valid_BEFORE_CALL_10| .cse3) 1) (= (select |v_#valid_BEFORE_CALL_10| .cse4) 0) (= (let ((.cse8 (@diff |v_#valid_BEFORE_CALL_10| |v_old(#valid)_AFTER_CALL_17|))) (store |v_#valid_BEFORE_CALL_10| .cse8 (select |v_old(#valid)_AFTER_CALL_17| .cse8))) |v_old(#valid)_AFTER_CALL_17|))) (not (= |c_ULTIMATE.start_sll_append_~last~0#1.base| .cse2)) (or (= |c_ULTIMATE.start_sll_append_~new_last~0#1.offset| 0) (= |c_ULTIMATE.start_sll_append_~new_last~0#1.offset| (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_append_~last~0#1.base|) .cse7))) (= .cse3 |c_ULTIMATE.start_sll_append_~last~0#1.base|))))) is different from false [2025-03-16 17:44:18,680 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse9 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse4 (select .cse9 0)) (.cse2 (select .cse9 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse0 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse1 (select (select |c_#memory_$Pointer$#1.offset| .cse2) 4)) (.cse7 (+ |c_ULTIMATE.start_sll_append_~last~0#1.offset| 4)) (.cse3 (select (select |c_#memory_$Pointer$#1.base| .cse4) 4))) (and (= (select .cse0 0) 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int#1| |c_ULTIMATE.start_sll_append_~last~0#1.base|) .cse1)) (<= 0 |c_ULTIMATE.start_sll_append_~last~0#1.offset|) (= (select (select |c_#memory_$Pointer$#1.base| .cse2) 4) |c_ULTIMATE.start_sll_append_~last~0#1.base|) (= (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (or (= (select (select |c_#memory_int#1| .cse3) 0) 1) (= .cse3 .cse4)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#1.offset| .cse4) 4) 0) (exists ((|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_11| (Array Int Int)) (|v_#valid_BEFORE_CALL_13| (Array Int Int)) (v_arrayElimCell_34 Int)) (let ((.cse5 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6|) 0) 0) (= (select |v_#valid_BEFORE_CALL_13| v_arrayElimCell_34) 1) (= (select |v_#valid_BEFORE_CALL_13| .cse5) 0) (= (select |v_#valid_BEFORE_CALL_11| .cse5) 1) (= |v_#valid_BEFORE_CALL_11| (let ((.cse6 (@diff |v_#valid_BEFORE_CALL_13| |v_#valid_BEFORE_CALL_11|))) (store |v_#valid_BEFORE_CALL_13| .cse6 (select |v_#valid_BEFORE_CALL_11| .cse6))))))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (not (= .cse7 .cse1)) (exists ((|v_node_create_~temp~0#1.base_51| Int) (|v_#valid_BEFORE_CALL_10| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_17| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_17| |v_node_create_~temp~0#1.base_51|) 0) (= (select |v_old(#valid)_AFTER_CALL_17| .cse4) 1) (= (select |v_#valid_BEFORE_CALL_10| .cse3) 1) (= (select |v_#valid_BEFORE_CALL_10| .cse4) 0) (= (let ((.cse8 (@diff |v_#valid_BEFORE_CALL_10| |v_old(#valid)_AFTER_CALL_17|))) (store |v_#valid_BEFORE_CALL_10| .cse8 (select |v_old(#valid)_AFTER_CALL_17| .cse8))) |v_old(#valid)_AFTER_CALL_17|))) (not (= |c_ULTIMATE.start_sll_append_~last~0#1.base| .cse2)) (or (= |c_ULTIMATE.start_sll_append_~new_last~0#1.offset| 0) (= |c_ULTIMATE.start_sll_append_~new_last~0#1.offset| (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_append_~last~0#1.base|) .cse7))) (= .cse3 |c_ULTIMATE.start_sll_append_~last~0#1.base|))))) is different from true [2025-03-16 17:44:18,691 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse10 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse4 (select .cse10 0)) (.cse2 (select .cse10 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse0 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse1 (select (select |c_#memory_$Pointer$#1.offset| .cse2) 4)) (.cse7 (+ |c_ULTIMATE.start_sll_append_~last~0#1.offset| 4)) (.cse3 (select (select |c_#memory_$Pointer$#1.base| .cse4) 4))) (and (= (select .cse0 0) 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int#1| |c_ULTIMATE.start_sll_append_~last~0#1.base|) .cse1)) (<= 0 |c_ULTIMATE.start_sll_append_~last~0#1.offset|) (= (select (select |c_#memory_$Pointer$#1.base| .cse2) 4) |c_ULTIMATE.start_sll_append_~last~0#1.base|) (= (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (or (= (select (select |c_#memory_int#1| .cse3) 0) 1) (= .cse3 .cse4)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#1.offset| .cse4) 4) 0) (exists ((|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_11| (Array Int Int)) (|v_#valid_BEFORE_CALL_13| (Array Int Int)) (v_arrayElimCell_34 Int)) (let ((.cse5 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6|) 0) 0) (= (select |v_#valid_BEFORE_CALL_13| v_arrayElimCell_34) 1) (= (select |v_#valid_BEFORE_CALL_13| .cse5) 0) (= (select |v_#valid_BEFORE_CALL_11| .cse5) 1) (= |v_#valid_BEFORE_CALL_11| (let ((.cse6 (@diff |v_#valid_BEFORE_CALL_13| |v_#valid_BEFORE_CALL_11|))) (store |v_#valid_BEFORE_CALL_13| .cse6 (select |v_#valid_BEFORE_CALL_11| .cse6))))))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (not (= .cse7 .cse1)) (exists ((|v_node_create_~temp~0#1.base_51| Int) (|v_#valid_BEFORE_CALL_10| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_17| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_17| |v_node_create_~temp~0#1.base_51|) 0) (= (select |v_old(#valid)_AFTER_CALL_17| .cse4) 1) (= (select |v_#valid_BEFORE_CALL_10| .cse3) 1) (= (select |v_#valid_BEFORE_CALL_10| .cse4) 0) (= (let ((.cse8 (@diff |v_#valid_BEFORE_CALL_10| |v_old(#valid)_AFTER_CALL_17|))) (store |v_#valid_BEFORE_CALL_10| .cse8 (select |v_old(#valid)_AFTER_CALL_17| .cse8))) |v_old(#valid)_AFTER_CALL_17|))) (let ((.cse9 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_append_~last~0#1.base|) .cse7))) (or (and (= |c_ULTIMATE.start_sll_append_~new_last~0#1.offset| 0) (= |c_ULTIMATE.start_sll_append_#t~mem10#1.offset| .cse9)) (= |c_ULTIMATE.start_sll_append_~new_last~0#1.offset| .cse9))) (not (= |c_ULTIMATE.start_sll_append_~last~0#1.base| .cse2)) (= .cse3 |c_ULTIMATE.start_sll_append_~last~0#1.base|))))) is different from false [2025-03-16 17:44:18,694 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse10 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse4 (select .cse10 0)) (.cse2 (select .cse10 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse0 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse1 (select (select |c_#memory_$Pointer$#1.offset| .cse2) 4)) (.cse7 (+ |c_ULTIMATE.start_sll_append_~last~0#1.offset| 4)) (.cse3 (select (select |c_#memory_$Pointer$#1.base| .cse4) 4))) (and (= (select .cse0 0) 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int#1| |c_ULTIMATE.start_sll_append_~last~0#1.base|) .cse1)) (<= 0 |c_ULTIMATE.start_sll_append_~last~0#1.offset|) (= (select (select |c_#memory_$Pointer$#1.base| .cse2) 4) |c_ULTIMATE.start_sll_append_~last~0#1.base|) (= (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (or (= (select (select |c_#memory_int#1| .cse3) 0) 1) (= .cse3 .cse4)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#1.offset| .cse4) 4) 0) (exists ((|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_11| (Array Int Int)) (|v_#valid_BEFORE_CALL_13| (Array Int Int)) (v_arrayElimCell_34 Int)) (let ((.cse5 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6|) 0) 0) (= (select |v_#valid_BEFORE_CALL_13| v_arrayElimCell_34) 1) (= (select |v_#valid_BEFORE_CALL_13| .cse5) 0) (= (select |v_#valid_BEFORE_CALL_11| .cse5) 1) (= |v_#valid_BEFORE_CALL_11| (let ((.cse6 (@diff |v_#valid_BEFORE_CALL_13| |v_#valid_BEFORE_CALL_11|))) (store |v_#valid_BEFORE_CALL_13| .cse6 (select |v_#valid_BEFORE_CALL_11| .cse6))))))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (not (= .cse7 .cse1)) (exists ((|v_node_create_~temp~0#1.base_51| Int) (|v_#valid_BEFORE_CALL_10| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_17| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_17| |v_node_create_~temp~0#1.base_51|) 0) (= (select |v_old(#valid)_AFTER_CALL_17| .cse4) 1) (= (select |v_#valid_BEFORE_CALL_10| .cse3) 1) (= (select |v_#valid_BEFORE_CALL_10| .cse4) 0) (= (let ((.cse8 (@diff |v_#valid_BEFORE_CALL_10| |v_old(#valid)_AFTER_CALL_17|))) (store |v_#valid_BEFORE_CALL_10| .cse8 (select |v_old(#valid)_AFTER_CALL_17| .cse8))) |v_old(#valid)_AFTER_CALL_17|))) (let ((.cse9 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_append_~last~0#1.base|) .cse7))) (or (and (= |c_ULTIMATE.start_sll_append_~new_last~0#1.offset| 0) (= |c_ULTIMATE.start_sll_append_#t~mem10#1.offset| .cse9)) (= |c_ULTIMATE.start_sll_append_~new_last~0#1.offset| .cse9))) (not (= |c_ULTIMATE.start_sll_append_~last~0#1.base| .cse2)) (= .cse3 |c_ULTIMATE.start_sll_append_~last~0#1.base|))))) is different from true [2025-03-16 17:44:18,700 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse9 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse4 (select .cse9 0)) (.cse2 (select .cse9 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse0 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse1 (select (select |c_#memory_$Pointer$#1.offset| .cse2) 4)) (.cse7 (+ |c_ULTIMATE.start_sll_append_~last~0#1.offset| 4)) (.cse3 (select (select |c_#memory_$Pointer$#1.base| .cse4) 4))) (and (= (select .cse0 0) 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int#1| |c_ULTIMATE.start_sll_append_~last~0#1.base|) .cse1)) (<= 0 |c_ULTIMATE.start_sll_append_~last~0#1.offset|) (= (select (select |c_#memory_$Pointer$#1.base| .cse2) 4) |c_ULTIMATE.start_sll_append_~last~0#1.base|) (= (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (or (= (select (select |c_#memory_int#1| .cse3) 0) 1) (= .cse3 .cse4)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#1.offset| .cse4) 4) 0) (exists ((|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_11| (Array Int Int)) (|v_#valid_BEFORE_CALL_13| (Array Int Int)) (v_arrayElimCell_34 Int)) (let ((.cse5 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6|) 0) 0) (= (select |v_#valid_BEFORE_CALL_13| v_arrayElimCell_34) 1) (= (select |v_#valid_BEFORE_CALL_13| .cse5) 0) (= (select |v_#valid_BEFORE_CALL_11| .cse5) 1) (= |v_#valid_BEFORE_CALL_11| (let ((.cse6 (@diff |v_#valid_BEFORE_CALL_13| |v_#valid_BEFORE_CALL_11|))) (store |v_#valid_BEFORE_CALL_13| .cse6 (select |v_#valid_BEFORE_CALL_11| .cse6))))))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (not (= .cse7 .cse1)) (exists ((|v_node_create_~temp~0#1.base_51| Int) (|v_#valid_BEFORE_CALL_10| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_17| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_17| |v_node_create_~temp~0#1.base_51|) 0) (= (select |v_old(#valid)_AFTER_CALL_17| .cse4) 1) (= (select |v_#valid_BEFORE_CALL_10| .cse3) 1) (= (select |v_#valid_BEFORE_CALL_10| .cse4) 0) (= (let ((.cse8 (@diff |v_#valid_BEFORE_CALL_10| |v_old(#valid)_AFTER_CALL_17|))) (store |v_#valid_BEFORE_CALL_10| .cse8 (select |v_old(#valid)_AFTER_CALL_17| .cse8))) |v_old(#valid)_AFTER_CALL_17|))) (not (= |c_ULTIMATE.start_sll_append_~last~0#1.base| .cse2)) (= |c_ULTIMATE.start_sll_append_~new_last~0#1.offset| (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_append_~last~0#1.base|) .cse7)) (= .cse3 |c_ULTIMATE.start_sll_append_~last~0#1.base|))))) is different from false [2025-03-16 17:44:18,703 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse9 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse4 (select .cse9 0)) (.cse2 (select .cse9 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse0 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse1 (select (select |c_#memory_$Pointer$#1.offset| .cse2) 4)) (.cse7 (+ |c_ULTIMATE.start_sll_append_~last~0#1.offset| 4)) (.cse3 (select (select |c_#memory_$Pointer$#1.base| .cse4) 4))) (and (= (select .cse0 0) 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int#1| |c_ULTIMATE.start_sll_append_~last~0#1.base|) .cse1)) (<= 0 |c_ULTIMATE.start_sll_append_~last~0#1.offset|) (= (select (select |c_#memory_$Pointer$#1.base| .cse2) 4) |c_ULTIMATE.start_sll_append_~last~0#1.base|) (= (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (or (= (select (select |c_#memory_int#1| .cse3) 0) 1) (= .cse3 .cse4)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#1.offset| .cse4) 4) 0) (exists ((|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_11| (Array Int Int)) (|v_#valid_BEFORE_CALL_13| (Array Int Int)) (v_arrayElimCell_34 Int)) (let ((.cse5 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6|) 0) 0) (= (select |v_#valid_BEFORE_CALL_13| v_arrayElimCell_34) 1) (= (select |v_#valid_BEFORE_CALL_13| .cse5) 0) (= (select |v_#valid_BEFORE_CALL_11| .cse5) 1) (= |v_#valid_BEFORE_CALL_11| (let ((.cse6 (@diff |v_#valid_BEFORE_CALL_13| |v_#valid_BEFORE_CALL_11|))) (store |v_#valid_BEFORE_CALL_13| .cse6 (select |v_#valid_BEFORE_CALL_11| .cse6))))))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (not (= .cse7 .cse1)) (exists ((|v_node_create_~temp~0#1.base_51| Int) (|v_#valid_BEFORE_CALL_10| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_17| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_17| |v_node_create_~temp~0#1.base_51|) 0) (= (select |v_old(#valid)_AFTER_CALL_17| .cse4) 1) (= (select |v_#valid_BEFORE_CALL_10| .cse3) 1) (= (select |v_#valid_BEFORE_CALL_10| .cse4) 0) (= (let ((.cse8 (@diff |v_#valid_BEFORE_CALL_10| |v_old(#valid)_AFTER_CALL_17|))) (store |v_#valid_BEFORE_CALL_10| .cse8 (select |v_old(#valid)_AFTER_CALL_17| .cse8))) |v_old(#valid)_AFTER_CALL_17|))) (not (= |c_ULTIMATE.start_sll_append_~last~0#1.base| .cse2)) (= |c_ULTIMATE.start_sll_append_~new_last~0#1.offset| (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_append_~last~0#1.base|) .cse7)) (= .cse3 |c_ULTIMATE.start_sll_append_~last~0#1.base|))))) is different from true [2025-03-16 17:44:18,710 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse8 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse5 (select .cse8 0))) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| .cse5) 4))) (let ((.cse0 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse2 (= .cse1 .cse5))) (and (= (select .cse0 0) 0) (= (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (or (= (select (select |c_#memory_int#1| .cse1) 0) 1) .cse2) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_11| (Array Int Int)) (|v_#valid_BEFORE_CALL_13| (Array Int Int)) (v_arrayElimCell_34 Int)) (let ((.cse3 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6|) 0) 0) (= (select |v_#valid_BEFORE_CALL_13| v_arrayElimCell_34) 1) (= (select |v_#valid_BEFORE_CALL_13| .cse3) 0) (= (select |v_#valid_BEFORE_CALL_11| .cse3) 1) (= |v_#valid_BEFORE_CALL_11| (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_13| |v_#valid_BEFORE_CALL_11|))) (store |v_#valid_BEFORE_CALL_13| .cse4 (select |v_#valid_BEFORE_CALL_11| .cse4))))))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_node_create_~temp~0#1.base_51| Int) (|v_#valid_BEFORE_CALL_10| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_17| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_17| |v_node_create_~temp~0#1.base_51|) 0) (= (select |v_old(#valid)_AFTER_CALL_17| .cse5) 1) (= (select |v_#valid_BEFORE_CALL_10| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_10| .cse5) 0) (= (let ((.cse6 (@diff |v_#valid_BEFORE_CALL_10| |v_old(#valid)_AFTER_CALL_17|))) (store |v_#valid_BEFORE_CALL_10| .cse6 (select |v_old(#valid)_AFTER_CALL_17| .cse6))) |v_old(#valid)_AFTER_CALL_17|))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse7 (select .cse8 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select |c_#memory_int#1| (select (select |c_#memory_$Pointer$#1.base| .cse7) 4)) (select (select |c_#memory_$Pointer$#1.offset| .cse7) 4)))) (or (= (select (select |c_#memory_$Pointer$#1.offset| .cse5) 4) 0) .cse2)))))) is different from false [2025-03-16 17:44:18,712 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse8 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse5 (select .cse8 0))) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| .cse5) 4))) (let ((.cse0 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse2 (= .cse1 .cse5))) (and (= (select .cse0 0) 0) (= (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (or (= (select (select |c_#memory_int#1| .cse1) 0) 1) .cse2) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_11| (Array Int Int)) (|v_#valid_BEFORE_CALL_13| (Array Int Int)) (v_arrayElimCell_34 Int)) (let ((.cse3 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_6|) 0) 0) (= (select |v_#valid_BEFORE_CALL_13| v_arrayElimCell_34) 1) (= (select |v_#valid_BEFORE_CALL_13| .cse3) 0) (= (select |v_#valid_BEFORE_CALL_11| .cse3) 1) (= |v_#valid_BEFORE_CALL_11| (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_13| |v_#valid_BEFORE_CALL_11|))) (store |v_#valid_BEFORE_CALL_13| .cse4 (select |v_#valid_BEFORE_CALL_11| .cse4))))))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_node_create_~temp~0#1.base_51| Int) (|v_#valid_BEFORE_CALL_10| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_17| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_17| |v_node_create_~temp~0#1.base_51|) 0) (= (select |v_old(#valid)_AFTER_CALL_17| .cse5) 1) (= (select |v_#valid_BEFORE_CALL_10| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_10| .cse5) 0) (= (let ((.cse6 (@diff |v_#valid_BEFORE_CALL_10| |v_old(#valid)_AFTER_CALL_17|))) (store |v_#valid_BEFORE_CALL_10| .cse6 (select |v_old(#valid)_AFTER_CALL_17| .cse6))) |v_old(#valid)_AFTER_CALL_17|))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse7 (select .cse8 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select |c_#memory_int#1| (select (select |c_#memory_$Pointer$#1.base| .cse7) 4)) (select (select |c_#memory_$Pointer$#1.offset| .cse7) 4)))) (or (= (select (select |c_#memory_$Pointer$#1.offset| .cse5) 4) 0) .cse2)))))) is different from true [2025-03-16 17:44:18,719 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~ptr~0#1.base|) 4))) (let ((.cse1 (select |c_#memory_int#1| .cse3)) (.cse2 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~ptr~0#1.base|) 4)) (.cse0 (= .cse3 |c_ULTIMATE.start_main_~ptr~0#1.base|))) (and (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (or .cse0 (= (select .cse1 0) 1)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse1 .cse2)) (exists ((|v_node_create_~temp~0#1.base_51| Int) (|v_#valid_BEFORE_CALL_10| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_17| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_17| |v_node_create_~temp~0#1.base_51|) 0) (= (select |v_old(#valid)_AFTER_CALL_17| |c_ULTIMATE.start_main_~ptr~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_10| .cse3) 1) (= (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_10| |v_old(#valid)_AFTER_CALL_17|))) (store |v_#valid_BEFORE_CALL_10| .cse4 (select |v_old(#valid)_AFTER_CALL_17| .cse4))) |v_old(#valid)_AFTER_CALL_17|) (= (select |v_#valid_BEFORE_CALL_10| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0))) (or (= .cse2 0) .cse0) (= |c_ULTIMATE.start_main_~data~0#1| 1)))) is different from false [2025-03-16 17:44:18,720 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~ptr~0#1.base|) 4))) (let ((.cse1 (select |c_#memory_int#1| .cse3)) (.cse2 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~ptr~0#1.base|) 4)) (.cse0 (= .cse3 |c_ULTIMATE.start_main_~ptr~0#1.base|))) (and (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (or .cse0 (= (select .cse1 0) 1)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse1 .cse2)) (exists ((|v_node_create_~temp~0#1.base_51| Int) (|v_#valid_BEFORE_CALL_10| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_17| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_17| |v_node_create_~temp~0#1.base_51|) 0) (= (select |v_old(#valid)_AFTER_CALL_17| |c_ULTIMATE.start_main_~ptr~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_10| .cse3) 1) (= (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_10| |v_old(#valid)_AFTER_CALL_17|))) (store |v_#valid_BEFORE_CALL_10| .cse4 (select |v_old(#valid)_AFTER_CALL_17| .cse4))) |v_old(#valid)_AFTER_CALL_17|) (= (select |v_#valid_BEFORE_CALL_10| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0))) (or (= .cse2 0) .cse0) (= |c_ULTIMATE.start_main_~data~0#1| 1)))) is different from true [2025-03-16 17:44:18,734 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int#1| |c_ULTIMATE.start_main_~temp~2#1.base|))) (and (= (select .cse0 0) 1) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse0 |c_ULTIMATE.start_main_~temp~2#1.offset|)) (exists ((|v_node_create_~temp~0#1.base_51| Int) (|v_ULTIMATE.start_main_~ptr~0#1.base_15| Int) (|v_#valid_BEFORE_CALL_10| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_17| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_10| |v_ULTIMATE.start_main_~ptr~0#1.base_15|) 0) (= (select |v_old(#valid)_AFTER_CALL_17| |v_node_create_~temp~0#1.base_51|) 0) (= 1 (select |v_#valid_BEFORE_CALL_10| |c_ULTIMATE.start_main_~temp~2#1.base|)) (= (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_10| |v_old(#valid)_AFTER_CALL_17|))) (store |v_#valid_BEFORE_CALL_10| .cse1 (select |v_old(#valid)_AFTER_CALL_17| .cse1))) |v_old(#valid)_AFTER_CALL_17|) (= (select |v_old(#valid)_AFTER_CALL_17| |v_ULTIMATE.start_main_~ptr~0#1.base_15|) 1))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_main_~temp~2#1.offset| 0))) is different from false [2025-03-16 17:44:18,736 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int#1| |c_ULTIMATE.start_main_~temp~2#1.base|))) (and (= (select .cse0 0) 1) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse0 |c_ULTIMATE.start_main_~temp~2#1.offset|)) (exists ((|v_node_create_~temp~0#1.base_51| Int) (|v_ULTIMATE.start_main_~ptr~0#1.base_15| Int) (|v_#valid_BEFORE_CALL_10| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_17| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_10| |v_ULTIMATE.start_main_~ptr~0#1.base_15|) 0) (= (select |v_old(#valid)_AFTER_CALL_17| |v_node_create_~temp~0#1.base_51|) 0) (= 1 (select |v_#valid_BEFORE_CALL_10| |c_ULTIMATE.start_main_~temp~2#1.base|)) (= (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_10| |v_old(#valid)_AFTER_CALL_17|))) (store |v_#valid_BEFORE_CALL_10| .cse1 (select |v_old(#valid)_AFTER_CALL_17| .cse1))) |v_old(#valid)_AFTER_CALL_17|) (= (select |v_old(#valid)_AFTER_CALL_17| |v_ULTIMATE.start_main_~ptr~0#1.base_15|) 1))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_main_~temp~2#1.offset| 0))) is different from true [2025-03-16 17:44:18,752 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int#1| |c_ULTIMATE.start_main_~ptr~0#1.base|))) (and (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse0 |c_ULTIMATE.start_main_~ptr~0#1.offset|)) (exists ((|v_node_create_~temp~0#1.base_51| Int) (|v_ULTIMATE.start_main_~ptr~0#1.base_15| Int) (|v_#valid_BEFORE_CALL_10| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_17| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_10| |v_ULTIMATE.start_main_~ptr~0#1.base_15|) 0) (= (select |v_old(#valid)_AFTER_CALL_17| |v_node_create_~temp~0#1.base_51|) 0) (= (select |v_#valid_BEFORE_CALL_10| |c_ULTIMATE.start_main_~ptr~0#1.base|) 1) (= (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_10| |v_old(#valid)_AFTER_CALL_17|))) (store |v_#valid_BEFORE_CALL_10| .cse1 (select |v_old(#valid)_AFTER_CALL_17| .cse1))) |v_old(#valid)_AFTER_CALL_17|) (= (select |v_old(#valid)_AFTER_CALL_17| |v_ULTIMATE.start_main_~ptr~0#1.base_15|) 1))) (= (select .cse0 0) 1) (= |c_ULTIMATE.start_main_~data~0#1| 1))) is different from false [2025-03-16 17:44:18,754 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int#1| |c_ULTIMATE.start_main_~ptr~0#1.base|))) (and (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse0 |c_ULTIMATE.start_main_~ptr~0#1.offset|)) (exists ((|v_node_create_~temp~0#1.base_51| Int) (|v_ULTIMATE.start_main_~ptr~0#1.base_15| Int) (|v_#valid_BEFORE_CALL_10| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_17| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_10| |v_ULTIMATE.start_main_~ptr~0#1.base_15|) 0) (= (select |v_old(#valid)_AFTER_CALL_17| |v_node_create_~temp~0#1.base_51|) 0) (= (select |v_#valid_BEFORE_CALL_10| |c_ULTIMATE.start_main_~ptr~0#1.base|) 1) (= (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_10| |v_old(#valid)_AFTER_CALL_17|))) (store |v_#valid_BEFORE_CALL_10| .cse1 (select |v_old(#valid)_AFTER_CALL_17| .cse1))) |v_old(#valid)_AFTER_CALL_17|) (= (select |v_old(#valid)_AFTER_CALL_17| |v_ULTIMATE.start_main_~ptr~0#1.base_15|) 1))) (= (select .cse0 0) 1) (= |c_ULTIMATE.start_main_~data~0#1| 1))) is different from true [2025-03-16 17:44:18,802 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_int#1| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 0))) (let ((.cse0 (= .cse2 1))) (and (not (= |c_ULTIMATE.start_sll_create_#t~ret4#1.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|)) .cse0 (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 1) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_#valid_BEFORE_CALL_10| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_10| |c_ULTIMATE.start_sll_create_#t~ret4#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_10| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 1) (= |c_#valid| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_10| |c_#valid|))) (store |v_#valid_BEFORE_CALL_10| .cse1 (select |c_#valid| .cse1)))))) (= |c_ULTIMATE.start_main_~data~0#1| .cse2) (or .cse0 (exists ((|v_#memory_int#1_BEFORE_CALL_6| (Array Int (Array Int Int)))) (let ((.cse3 (@diff |v_#memory_int#1_BEFORE_CALL_6| |c_#memory_int#1|))) (and (= |c_ULTIMATE.start_sll_create_#t~ret4#1.base| .cse3) (= |c_#memory_int#1| (store |v_#memory_int#1_BEFORE_CALL_6| .cse3 (select |c_#memory_int#1| .cse3))) (= (select (select |v_#memory_int#1_BEFORE_CALL_6| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 0) 1))))) (= |c_ULTIMATE.start_sll_create_#t~ret4#1.offset| 0) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_#t~ret4#1.base|) 1)))) is different from false [2025-03-16 17:44:18,804 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_int#1| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 0))) (let ((.cse0 (= .cse2 1))) (and (not (= |c_ULTIMATE.start_sll_create_#t~ret4#1.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|)) .cse0 (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 1) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_#valid_BEFORE_CALL_10| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_10| |c_ULTIMATE.start_sll_create_#t~ret4#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_10| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 1) (= |c_#valid| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_10| |c_#valid|))) (store |v_#valid_BEFORE_CALL_10| .cse1 (select |c_#valid| .cse1)))))) (= |c_ULTIMATE.start_main_~data~0#1| .cse2) (or .cse0 (exists ((|v_#memory_int#1_BEFORE_CALL_6| (Array Int (Array Int Int)))) (let ((.cse3 (@diff |v_#memory_int#1_BEFORE_CALL_6| |c_#memory_int#1|))) (and (= |c_ULTIMATE.start_sll_create_#t~ret4#1.base| .cse3) (= |c_#memory_int#1| (store |v_#memory_int#1_BEFORE_CALL_6| .cse3 (select |c_#memory_int#1| .cse3))) (= (select (select |v_#memory_int#1_BEFORE_CALL_6| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 0) 1))))) (= |c_ULTIMATE.start_sll_create_#t~ret4#1.offset| 0) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_#t~ret4#1.base|) 1)))) is different from true [2025-03-16 17:44:18,808 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4))) (let ((.cse4 (= .cse0 |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (.cse3 (select (select |c_#memory_int#1| .cse0) 0))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4) 0) (= (select |c_#valid| .cse0) 1) (exists ((|v_#valid_BEFORE_CALL_10| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_10| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_10| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 0) (= |c_#valid| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_10| |c_#valid|))) (store |v_#valid_BEFORE_CALL_10| .cse1 (select |c_#valid| .cse1)))))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 1) (= |c_ULTIMATE.start_main_~data~0#1| 1) (or (exists ((|v_#memory_int#1_111| (Array Int (Array Int Int)))) (and (exists ((|v_#memory_int#1_BEFORE_CALL_6| (Array Int (Array Int Int)))) (let ((.cse2 (@diff |v_#memory_int#1_BEFORE_CALL_6| |v_#memory_int#1_111|))) (and (= (store |v_#memory_int#1_BEFORE_CALL_6| .cse2 (select |v_#memory_int#1_111| .cse2)) |v_#memory_int#1_111|) (= .cse2 |c_ULTIMATE.start_sll_create_~head~0#1.base|) (= (select (select |v_#memory_int#1_BEFORE_CALL_6| .cse0) 0) 1)))) (= |c_#memory_int#1| (store |v_#memory_int#1_111| |c_ULTIMATE.start_sll_create_~head~0#1.base| (select |c_#memory_int#1| |c_ULTIMATE.start_sll_create_~head~0#1.base|))))) (= .cse3 1) .cse4) (not .cse4) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| .cse3)))) is different from false [2025-03-16 17:44:18,810 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4))) (let ((.cse4 (= .cse0 |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (.cse3 (select (select |c_#memory_int#1| .cse0) 0))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4) 0) (= (select |c_#valid| .cse0) 1) (exists ((|v_#valid_BEFORE_CALL_10| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_10| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_10| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 0) (= |c_#valid| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_10| |c_#valid|))) (store |v_#valid_BEFORE_CALL_10| .cse1 (select |c_#valid| .cse1)))))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 1) (= |c_ULTIMATE.start_main_~data~0#1| 1) (or (exists ((|v_#memory_int#1_111| (Array Int (Array Int Int)))) (and (exists ((|v_#memory_int#1_BEFORE_CALL_6| (Array Int (Array Int Int)))) (let ((.cse2 (@diff |v_#memory_int#1_BEFORE_CALL_6| |v_#memory_int#1_111|))) (and (= (store |v_#memory_int#1_BEFORE_CALL_6| .cse2 (select |v_#memory_int#1_111| .cse2)) |v_#memory_int#1_111|) (= .cse2 |c_ULTIMATE.start_sll_create_~head~0#1.base|) (= (select (select |v_#memory_int#1_BEFORE_CALL_6| .cse0) 0) 1)))) (= |c_#memory_int#1| (store |v_#memory_int#1_111| |c_ULTIMATE.start_sll_create_~head~0#1.base| (select |c_#memory_int#1| |c_ULTIMATE.start_sll_create_~head~0#1.base|))))) (= .cse3 1) .cse4) (not .cse4) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| .cse3)))) is different from true [2025-03-16 17:44:18,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 17:44:18,855 INFO L93 Difference]: Finished difference Result 65 states and 76 transitions. [2025-03-16 17:44:18,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2025-03-16 17:44:18,855 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 43 states have (on average 1.2325581395348837) internal successors, (53), 36 states have internal predecessors, (53), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 37 [2025-03-16 17:44:18,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 17:44:18,856 INFO L225 Difference]: With dead ends: 65 [2025-03-16 17:44:18,856 INFO L226 Difference]: Without dead ends: 63 [2025-03-16 17:44:18,857 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 71 ConstructedPredicates, 34 IntricatePredicates, 0 DeprecatedPredicates, 162 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=186, Invalid=1367, Unknown=65, NotChecked=3638, Total=5256 [2025-03-16 17:44:18,857 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 2 mSDsluCounter, 263 mSDsCounter, 0 mSdLazyCounter, 311 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 283 SdHoareTripleChecker+Invalid, 1824 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 311 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1503 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 17:44:18,857 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 283 Invalid, 1824 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 311 Invalid, 0 Unknown, 1503 Unchecked, 0.2s Time] [2025-03-16 17:44:18,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2025-03-16 17:44:18,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 62. [2025-03-16 17:44:18,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 52 states have (on average 1.1730769230769231) internal successors, (61), 52 states have internal predecessors, (61), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-16 17:44:18,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 73 transitions. [2025-03-16 17:44:18,866 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 73 transitions. Word has length 37 [2025-03-16 17:44:18,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 17:44:18,866 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 73 transitions. [2025-03-16 17:44:18,866 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 43 states have (on average 1.2325581395348837) internal successors, (53), 36 states have internal predecessors, (53), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-16 17:44:18,866 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 73 transitions. [2025-03-16 17:44:18,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-03-16 17:44:18,867 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 17:44:18,867 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 17:44:18,873 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-16 17:44:19,067 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 17:44:19,067 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 17:44:19,068 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 17:44:19,068 INFO L85 PathProgramCache]: Analyzing trace with hash 238829599, now seen corresponding path program 1 times [2025-03-16 17:44:19,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 17:44:19,068 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2100558369] [2025-03-16 17:44:19,068 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 17:44:19,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 17:44:19,079 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-16 17:44:19,091 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-16 17:44:19,091 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 17:44:19,091 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:44:19,892 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 12 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 17:44:19,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 17:44:19,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2100558369] [2025-03-16 17:44:19,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2100558369] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 17:44:19,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [518143070] [2025-03-16 17:44:19,893 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 17:44:19,893 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 17:44:19,893 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 17:44:19,895 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 17:44:19,896 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-16 17:44:19,980 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-16 17:44:20,015 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-16 17:44:20,016 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 17:44:20,016 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:44:20,021 INFO L256 TraceCheckSpWp]: Trace formula consists of 341 conjuncts, 51 conjuncts are in the unsatisfiable core [2025-03-16 17:44:20,024 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 17:44:20,104 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-03-16 17:44:20,172 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-03-16 17:44:20,233 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 4 [2025-03-16 17:44:20,235 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-03-16 17:44:20,290 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v_node_create_~temp~0#1.base_60| Int)) (and (= (select |c_old(#valid)| |v_node_create_~temp~0#1.base_60|) 0) (= (store |c_old(#memory_$Pointer$#1.base)| |v_node_create_~temp~0#1.base_60| (select |c_#memory_$Pointer$#1.base| |v_node_create_~temp~0#1.base_60|)) |c_#memory_$Pointer$#1.base|))) is different from true [2025-03-16 17:44:20,308 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-16 17:44:20,309 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 22 [2025-03-16 17:44:20,320 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2025-03-16 17:44:20,320 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-03-16 17:44:20,425 INFO L349 Elim1Store]: treesize reduction 59, result has 37.2 percent of original size [2025-03-16 17:44:20,425 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 47 treesize of output 42 [2025-03-16 17:44:20,429 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 18 [2025-03-16 17:44:20,430 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2025-03-16 17:44:20,451 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-03-16 17:44:20,454 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 6 proven. 11 refuted. 0 times theorem prover too weak. 2 trivial. 4 not checked. [2025-03-16 17:44:20,454 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 17:44:20,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [518143070] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 17:44:20,663 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-16 17:44:20,663 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 20] total 39 [2025-03-16 17:44:20,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [563805274] [2025-03-16 17:44:20,663 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-16 17:44:20,663 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2025-03-16 17:44:20,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 17:44:20,664 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2025-03-16 17:44:20,664 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=1530, Unknown=2, NotChecked=78, Total=1722 [2025-03-16 17:44:20,664 INFO L87 Difference]: Start difference. First operand 62 states and 73 transitions. Second operand has 39 states, 37 states have (on average 1.5135135135135136) internal successors, (56), 32 states have internal predecessors, (56), 5 states have call successors, (5), 4 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2025-03-16 17:44:21,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 17:44:21,258 INFO L93 Difference]: Finished difference Result 70 states and 81 transitions. [2025-03-16 17:44:21,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-03-16 17:44:21,259 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 37 states have (on average 1.5135135135135136) internal successors, (56), 32 states have internal predecessors, (56), 5 states have call successors, (5), 4 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 37 [2025-03-16 17:44:21,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 17:44:21,259 INFO L225 Difference]: With dead ends: 70 [2025-03-16 17:44:21,259 INFO L226 Difference]: Without dead ends: 67 [2025-03-16 17:44:21,260 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 57 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 580 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=227, Invalid=3081, Unknown=2, NotChecked=112, Total=3422 [2025-03-16 17:44:21,260 INFO L435 NwaCegarLoop]: 14 mSDtfsCounter, 36 mSDsluCounter, 268 mSDsCounter, 0 mSdLazyCounter, 667 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 282 SdHoareTripleChecker+Invalid, 713 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 667 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 41 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 17:44:21,261 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 282 Invalid, 713 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 667 Invalid, 0 Unknown, 41 Unchecked, 0.3s Time] [2025-03-16 17:44:21,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2025-03-16 17:44:21,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 65. [2025-03-16 17:44:21,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 55 states have (on average 1.1636363636363636) internal successors, (64), 55 states have internal predecessors, (64), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-16 17:44:21,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 76 transitions. [2025-03-16 17:44:21,269 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 76 transitions. Word has length 37 [2025-03-16 17:44:21,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 17:44:21,269 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 76 transitions. [2025-03-16 17:44:21,269 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 37 states have (on average 1.5135135135135136) internal successors, (56), 32 states have internal predecessors, (56), 5 states have call successors, (5), 4 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2025-03-16 17:44:21,269 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 76 transitions. [2025-03-16 17:44:21,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-03-16 17:44:21,270 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 17:44:21,270 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 17:44:21,276 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-16 17:44:21,470 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 17:44:21,470 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 17:44:21,470 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 17:44:21,471 INFO L85 PathProgramCache]: Analyzing trace with hash -2023847847, now seen corresponding path program 2 times [2025-03-16 17:44:21,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 17:44:21,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147487653] [2025-03-16 17:44:21,471 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-16 17:44:21,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 17:44:21,481 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 37 statements into 2 equivalence classes. [2025-03-16 17:44:21,499 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 37 of 37 statements. [2025-03-16 17:44:21,499 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-16 17:44:21,499 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:44:22,614 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 7 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 17:44:22,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 17:44:22,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [147487653] [2025-03-16 17:44:22,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [147487653] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 17:44:22,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1766853744] [2025-03-16 17:44:22,614 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-16 17:44:22,614 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 17:44:22,615 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 17:44:22,616 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 17:44:22,618 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-16 17:44:22,703 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 37 statements into 2 equivalence classes. [2025-03-16 17:44:22,739 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 37 of 37 statements. [2025-03-16 17:44:22,739 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-16 17:44:22,739 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:44:22,741 INFO L256 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 126 conjuncts are in the unsatisfiable core [2025-03-16 17:44:22,747 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 17:44:22,786 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-03-16 17:44:22,839 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-03-16 17:44:22,935 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-03-16 17:44:22,980 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-03-16 17:44:22,980 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 15 [2025-03-16 17:44:22,996 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-03-16 17:44:22,996 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-03-16 17:44:23,052 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-16 17:44:23,058 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-03-16 17:44:23,063 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2025-03-16 17:44:23,171 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 45 treesize of output 21 [2025-03-16 17:44:23,174 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2025-03-16 17:44:23,177 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-03-16 17:44:23,180 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-03-16 17:44:23,280 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((|v_node_create_~temp~0#1.base_69| Int)) (and (= (select |c_old(#valid)| |v_node_create_~temp~0#1.base_69|) 0) (= |c_#memory_int#1| (store |c_old(#memory_int#1)| |v_node_create_~temp~0#1.base_69| (select |c_#memory_int#1| |v_node_create_~temp~0#1.base_69|))) (= |c_#memory_$Pointer$#1.offset| (store |c_old(#memory_$Pointer$#1.offset)| |v_node_create_~temp~0#1.base_69| (select |c_#memory_$Pointer$#1.offset| |v_node_create_~temp~0#1.base_69|))) (= |c_#memory_$Pointer$#1.base| (store |c_old(#memory_$Pointer$#1.base)| |v_node_create_~temp~0#1.base_69| (select |c_#memory_$Pointer$#1.base| |v_node_create_~temp~0#1.base_69|))))) (exists ((|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_7| Int)) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_7|) 0) 0))) is different from true [2025-03-16 17:44:23,300 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-16 17:44:23,301 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 53 treesize of output 36 [2025-03-16 17:44:23,306 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-16 17:44:23,307 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-16 17:44:23,307 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 33 [2025-03-16 17:44:23,318 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2025-03-16 17:44:23,319 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-03-16 17:44:23,322 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2025-03-16 17:44:23,473 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 19 [2025-03-16 17:44:23,555 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2025-03-16 17:44:23,626 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2025-03-16 17:44:23,685 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-03-16 17:44:23,750 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 9 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2025-03-16 17:44:23,750 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 17:44:23,760 WARN L851 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_sll_append_~last~0#1.base| Int) (v_ArrVal_1028 (Array Int Int))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store |c_#memory_int#1| |ULTIMATE.start_sll_append_~last~0#1.base| v_ArrVal_1028) (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (not (= (let ((.cse0 (+ |c_ULTIMATE.start_sll_append_~last~0#1.offset| 4))) (store (select |c_#memory_int#1| |ULTIMATE.start_sll_append_~last~0#1.base|) .cse0 (select v_ArrVal_1028 .cse0))) v_ArrVal_1028)))) is different from false [2025-03-16 17:44:28,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1766853744] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 17:44:28,212 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-16 17:44:28,212 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 23] total 44 [2025-03-16 17:44:28,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1339221050] [2025-03-16 17:44:28,212 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-16 17:44:28,213 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2025-03-16 17:44:28,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 17:44:28,213 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2025-03-16 17:44:28,213 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=1984, Unknown=35, NotChecked=182, Total=2352 [2025-03-16 17:44:28,214 INFO L87 Difference]: Start difference. First operand 65 states and 76 transitions. Second operand has 44 states, 42 states have (on average 1.3571428571428572) internal successors, (57), 34 states have internal predecessors, (57), 6 states have call successors, (6), 5 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-16 17:44:29,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 17:44:29,838 INFO L93 Difference]: Finished difference Result 90 states and 106 transitions. [2025-03-16 17:44:29,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2025-03-16 17:44:29,838 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 42 states have (on average 1.3571428571428572) internal successors, (57), 34 states have internal predecessors, (57), 6 states have call successors, (6), 5 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 37 [2025-03-16 17:44:29,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 17:44:29,839 INFO L225 Difference]: With dead ends: 90 [2025-03-16 17:44:29,839 INFO L226 Difference]: Without dead ends: 88 [2025-03-16 17:44:29,840 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1031 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=309, Invalid=4082, Unknown=39, NotChecked=262, Total=4692 [2025-03-16 17:44:29,841 INFO L435 NwaCegarLoop]: 15 mSDtfsCounter, 21 mSDsluCounter, 341 mSDsCounter, 0 mSdLazyCounter, 858 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 356 SdHoareTripleChecker+Invalid, 947 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 858 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 73 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-16 17:44:29,841 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 356 Invalid, 947 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 858 Invalid, 0 Unknown, 73 Unchecked, 0.7s Time] [2025-03-16 17:44:29,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2025-03-16 17:44:29,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 67. [2025-03-16 17:44:29,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 57 states have (on average 1.1754385964912282) internal successors, (67), 57 states have internal predecessors, (67), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-16 17:44:29,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 79 transitions. [2025-03-16 17:44:29,854 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 79 transitions. Word has length 37 [2025-03-16 17:44:29,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 17:44:29,854 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 79 transitions. [2025-03-16 17:44:29,854 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 42 states have (on average 1.3571428571428572) internal successors, (57), 34 states have internal predecessors, (57), 6 states have call successors, (6), 5 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-16 17:44:29,854 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 79 transitions. [2025-03-16 17:44:29,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-03-16 17:44:29,855 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 17:44:29,855 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 17:44:29,861 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-03-16 17:44:30,055 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-03-16 17:44:30,055 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 17:44:30,056 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 17:44:30,056 INFO L85 PathProgramCache]: Analyzing trace with hash 1881276890, now seen corresponding path program 2 times [2025-03-16 17:44:30,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 17:44:30,056 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1972985604] [2025-03-16 17:44:30,056 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-16 17:44:30,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 17:44:30,066 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 39 statements into 2 equivalence classes. [2025-03-16 17:44:30,077 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 39 of 39 statements. [2025-03-16 17:44:30,077 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-16 17:44:30,077 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:44:31,509 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 12 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 17:44:31,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 17:44:31,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1972985604] [2025-03-16 17:44:31,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1972985604] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 17:44:31,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1145694277] [2025-03-16 17:44:31,509 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-16 17:44:31,509 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 17:44:31,509 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 17:44:31,511 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 17:44:31,512 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-16 17:44:31,598 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 39 statements into 2 equivalence classes. [2025-03-16 17:44:31,635 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 39 of 39 statements. [2025-03-16 17:44:31,635 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-16 17:44:31,635 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:44:31,637 INFO L256 TraceCheckSpWp]: Trace formula consists of 359 conjuncts, 153 conjuncts are in the unsatisfiable core [2025-03-16 17:44:31,640 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 17:44:31,682 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2025-03-16 17:44:31,812 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-03-16 17:44:31,819 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-03-16 17:44:32,028 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-03-16 17:44:32,028 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 16 treesize of output 15 [2025-03-16 17:44:32,050 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-03-16 17:44:32,051 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 16 treesize of output 15 [2025-03-16 17:44:32,084 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-03-16 17:44:32,085 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2025-03-16 17:44:32,161 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 22 [2025-03-16 17:44:32,179 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 27 treesize of output 15 [2025-03-16 17:44:32,319 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2025-03-16 17:44:32,319 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 31 [2025-03-16 17:44:32,327 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2025-03-16 17:44:32,330 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-03-16 17:44:32,500 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-03-16 17:44:32,613 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-16 17:44:32,623 INFO L349 Elim1Store]: treesize reduction 29, result has 14.7 percent of original size [2025-03-16 17:44:32,624 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 64 treesize of output 47 [2025-03-16 17:44:32,630 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-16 17:44:32,646 INFO L349 Elim1Store]: treesize reduction 68, result has 28.4 percent of original size [2025-03-16 17:44:32,646 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 45 treesize of output 40 [2025-03-16 17:44:32,665 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-16 17:44:32,677 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2025-03-16 17:44:32,677 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2025-03-16 17:44:33,264 INFO L349 Elim1Store]: treesize reduction 104, result has 20.6 percent of original size [2025-03-16 17:44:33,264 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 89 treesize of output 57 [2025-03-16 17:44:33,271 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-16 17:44:33,301 INFO L349 Elim1Store]: treesize reduction 180, result has 18.2 percent of original size [2025-03-16 17:44:33,301 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 62 treesize of output 61 [2025-03-16 17:44:33,316 INFO L349 Elim1Store]: treesize reduction 25, result has 45.7 percent of original size [2025-03-16 17:44:33,316 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 22 treesize of output 27 [2025-03-16 17:44:33,533 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 279 treesize of output 219 [2025-03-16 17:44:34,647 INFO L349 Elim1Store]: treesize reduction 48, result has 86.2 percent of original size [2025-03-16 17:44:34,647 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 12 new quantified variables, introduced 36 case distinctions, treesize of input 326 treesize of output 487 [2025-03-16 17:44:35,323 INFO L349 Elim1Store]: treesize reduction 80, result has 86.9 percent of original size [2025-03-16 17:44:35,323 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 12 select indices, 12 select index equivalence classes, 0 disjoint index pairs (out of 66 index pairs), introduced 12 new quantified variables, introduced 66 case distinctions, treesize of input 182 treesize of output 662