./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/list-simple/dll2n_append_equal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3061b6dc Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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.5.800.v20200727-1323.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/dll2n_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 3a59620f668b7c0725f940bc66e10441fbb56ee9b9fb687de4bd19a3f12eaeda --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-18 13:08:35,412 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-18 13:08:35,473 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-18 13:08:35,492 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-18 13:08:35,493 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-18 13:08:35,528 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-18 13:08:35,530 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-18 13:08:35,530 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-18 13:08:35,531 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-18 13:08:35,532 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-18 13:08:35,533 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-18 13:08:35,533 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-18 13:08:35,533 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-18 13:08:35,534 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-18 13:08:35,534 INFO L153 SettingsManager]: * Use SBE=true [2024-11-18 13:08:35,534 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-18 13:08:35,537 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-18 13:08:35,537 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-18 13:08:35,538 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-18 13:08:35,538 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-18 13:08:35,538 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-18 13:08:35,538 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-18 13:08:35,538 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-18 13:08:35,538 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-18 13:08:35,539 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-18 13:08:35,539 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-18 13:08:35,539 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-18 13:08:35,540 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-18 13:08:35,540 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-18 13:08:35,540 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-18 13:08:35,541 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-18 13:08:35,541 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-18 13:08:35,541 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-18 13:08:35,541 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-18 13:08:35,542 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-18 13:08:35,542 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-18 13:08:35,542 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-18 13:08:35,542 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-18 13:08:35,542 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-18 13:08:35,542 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-18 13:08:35,542 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-18 13:08:35,543 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-18 13:08:35,543 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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 -> 3a59620f668b7c0725f940bc66e10441fbb56ee9b9fb687de4bd19a3f12eaeda [2024-11-18 13:08:35,743 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-18 13:08:35,763 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-18 13:08:35,765 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-18 13:08:35,766 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-18 13:08:35,766 INFO L274 PluginConnector]: CDTParser initialized [2024-11-18 13:08:35,767 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-simple/dll2n_append_equal.i [2024-11-18 13:08:36,959 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-18 13:08:37,134 INFO L384 CDTParser]: Found 1 translation units. [2024-11-18 13:08:37,135 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/dll2n_append_equal.i [2024-11-18 13:08:37,147 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c6fa44c10/3508280f25c84bd4961dd6c5976e27f4/FLAG11799fb04 [2024-11-18 13:08:37,158 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c6fa44c10/3508280f25c84bd4961dd6c5976e27f4 [2024-11-18 13:08:37,160 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-18 13:08:37,161 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-18 13:08:37,162 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-18 13:08:37,162 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-18 13:08:37,166 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-18 13:08:37,167 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 01:08:37" (1/1) ... [2024-11-18 13:08:37,167 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2bc6b8cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:08:37, skipping insertion in model container [2024-11-18 13:08:37,169 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 01:08:37" (1/1) ... [2024-11-18 13:08:37,202 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-18 13:08:37,458 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/dll2n_append_equal.i[24333,24346] [2024-11-18 13:08:37,465 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-18 13:08:37,472 INFO L200 MainTranslator]: Completed pre-run [2024-11-18 13:08:37,506 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/dll2n_append_equal.i[24333,24346] [2024-11-18 13:08:37,511 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-18 13:08:37,577 INFO L204 MainTranslator]: Completed translation [2024-11-18 13:08:37,578 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:08:37 WrapperNode [2024-11-18 13:08:37,578 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-18 13:08:37,579 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-18 13:08:37,579 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-18 13:08:37,579 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-18 13:08:37,584 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:08:37" (1/1) ... [2024-11-18 13:08:37,599 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:08:37" (1/1) ... [2024-11-18 13:08:37,624 INFO L138 Inliner]: procedures = 127, calls = 37, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 124 [2024-11-18 13:08:37,625 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-18 13:08:37,625 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-18 13:08:37,625 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-18 13:08:37,626 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-18 13:08:37,634 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:08:37" (1/1) ... [2024-11-18 13:08:37,634 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:08:37" (1/1) ... [2024-11-18 13:08:37,636 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:08:37" (1/1) ... [2024-11-18 13:08:37,656 INFO L175 MemorySlicer]: Split 21 memory accesses to 3 slices as follows [2, 13, 6]. 62 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 0, 1]. The 9 writes are split as follows [0, 8, 1]. [2024-11-18 13:08:37,659 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:08:37" (1/1) ... [2024-11-18 13:08:37,659 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:08:37" (1/1) ... [2024-11-18 13:08:37,665 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:08:37" (1/1) ... [2024-11-18 13:08:37,667 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:08:37" (1/1) ... [2024-11-18 13:08:37,668 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:08:37" (1/1) ... [2024-11-18 13:08:37,669 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:08:37" (1/1) ... [2024-11-18 13:08:37,672 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-18 13:08:37,672 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-18 13:08:37,672 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-18 13:08:37,673 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-18 13:08:37,673 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:08:37" (1/1) ... [2024-11-18 13:08:37,682 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-18 13:08:37,691 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 13:08:37,704 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) [2024-11-18 13:08:37,706 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 [2024-11-18 13:08:37,739 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-18 13:08:37,739 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-18 13:08:37,739 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-18 13:08:37,739 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-18 13:08:37,740 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-18 13:08:37,740 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-18 13:08:37,740 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2024-11-18 13:08:37,740 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2024-11-18 13:08:37,740 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-18 13:08:37,741 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-18 13:08:37,741 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-18 13:08:37,741 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-18 13:08:37,741 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-18 13:08:37,742 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-18 13:08:37,742 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-18 13:08:37,742 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-18 13:08:37,742 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-18 13:08:37,742 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-18 13:08:37,742 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-11-18 13:08:37,742 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-11-18 13:08:37,742 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-11-18 13:08:37,742 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-18 13:08:37,743 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-18 13:08:37,743 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-18 13:08:37,743 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-18 13:08:37,743 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-18 13:08:37,848 INFO L238 CfgBuilder]: Building ICFG [2024-11-18 13:08:37,850 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-18 13:08:38,020 INFO L? ?]: Removed 45 outVars from TransFormulas that were not future-live. [2024-11-18 13:08:38,021 INFO L287 CfgBuilder]: Performing block encoding [2024-11-18 13:08:38,029 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-18 13:08:38,029 INFO L316 CfgBuilder]: Removed 4 assume(true) statements. [2024-11-18 13:08:38,030 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 01:08:38 BoogieIcfgContainer [2024-11-18 13:08:38,030 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-18 13:08:38,031 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-18 13:08:38,032 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-18 13:08:38,035 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-18 13:08:38,035 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 01:08:37" (1/3) ... [2024-11-18 13:08:38,036 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@131ddc98 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 01:08:38, skipping insertion in model container [2024-11-18 13:08:38,036 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:08:37" (2/3) ... [2024-11-18 13:08:38,036 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@131ddc98 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 01:08:38, skipping insertion in model container [2024-11-18 13:08:38,037 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 01:08:38" (3/3) ... [2024-11-18 13:08:38,037 INFO L112 eAbstractionObserver]: Analyzing ICFG dll2n_append_equal.i [2024-11-18 13:08:38,050 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-18 13:08:38,051 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-18 13:08:38,088 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-18 13:08:38,093 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;@4f18b09e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-18 13:08:38,093 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-18 13:08:38,102 INFO L276 IsEmpty]: Start isEmpty. Operand has 32 states, 27 states have (on average 1.5185185185185186) internal successors, (41), 28 states have internal predecessors, (41), 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) [2024-11-18 13:08:38,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-18 13:08:38,108 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 13:08:38,108 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 13:08:38,109 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 13:08:38,113 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 13:08:38,114 INFO L85 PathProgramCache]: Analyzing trace with hash 308507763, now seen corresponding path program 1 times [2024-11-18 13:08:38,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 13:08:38,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1007073344] [2024-11-18 13:08:38,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 13:08:38,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 13:08:38,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 13:08:38,288 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 13:08:38,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 13:08:38,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1007073344] [2024-11-18 13:08:38,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1007073344] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 13:08:38,290 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 13:08:38,290 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-18 13:08:38,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1057086049] [2024-11-18 13:08:38,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 13:08:38,295 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-18 13:08:38,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 13:08:38,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-18 13:08:38,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-18 13:08:38,320 INFO L87 Difference]: Start difference. First operand has 32 states, 27 states have (on average 1.5185185185185186) internal successors, (41), 28 states have internal predecessors, (41), 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 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 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) [2024-11-18 13:08:38,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 13:08:38,335 INFO L93 Difference]: Finished difference Result 57 states and 79 transitions. [2024-11-18 13:08:38,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-18 13:08:38,337 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 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 17 [2024-11-18 13:08:38,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 13:08:38,342 INFO L225 Difference]: With dead ends: 57 [2024-11-18 13:08:38,342 INFO L226 Difference]: Without dead ends: 26 [2024-11-18 13:08:38,344 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-18 13:08:38,347 INFO L432 NwaCegarLoop]: 40 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 13:08:38,347 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 13:08:38,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2024-11-18 13:08:38,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2024-11-18 13:08:38,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 22 states have internal predecessors, (28), 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) [2024-11-18 13:08:38,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 32 transitions. [2024-11-18 13:08:38,389 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 32 transitions. Word has length 17 [2024-11-18 13:08:38,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 13:08:38,389 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 32 transitions. [2024-11-18 13:08:38,389 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 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) [2024-11-18 13:08:38,390 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 32 transitions. [2024-11-18 13:08:38,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-18 13:08:38,391 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 13:08:38,392 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 13:08:38,392 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-18 13:08:38,392 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 13:08:38,393 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 13:08:38,393 INFO L85 PathProgramCache]: Analyzing trace with hash -2109805219, now seen corresponding path program 1 times [2024-11-18 13:08:38,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 13:08:38,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [928886402] [2024-11-18 13:08:38,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 13:08:38,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 13:08:38,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 13:08:38,559 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 13:08:38,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 13:08:38,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [928886402] [2024-11-18 13:08:38,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [928886402] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 13:08:38,563 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 13:08:38,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-18 13:08:38,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [13581285] [2024-11-18 13:08:38,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 13:08:38,564 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-18 13:08:38,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 13:08:38,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-18 13:08:38,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 13:08:38,565 INFO L87 Difference]: Start difference. First operand 26 states and 32 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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) [2024-11-18 13:08:38,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 13:08:38,578 INFO L93 Difference]: Finished difference Result 50 states and 62 transitions. [2024-11-18 13:08:38,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-18 13:08:38,578 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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 17 [2024-11-18 13:08:38,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 13:08:38,579 INFO L225 Difference]: With dead ends: 50 [2024-11-18 13:08:38,579 INFO L226 Difference]: Without dead ends: 31 [2024-11-18 13:08:38,579 INFO L431 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 [2024-11-18 13:08:38,580 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 4 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 13:08:38,580 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 57 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 13:08:38,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2024-11-18 13:08:38,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 27. [2024-11-18 13:08:38,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 23 states have internal predecessors, (29), 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) [2024-11-18 13:08:38,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 33 transitions. [2024-11-18 13:08:38,589 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 33 transitions. Word has length 17 [2024-11-18 13:08:38,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 13:08:38,589 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 33 transitions. [2024-11-18 13:08:38,590 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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) [2024-11-18 13:08:38,590 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 33 transitions. [2024-11-18 13:08:38,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-18 13:08:38,591 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 13:08:38,591 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 13:08:38,591 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-18 13:08:38,592 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 13:08:38,592 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 13:08:38,593 INFO L85 PathProgramCache]: Analyzing trace with hash 493100305, now seen corresponding path program 1 times [2024-11-18 13:08:38,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 13:08:38,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [297214767] [2024-11-18 13:08:38,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 13:08:38,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 13:08:38,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 13:08:38,690 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-18 13:08:38,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 13:08:38,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [297214767] [2024-11-18 13:08:38,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [297214767] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 13:08:38,691 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 13:08:38,691 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-18 13:08:38,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [200184085] [2024-11-18 13:08:38,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 13:08:38,692 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-18 13:08:38,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 13:08:38,693 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-18 13:08:38,693 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 13:08:38,694 INFO L87 Difference]: Start difference. First operand 27 states and 33 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 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) [2024-11-18 13:08:38,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 13:08:38,716 INFO L93 Difference]: Finished difference Result 54 states and 68 transitions. [2024-11-18 13:08:38,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-18 13:08:38,716 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 27 [2024-11-18 13:08:38,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 13:08:38,717 INFO L225 Difference]: With dead ends: 54 [2024-11-18 13:08:38,717 INFO L226 Difference]: Without dead ends: 30 [2024-11-18 13:08:38,718 INFO L431 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 [2024-11-18 13:08:38,719 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 0 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 13:08:38,720 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 55 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 13:08:38,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2024-11-18 13:08:38,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2024-11-18 13:08:38,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 25 states have (on average 1.24) internal successors, (31), 25 states have internal predecessors, (31), 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) [2024-11-18 13:08:38,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 37 transitions. [2024-11-18 13:08:38,727 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 37 transitions. Word has length 27 [2024-11-18 13:08:38,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 13:08:38,727 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 37 transitions. [2024-11-18 13:08:38,727 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 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) [2024-11-18 13:08:38,727 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 37 transitions. [2024-11-18 13:08:38,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-18 13:08:38,728 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 13:08:38,729 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 13:08:38,729 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-18 13:08:38,729 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 13:08:38,729 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 13:08:38,729 INFO L85 PathProgramCache]: Analyzing trace with hash -1095247597, now seen corresponding path program 1 times [2024-11-18 13:08:38,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 13:08:38,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1058810557] [2024-11-18 13:08:38,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 13:08:38,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 13:08:38,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 13:08:38,848 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-18 13:08:38,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 13:08:38,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1058810557] [2024-11-18 13:08:38,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1058810557] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 13:08:38,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [178095218] [2024-11-18 13:08:38,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 13:08:38,850 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 13:08:38,850 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 13:08:38,851 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) [2024-11-18 13:08:38,853 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-18 13:08:38,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 13:08:38,980 INFO L255 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-18 13:08:38,985 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 13:08:39,026 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 13:08:39,026 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-18 13:08:39,067 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-18 13:08:39,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [178095218] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-18 13:08:39,068 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-18 13:08:39,068 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2024-11-18 13:08:39,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1316919860] [2024-11-18 13:08:39,068 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-18 13:08:39,069 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-18 13:08:39,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 13:08:39,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-18 13:08:39,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-18 13:08:39,070 INFO L87 Difference]: Start difference. First operand 30 states and 37 transitions. Second operand has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 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) [2024-11-18 13:08:39,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 13:08:39,087 INFO L93 Difference]: Finished difference Result 51 states and 62 transitions. [2024-11-18 13:08:39,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-18 13:08:39,087 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 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 27 [2024-11-18 13:08:39,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 13:08:39,088 INFO L225 Difference]: With dead ends: 51 [2024-11-18 13:08:39,088 INFO L226 Difference]: Without dead ends: 32 [2024-11-18 13:08:39,088 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 51 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-18 13:08:39,089 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 4 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 13:08:39,089 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 82 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 13:08:39,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2024-11-18 13:08:39,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2024-11-18 13:08:39,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 27 states have internal predecessors, (33), 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) [2024-11-18 13:08:39,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 39 transitions. [2024-11-18 13:08:39,093 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 39 transitions. Word has length 27 [2024-11-18 13:08:39,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 13:08:39,093 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 39 transitions. [2024-11-18 13:08:39,093 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 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) [2024-11-18 13:08:39,093 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 39 transitions. [2024-11-18 13:08:39,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-18 13:08:39,094 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 13:08:39,094 INFO L215 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] [2024-11-18 13:08:39,107 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-18 13:08:39,294 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 13:08:39,295 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 13:08:39,295 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 13:08:39,295 INFO L85 PathProgramCache]: Analyzing trace with hash -292922041, now seen corresponding path program 1 times [2024-11-18 13:08:39,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 13:08:39,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1691977566] [2024-11-18 13:08:39,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 13:08:39,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 13:08:39,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 13:08:39,565 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-18 13:08:39,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 13:08:39,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1691977566] [2024-11-18 13:08:39,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1691977566] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 13:08:39,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [475867786] [2024-11-18 13:08:39,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 13:08:39,566 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 13:08:39,567 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 13:08:39,568 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) [2024-11-18 13:08:39,569 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-18 13:08:39,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 13:08:39,695 INFO L255 TraceCheckSpWp]: Trace formula consists of 377 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-11-18 13:08:39,697 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 13:08:39,926 INFO L349 Elim1Store]: treesize reduction 36, result has 52.0 percent of original size [2024-11-18 13:08:39,927 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 32 treesize of output 47 [2024-11-18 13:08:40,023 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-18 13:08:40,027 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 24 treesize of output 20 [2024-11-18 13:08:40,051 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-18 13:08:40,052 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-18 13:08:40,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [475867786] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 13:08:40,052 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-18 13:08:40,052 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [10] total 18 [2024-11-18 13:08:40,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1963952781] [2024-11-18 13:08:40,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 13:08:40,052 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-18 13:08:40,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 13:08:40,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-18 13:08:40,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=257, Unknown=0, NotChecked=0, Total=306 [2024-11-18 13:08:40,053 INFO L87 Difference]: Start difference. First operand 32 states and 39 transitions. Second operand has 16 states, 15 states have (on average 2.0) internal successors, (30), 13 states have internal predecessors, (30), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-18 13:08:44,077 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] [2024-11-18 13:08:48,088 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] [2024-11-18 13:08:52,107 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] [2024-11-18 13:08:56,141 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] [2024-11-18 13:09:00,167 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] [2024-11-18 13:09:00,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 13:09:00,284 INFO L93 Difference]: Finished difference Result 65 states and 78 transitions. [2024-11-18 13:09:00,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-18 13:09:00,284 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 2.0) internal successors, (30), 13 states have internal predecessors, (30), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 37 [2024-11-18 13:09:00,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 13:09:00,285 INFO L225 Difference]: With dead ends: 65 [2024-11-18 13:09:00,285 INFO L226 Difference]: Without dead ends: 41 [2024-11-18 13:09:00,286 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=358, Unknown=0, NotChecked=0, Total=420 [2024-11-18 13:09:00,287 INFO L432 NwaCegarLoop]: 23 mSDtfsCounter, 38 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 1 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 20.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 217 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 189 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 20.2s IncrementalHoareTripleChecker+Time [2024-11-18 13:09:00,288 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 217 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 189 Invalid, 5 Unknown, 0 Unchecked, 20.2s Time] [2024-11-18 13:09:00,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2024-11-18 13:09:00,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 38. [2024-11-18 13:09:00,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 32 states have (on average 1.15625) internal successors, (37), 32 states have internal predecessors, (37), 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) [2024-11-18 13:09:00,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 43 transitions. [2024-11-18 13:09:00,294 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 43 transitions. Word has length 37 [2024-11-18 13:09:00,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 13:09:00,294 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 43 transitions. [2024-11-18 13:09:00,294 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 2.0) internal successors, (30), 13 states have internal predecessors, (30), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-18 13:09:00,294 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 43 transitions. [2024-11-18 13:09:00,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-18 13:09:00,295 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 13:09:00,295 INFO L215 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] [2024-11-18 13:09:00,309 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-18 13:09:00,499 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 13:09:00,500 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 13:09:00,500 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 13:09:00,500 INFO L85 PathProgramCache]: Analyzing trace with hash -292920367, now seen corresponding path program 1 times [2024-11-18 13:09:00,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 13:09:00,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1997892126] [2024-11-18 13:09:00,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 13:09:00,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 13:09:00,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 13:09:00,712 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-18 13:09:00,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 13:09:00,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1997892126] [2024-11-18 13:09:00,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1997892126] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 13:09:00,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [30871656] [2024-11-18 13:09:00,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 13:09:00,713 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 13:09:00,713 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 13:09:00,715 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) [2024-11-18 13:09:00,715 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-18 13:09:00,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 13:09:00,832 INFO L255 TraceCheckSpWp]: Trace formula consists of 376 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-18 13:09:00,834 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 13:09:00,900 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 [2024-11-18 13:09:00,910 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 15 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-18 13:09:00,911 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-18 13:09:00,952 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-18 13:09:00,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [30871656] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-18 13:09:00,953 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-18 13:09:00,953 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 10] total 13 [2024-11-18 13:09:00,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [916747266] [2024-11-18 13:09:00,953 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-18 13:09:00,954 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-18 13:09:00,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 13:09:00,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-18 13:09:00,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2024-11-18 13:09:00,955 INFO L87 Difference]: Start difference. First operand 38 states and 43 transitions. Second operand has 13 states, 13 states have (on average 2.5384615384615383) internal successors, (33), 12 states have internal predecessors, (33), 3 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-18 13:09:04,971 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] [2024-11-18 13:09:08,981 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] [2024-11-18 13:09:13,007 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] [2024-11-18 13:09:17,024 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] [2024-11-18 13:09:17,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 13:09:17,112 INFO L93 Difference]: Finished difference Result 45 states and 51 transitions. [2024-11-18 13:09:17,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-18 13:09:17,113 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.5384615384615383) internal successors, (33), 12 states have internal predecessors, (33), 3 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) Word has length 37 [2024-11-18 13:09:17,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 13:09:17,114 INFO L225 Difference]: With dead ends: 45 [2024-11-18 13:09:17,114 INFO L226 Difference]: Without dead ends: 38 [2024-11-18 13:09:17,114 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 70 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=256, Unknown=0, NotChecked=0, Total=306 [2024-11-18 13:09:17,115 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 17 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 0 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 221 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 16.1s IncrementalHoareTripleChecker+Time [2024-11-18 13:09:17,115 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 221 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 121 Invalid, 4 Unknown, 0 Unchecked, 16.1s Time] [2024-11-18 13:09:17,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2024-11-18 13:09:17,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2024-11-18 13:09:17,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 32 states have (on average 1.125) internal successors, (36), 32 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) [2024-11-18 13:09:17,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 42 transitions. [2024-11-18 13:09:17,122 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 42 transitions. Word has length 37 [2024-11-18 13:09:17,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 13:09:17,122 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 42 transitions. [2024-11-18 13:09:17,122 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.5384615384615383) internal successors, (33), 12 states have internal predecessors, (33), 3 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-18 13:09:17,122 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 42 transitions. [2024-11-18 13:09:17,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-18 13:09:17,125 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 13:09:17,125 INFO L215 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, 1, 1, 1] [2024-11-18 13:09:17,140 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-18 13:09:17,325 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 13:09:17,326 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 13:09:17,326 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 13:09:17,327 INFO L85 PathProgramCache]: Analyzing trace with hash -1499729763, now seen corresponding path program 1 times [2024-11-18 13:09:17,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 13:09:17,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [638558719] [2024-11-18 13:09:17,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 13:09:17,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 13:09:17,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 13:09:18,537 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 10 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 13:09:18,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 13:09:18,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [638558719] [2024-11-18 13:09:18,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [638558719] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 13:09:18,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [256325749] [2024-11-18 13:09:18,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 13:09:18,538 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 13:09:18,538 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 13:09:18,539 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) [2024-11-18 13:09:18,540 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-18 13:09:18,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 13:09:18,846 INFO L255 TraceCheckSpWp]: Trace formula consists of 395 conjuncts, 100 conjuncts are in the unsatisfiable core [2024-11-18 13:09:18,851 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 13:09:18,895 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 [2024-11-18 13:09:19,124 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-18 13:09:19,124 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 [2024-11-18 13:09:19,188 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 7 [2024-11-18 13:09:19,242 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-18 13:09:19,498 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 [2024-11-18 13:09:19,502 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 [2024-11-18 13:09:19,655 INFO L349 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2024-11-18 13:09:19,655 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 20 treesize of output 22 [2024-11-18 13:09:19,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 20 treesize of output 15 [2024-11-18 13:09:19,895 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 34 [2024-11-18 13:09:19,898 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 [2024-11-18 13:09:19,957 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 [2024-11-18 13:09:20,025 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 10 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 13:09:20,025 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-18 13:09:23,502 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_734 (Array Int Int)) (v_ArrVal_736 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|))) (store |c_#memory_int#1| .cse0 (store (select |c_#memory_int#1| .cse0) (+ (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 4) v_ArrVal_736))) |c_ULTIMATE.start_dll_append_#t~ret7#1.base| v_ArrVal_734) (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|)))) is different from false [2024-11-18 13:09:23,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [256325749] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 13:09:23,582 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-18 13:09:23,582 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 47 [2024-11-18 13:09:23,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [282819247] [2024-11-18 13:09:23,582 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-18 13:09:23,583 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2024-11-18 13:09:23,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 13:09:23,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2024-11-18 13:09:23,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=164, Invalid=2267, Unknown=23, NotChecked=96, Total=2550 [2024-11-18 13:09:23,584 INFO L87 Difference]: Start difference. First operand 38 states and 42 transitions. Second operand has 47 states, 45 states have (on average 1.3777777777777778) internal successors, (62), 38 states have internal predecessors, (62), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-18 13:09:24,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 13:09:24,364 INFO L93 Difference]: Finished difference Result 54 states and 61 transitions. [2024-11-18 13:09:24,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-11-18 13:09:24,365 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 45 states have (on average 1.3777777777777778) internal successors, (62), 38 states have internal predecessors, (62), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 40 [2024-11-18 13:09:24,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 13:09:24,365 INFO L225 Difference]: With dead ends: 54 [2024-11-18 13:09:24,365 INFO L226 Difference]: Without dead ends: 52 [2024-11-18 13:09:24,367 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1004 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=291, Invalid=3722, Unknown=23, NotChecked=124, Total=4160 [2024-11-18 13:09:24,368 INFO L432 NwaCegarLoop]: 18 mSDtfsCounter, 36 mSDsluCounter, 232 mSDsCounter, 0 mSdLazyCounter, 610 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 250 SdHoareTripleChecker+Invalid, 616 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 610 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-18 13:09:24,368 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 250 Invalid, 616 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 610 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-18 13:09:24,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2024-11-18 13:09:24,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 44. [2024-11-18 13:09:24,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 38 states have (on average 1.131578947368421) internal successors, (43), 38 states have internal predecessors, (43), 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) [2024-11-18 13:09:24,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 49 transitions. [2024-11-18 13:09:24,373 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 49 transitions. Word has length 40 [2024-11-18 13:09:24,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 13:09:24,373 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 49 transitions. [2024-11-18 13:09:24,373 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 45 states have (on average 1.3777777777777778) internal successors, (62), 38 states have internal predecessors, (62), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-18 13:09:24,374 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 49 transitions. [2024-11-18 13:09:24,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-18 13:09:24,374 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 13:09:24,374 INFO L215 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, 1, 1, 1, 1, 1] [2024-11-18 13:09:24,390 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-18 13:09:24,575 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 13:09:24,575 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 13:09:24,575 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 13:09:24,575 INFO L85 PathProgramCache]: Analyzing trace with hash 1868742190, now seen corresponding path program 1 times [2024-11-18 13:09:24,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 13:09:24,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1559064366] [2024-11-18 13:09:24,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 13:09:24,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 13:09:24,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 13:09:25,384 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 6 proven. 16 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-18 13:09:25,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 13:09:25,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1559064366] [2024-11-18 13:09:25,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1559064366] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 13:09:25,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [451523497] [2024-11-18 13:09:25,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 13:09:25,385 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 13:09:25,385 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 13:09:25,387 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) [2024-11-18 13:09:25,388 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-18 13:09:25,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 13:09:25,509 INFO L255 TraceCheckSpWp]: Trace formula consists of 407 conjuncts, 69 conjuncts are in the unsatisfiable core [2024-11-18 13:09:25,511 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 13:09:25,515 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 [2024-11-18 13:09:25,597 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-18 13:09:25,597 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 [2024-11-18 13:09:25,631 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-18 13:09:25,664 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-18 13:09:25,664 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 52 treesize of output 49 [2024-11-18 13:09:25,811 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 18 [2024-11-18 13:09:25,814 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 [2024-11-18 13:09:25,860 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-18 13:09:25,861 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 68 treesize of output 51 [2024-11-18 13:09:25,874 INFO L349 Elim1Store]: treesize reduction 8, result has 77.1 percent of original size [2024-11-18 13:09:25,874 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 34 treesize of output 36 [2024-11-18 13:09:26,080 INFO L349 Elim1Store]: treesize reduction 71, result has 19.3 percent of original size [2024-11-18 13:09:26,080 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 86 treesize of output 54 [2024-11-18 13:09:26,095 INFO L349 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2024-11-18 13:09:26,095 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 99 treesize of output 93 [2024-11-18 13:09:26,101 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 27 [2024-11-18 13:09:26,129 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 32 [2024-11-18 13:09:26,132 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 24 [2024-11-18 13:09:26,165 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 12 [2024-11-18 13:09:26,188 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 6 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 13:09:26,188 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-18 13:09:26,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [451523497] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 13:09:26,566 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-18 13:09:26,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 26] total 38 [2024-11-18 13:09:26,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [361222238] [2024-11-18 13:09:26,567 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-18 13:09:26,567 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2024-11-18 13:09:26,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 13:09:26,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2024-11-18 13:09:26,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=1855, Unknown=2, NotChecked=0, Total=1980 [2024-11-18 13:09:26,568 INFO L87 Difference]: Start difference. First operand 44 states and 49 transitions. Second operand has 38 states, 36 states have (on average 1.5833333333333333) internal successors, (57), 32 states have internal predecessors, (57), 4 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2024-11-18 13:09:27,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 13:09:27,595 INFO L93 Difference]: Finished difference Result 59 states and 67 transitions. [2024-11-18 13:09:27,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-11-18 13:09:27,596 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 36 states have (on average 1.5833333333333333) internal successors, (57), 32 states have internal predecessors, (57), 4 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) Word has length 42 [2024-11-18 13:09:27,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 13:09:27,596 INFO L225 Difference]: With dead ends: 59 [2024-11-18 13:09:27,596 INFO L226 Difference]: Without dead ends: 50 [2024-11-18 13:09:27,597 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 486 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=291, Invalid=3739, Unknown=2, NotChecked=0, Total=4032 [2024-11-18 13:09:27,598 INFO L432 NwaCegarLoop]: 19 mSDtfsCounter, 35 mSDsluCounter, 368 mSDsCounter, 0 mSdLazyCounter, 865 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 387 SdHoareTripleChecker+Invalid, 874 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 865 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-18 13:09:27,598 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 387 Invalid, 874 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 865 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-18 13:09:27,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2024-11-18 13:09:27,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 42. [2024-11-18 13:09:27,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 36 states have (on average 1.1388888888888888) internal successors, (41), 36 states have internal predecessors, (41), 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) [2024-11-18 13:09:27,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 47 transitions. [2024-11-18 13:09:27,605 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 47 transitions. Word has length 42 [2024-11-18 13:09:27,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 13:09:27,605 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 47 transitions. [2024-11-18 13:09:27,606 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 36 states have (on average 1.5833333333333333) internal successors, (57), 32 states have internal predecessors, (57), 4 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2024-11-18 13:09:27,606 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 47 transitions. [2024-11-18 13:09:27,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-18 13:09:27,607 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 13:09:27,608 INFO L215 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, 1, 1, 1, 1, 1] [2024-11-18 13:09:27,620 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-11-18 13:09:27,808 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 13:09:27,808 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 13:09:27,809 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 13:09:27,809 INFO L85 PathProgramCache]: Analyzing trace with hash 1422189688, now seen corresponding path program 1 times [2024-11-18 13:09:27,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 13:09:27,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [610865482] [2024-11-18 13:09:27,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 13:09:27,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 13:09:27,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 13:09:29,242 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 10 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 13:09:29,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 13:09:29,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [610865482] [2024-11-18 13:09:29,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [610865482] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 13:09:29,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [811201664] [2024-11-18 13:09:29,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 13:09:29,243 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 13:09:29,243 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 13:09:29,245 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) [2024-11-18 13:09:29,254 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-18 13:09:29,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 13:09:29,572 INFO L255 TraceCheckSpWp]: Trace formula consists of 404 conjuncts, 105 conjuncts are in the unsatisfiable core [2024-11-18 13:09:29,581 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 13:09:29,621 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 [2024-11-18 13:09:29,858 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-18 13:09:29,859 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 [2024-11-18 13:09:29,917 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 7 [2024-11-18 13:09:29,926 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 [2024-11-18 13:09:29,987 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-18 13:09:29,987 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2024-11-18 13:09:29,992 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2024-11-18 13:09:30,204 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 [2024-11-18 13:09:30,207 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 [2024-11-18 13:09:30,210 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 [2024-11-18 13:09:30,390 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-18 13:09:30,391 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 [2024-11-18 13:09:30,404 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2024-11-18 13:09:30,404 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 [2024-11-18 13:09:30,411 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 [2024-11-18 13:09:30,668 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 [2024-11-18 13:09:30,774 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 15 [2024-11-18 13:09:30,828 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 [2024-11-18 13:09:30,895 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 10 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 13:09:30,895 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-18 13:09:31,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [811201664] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 13:09:31,311 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-18 13:09:31,311 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 27] total 52 [2024-11-18 13:09:31,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [959679717] [2024-11-18 13:09:31,312 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-18 13:09:31,312 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2024-11-18 13:09:31,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 13:09:31,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2024-11-18 13:09:31,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=2945, Unknown=76, NotChecked=0, Total=3192 [2024-11-18 13:09:31,314 INFO L87 Difference]: Start difference. First operand 42 states and 47 transitions. Second operand has 52 states, 50 states have (on average 1.4) internal successors, (70), 43 states have internal predecessors, (70), 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) [2024-11-18 13:09:32,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 13:09:32,756 INFO L93 Difference]: Finished difference Result 59 states and 67 transitions. [2024-11-18 13:09:32,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-11-18 13:09:32,757 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 50 states have (on average 1.4) internal successors, (70), 43 states have internal predecessors, (70), 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 42 [2024-11-18 13:09:32,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 13:09:32,758 INFO L225 Difference]: With dead ends: 59 [2024-11-18 13:09:32,758 INFO L226 Difference]: Without dead ends: 57 [2024-11-18 13:09:32,759 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1340 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=371, Invalid=5712, Unknown=79, NotChecked=0, Total=6162 [2024-11-18 13:09:32,759 INFO L432 NwaCegarLoop]: 18 mSDtfsCounter, 26 mSDsluCounter, 366 mSDsCounter, 0 mSdLazyCounter, 929 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 384 SdHoareTripleChecker+Invalid, 936 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 929 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-18 13:09:32,760 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 384 Invalid, 936 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 929 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-18 13:09:32,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2024-11-18 13:09:32,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 48. [2024-11-18 13:09:32,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 42 states have (on average 1.1428571428571428) internal successors, (48), 42 states have internal predecessors, (48), 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) [2024-11-18 13:09:32,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 54 transitions. [2024-11-18 13:09:32,766 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 54 transitions. Word has length 42 [2024-11-18 13:09:32,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 13:09:32,766 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 54 transitions. [2024-11-18 13:09:32,766 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 50 states have (on average 1.4) internal successors, (70), 43 states have internal predecessors, (70), 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) [2024-11-18 13:09:32,766 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 54 transitions. [2024-11-18 13:09:32,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-18 13:09:32,767 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 13:09:32,767 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 13:09:32,781 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-18 13:09:32,967 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 13:09:32,968 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 13:09:32,968 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 13:09:32,968 INFO L85 PathProgramCache]: Analyzing trace with hash 924724691, now seen corresponding path program 1 times [2024-11-18 13:09:32,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 13:09:32,968 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1235617062] [2024-11-18 13:09:32,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 13:09:32,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 13:09:33,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 13:09:34,714 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 3 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 13:09:34,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 13:09:34,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1235617062] [2024-11-18 13:09:34,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1235617062] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 13:09:34,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1617898447] [2024-11-18 13:09:34,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 13:09:34,715 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 13:09:34,715 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 13:09:34,717 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) [2024-11-18 13:09:34,719 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-18 13:09:35,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 13:09:35,045 INFO L255 TraceCheckSpWp]: Trace formula consists of 415 conjuncts, 163 conjuncts are in the unsatisfiable core [2024-11-18 13:09:35,050 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 13:09:35,087 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 [2024-11-18 13:09:35,095 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 [2024-11-18 13:09:35,151 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 11 [2024-11-18 13:09:39,290 WARN L851 $PredicateComparison]: unable to prove that (and (or (exists ((|v_#memory_int#1_BEFORE_CALL_6| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_#memory_int#1_BEFORE_CALL_6| |c_#memory_int#1|))) (and (= (select (select |v_#memory_int#1_BEFORE_CALL_6| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 0) 1) (= |c_#memory_int#1| (store |v_#memory_int#1_BEFORE_CALL_6| .cse0 (select |c_#memory_int#1| .cse0))) (= |c_ULTIMATE.start_dll_create_#t~ret4#1.base| .cse0)))) (= (select (select |c_#memory_int#1| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 0) 1)) (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_#t~ret4#1.base|) 1) (= |c_ULTIMATE.start_dll_create_#t~ret4#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_old(#valid)_AFTER_CALL_19| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_19| |c_ULTIMATE.start_dll_create_#t~ret4#1.base|) 0) (= |c_#valid| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_19| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_19| .cse1 (select |c_#valid| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_19| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1)))) is different from false [2024-11-18 13:09:39,293 WARN L873 $PredicateComparison]: unable to prove that (and (or (exists ((|v_#memory_int#1_BEFORE_CALL_6| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_#memory_int#1_BEFORE_CALL_6| |c_#memory_int#1|))) (and (= (select (select |v_#memory_int#1_BEFORE_CALL_6| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 0) 1) (= |c_#memory_int#1| (store |v_#memory_int#1_BEFORE_CALL_6| .cse0 (select |c_#memory_int#1| .cse0))) (= |c_ULTIMATE.start_dll_create_#t~ret4#1.base| .cse0)))) (= (select (select |c_#memory_int#1| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 0) 1)) (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_#t~ret4#1.base|) 1) (= |c_ULTIMATE.start_dll_create_#t~ret4#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_old(#valid)_AFTER_CALL_19| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_19| |c_ULTIMATE.start_dll_create_#t~ret4#1.base|) 0) (= |c_#valid| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_19| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_19| .cse1 (select |c_#valid| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_19| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1)))) is different from true [2024-11-18 13:09:39,307 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 [2024-11-18 13:09:39,339 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-18 13:09:39,339 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 [2024-11-18 13:09:39,347 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 [2024-11-18 13:09:39,355 WARN L851 $PredicateComparison]: unable to prove that (and (or (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|) (= (select (select |c_#memory_int#1| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 0) 1) (exists ((|v_#memory_int#1_188| (Array Int (Array Int Int)))) (and (= |c_#memory_int#1| (store |v_#memory_int#1_188| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (select |c_#memory_int#1| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))) (exists ((|v_#memory_int#1_BEFORE_CALL_6| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_#memory_int#1_BEFORE_CALL_6| |v_#memory_int#1_188|))) (and (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse0) (= (select (select |v_#memory_int#1_BEFORE_CALL_6| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 0) 1) (= |v_#memory_int#1_188| (store |v_#memory_int#1_BEFORE_CALL_6| .cse0 (select |v_#memory_int#1_188| .cse0))))))))) (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| 0) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_old(#valid)_AFTER_CALL_19| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_19| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 0) (= |c_#valid| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_19| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_19| .cse1 (select |c_#valid| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_19| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1))) (= (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4) |c_ULTIMATE.start_dll_create_~head~0#1.base|) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4) 0)) is different from false [2024-11-18 13:09:39,358 WARN L873 $PredicateComparison]: unable to prove that (and (or (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|) (= (select (select |c_#memory_int#1| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 0) 1) (exists ((|v_#memory_int#1_188| (Array Int (Array Int Int)))) (and (= |c_#memory_int#1| (store |v_#memory_int#1_188| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (select |c_#memory_int#1| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))) (exists ((|v_#memory_int#1_BEFORE_CALL_6| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_#memory_int#1_BEFORE_CALL_6| |v_#memory_int#1_188|))) (and (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse0) (= (select (select |v_#memory_int#1_BEFORE_CALL_6| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 0) 1) (= |v_#memory_int#1_188| (store |v_#memory_int#1_BEFORE_CALL_6| .cse0 (select |v_#memory_int#1_188| .cse0))))))))) (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| 0) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_old(#valid)_AFTER_CALL_19| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_19| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 0) (= |c_#valid| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_19| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_19| .cse1 (select |c_#valid| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_19| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1))) (= (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4) |c_ULTIMATE.start_dll_create_~head~0#1.base|) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4) 0)) is different from true [2024-11-18 13:09:39,389 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-18 13:09:39,390 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 133 treesize of output 116 [2024-11-18 13:09:39,403 INFO L349 Elim1Store]: treesize reduction 21, result has 38.2 percent of original size [2024-11-18 13:09:39,404 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 24 treesize of output 19 [2024-11-18 13:09:39,423 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 47 treesize of output 23 [2024-11-18 13:09:39,432 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4))) (let ((.cse0 (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse2))) (and (or .cse0 (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4) 0)) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_19| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_19| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 0) (= |c_#valid| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_19| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_19| .cse1 (select |c_#valid| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_19| .cse2) 1))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (= |c_ULTIMATE.start_main_~data~0#1| 1) (or (= (select (select |c_#memory_int#1| .cse2) 0) 1) .cse0) (not (= .cse2 0))))) is different from false [2024-11-18 13:09:39,434 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4))) (let ((.cse0 (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse2))) (and (or .cse0 (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4) 0)) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_19| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_19| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 0) (= |c_#valid| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_19| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_19| .cse1 (select |c_#valid| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_19| .cse2) 1))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (= |c_ULTIMATE.start_main_~data~0#1| 1) (or (= (select (select |c_#memory_int#1| .cse2) 0) 1) .cse0) (not (= .cse2 0))))) is different from true [2024-11-18 13:09:39,462 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4))) (let ((.cse0 (= .cse1 |c_ULTIMATE.start_dll_create_~head~0#1.base|))) (and (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (or .cse0 (= (select (select |c_#memory_int#1| .cse1) 0) 1)) (or .cse0 (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4) 0)) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_old(#valid)_AFTER_CALL_19| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_19| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 0) (= |c_#valid| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_19| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_19| .cse2 (select |c_#valid| .cse2)))) (= (select |v_old(#valid)_AFTER_CALL_19| .cse1) 1))) (not (= .cse1 0)) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1)))) is different from false [2024-11-18 13:09:39,463 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4))) (let ((.cse0 (= .cse1 |c_ULTIMATE.start_dll_create_~head~0#1.base|))) (and (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (or .cse0 (= (select (select |c_#memory_int#1| .cse1) 0) 1)) (or .cse0 (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4) 0)) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_old(#valid)_AFTER_CALL_19| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_19| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 0) (= |c_#valid| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_19| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_19| .cse2 (select |c_#valid| .cse2)))) (= (select |v_old(#valid)_AFTER_CALL_19| .cse1) 1))) (not (= .cse1 0)) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1)))) is different from true [2024-11-18 13:09:39,514 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_#res#1.base|) 4))) (let ((.cse1 (= .cse0 |c_ULTIMATE.start_dll_create_#res#1.base|))) (and (= (select |c_#valid| |c_ULTIMATE.start_dll_create_#res#1.base|) 1) (not (= .cse0 0)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (or (= (select (select |c_#memory_int#1| .cse0) 0) 1) .cse1) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_old(#valid)_AFTER_CALL_19| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_19| |c_ULTIMATE.start_dll_create_#res#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_19| .cse0) 1) (= |c_#valid| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_19| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_19| .cse2 (select |c_#valid| .cse2)))))) (= |c_ULTIMATE.start_dll_create_#res#1.offset| 0) (or (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_#res#1.base|) 4) 0) .cse1)))) is different from false [2024-11-18 13:09:39,515 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_#res#1.base|) 4))) (let ((.cse1 (= .cse0 |c_ULTIMATE.start_dll_create_#res#1.base|))) (and (= (select |c_#valid| |c_ULTIMATE.start_dll_create_#res#1.base|) 1) (not (= .cse0 0)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (or (= (select (select |c_#memory_int#1| .cse0) 0) 1) .cse1) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_old(#valid)_AFTER_CALL_19| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_19| |c_ULTIMATE.start_dll_create_#res#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_19| .cse0) 1) (= |c_#valid| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_19| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_19| .cse2 (select |c_#valid| .cse2)))))) (= |c_ULTIMATE.start_dll_create_#res#1.offset| 0) (or (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_#res#1.base|) 4) 0) .cse1)))) is different from true [2024-11-18 13:09:39,545 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (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| .cse2) 4))) (let ((.cse1 (= .cse0 .cse2))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |c_ULTIMATE.start_dll_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= .cse0 0)) (or (= (select (select |c_#memory_int#1| .cse0) 0) 1) .cse1) (= (select |c_#valid| .cse2) 1) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (or (= (select (select |c_#memory_$Pointer$#1.offset| .cse2) 4) 0) .cse1) (exists ((|v_old(#valid)_AFTER_CALL_19| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_19| .cse2) 0) (= (select |v_old(#valid)_AFTER_CALL_19| .cse0) 1) (= |c_#valid| (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_19| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_19| .cse3 (select |c_#valid| .cse3)))))) (= |c_ULTIMATE.start_dll_append_~head#1.offset| 0))))) is different from false [2024-11-18 13:09:39,547 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse2 (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| .cse2) 4))) (let ((.cse1 (= .cse0 .cse2))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |c_ULTIMATE.start_dll_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= .cse0 0)) (or (= (select (select |c_#memory_int#1| .cse0) 0) 1) .cse1) (= (select |c_#valid| .cse2) 1) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (or (= (select (select |c_#memory_$Pointer$#1.offset| .cse2) 4) 0) .cse1) (exists ((|v_old(#valid)_AFTER_CALL_19| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_19| .cse2) 0) (= (select |v_old(#valid)_AFTER_CALL_19| .cse0) 1) (= |c_#valid| (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_19| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_19| .cse3 (select |c_#valid| .cse3)))))) (= |c_ULTIMATE.start_dll_append_~head#1.offset| 0))))) is different from true [2024-11-18 13:09:39,570 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 44 [2024-11-18 13:09:39,574 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 15 treesize of output 11 [2024-11-18 13:09:39,578 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 [2024-11-18 13:09:39,603 WARN L851 $PredicateComparison]: unable to prove that (and (= |c_#memory_int#1| |c_old(#memory_int#1)|) (= |c_#valid| |c_old(#valid)|) (= |c_#memory_$Pointer$#1.offset| |c_old(#memory_$Pointer$#1.offset)|) (exists ((v_arrayElimCell_58 Int) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_15| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_19| (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (not (= v_arrayElimCell_58 0)) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_19| v_arrayElimCell_58) 1) (= (select |v_old(#valid)_AFTER_CALL_19| .cse0) 0) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_19| |v_#valid_BEFORE_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_19| .cse1 (select |v_#valid_BEFORE_CALL_15| .cse1))) |v_#valid_BEFORE_CALL_15|) (= (select |v_#valid_BEFORE_CALL_15| .cse0) 1)))) (= |c_#memory_$Pointer$#1.base| |c_old(#memory_$Pointer$#1.base)|)) is different from false [2024-11-18 13:09:39,605 WARN L873 $PredicateComparison]: unable to prove that (and (= |c_#memory_int#1| |c_old(#memory_int#1)|) (= |c_#valid| |c_old(#valid)|) (= |c_#memory_$Pointer$#1.offset| |c_old(#memory_$Pointer$#1.offset)|) (exists ((v_arrayElimCell_58 Int) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_15| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_19| (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (not (= v_arrayElimCell_58 0)) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_19| v_arrayElimCell_58) 1) (= (select |v_old(#valid)_AFTER_CALL_19| .cse0) 0) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_19| |v_#valid_BEFORE_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_19| .cse1 (select |v_#valid_BEFORE_CALL_15| .cse1))) |v_#valid_BEFORE_CALL_15|) (= (select |v_#valid_BEFORE_CALL_15| .cse0) 1)))) (= |c_#memory_$Pointer$#1.base| |c_old(#memory_$Pointer$#1.base)|)) is different from true [2024-11-18 13:09:39,630 WARN L851 $PredicateComparison]: unable to prove that (and (= |c_#memory_int#1| |c_old(#memory_int#1)|) (= |c_#memory_$Pointer$#1.offset| |c_old(#memory_$Pointer$#1.offset)|) (exists ((v_arrayElimCell_58 Int) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_15| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_19| (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (not (= v_arrayElimCell_58 0)) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_19| v_arrayElimCell_58) 1) (= (select |v_old(#valid)_AFTER_CALL_19| .cse0) 0) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_19| |v_#valid_BEFORE_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_19| .cse1 (select |v_#valid_BEFORE_CALL_15| .cse1))) |v_#valid_BEFORE_CALL_15|) (= (select |v_#valid_BEFORE_CALL_15| .cse0) 1)))) (= |c_node_create_~temp~0#1.offset| 0) (= (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 [2024-11-18 13:09:39,632 WARN L873 $PredicateComparison]: unable to prove that (and (= |c_#memory_int#1| |c_old(#memory_int#1)|) (= |c_#memory_$Pointer$#1.offset| |c_old(#memory_$Pointer$#1.offset)|) (exists ((v_arrayElimCell_58 Int) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_15| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_19| (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (not (= v_arrayElimCell_58 0)) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_19| v_arrayElimCell_58) 1) (= (select |v_old(#valid)_AFTER_CALL_19| .cse0) 0) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_19| |v_#valid_BEFORE_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_19| .cse1 (select |v_#valid_BEFORE_CALL_15| .cse1))) |v_#valid_BEFORE_CALL_15|) (= (select |v_#valid_BEFORE_CALL_15| .cse0) 1)))) (= |c_node_create_~temp~0#1.offset| 0) (= (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 [2024-11-18 13:09:39,687 WARN L851 $PredicateComparison]: unable to prove that (and (= |c_node_create_#res#1.offset| 0) (= (select |c_old(#valid)| |c_node_create_#res#1.base|) 0) (= |c_#memory_int#1| (store |c_old(#memory_int#1)| |c_node_create_#res#1.base| (select |c_#memory_int#1| |c_node_create_#res#1.base|))) (exists ((v_arrayElimCell_58 Int) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_15| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_19| (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (not (= v_arrayElimCell_58 0)) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_19| v_arrayElimCell_58) 1) (= (select |v_old(#valid)_AFTER_CALL_19| .cse0) 0) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_19| |v_#valid_BEFORE_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_19| .cse1 (select |v_#valid_BEFORE_CALL_15| .cse1))) |v_#valid_BEFORE_CALL_15|) (= (select |v_#valid_BEFORE_CALL_15| .cse0) 1)))) (= |c_#memory_$Pointer$#1.base| (store |c_old(#memory_$Pointer$#1.base)| |c_node_create_#res#1.base| (select |c_#memory_$Pointer$#1.base| |c_node_create_#res#1.base|))) (= |c_#memory_$Pointer$#1.offset| (store |c_old(#memory_$Pointer$#1.offset)| |c_node_create_#res#1.base| (select |c_#memory_$Pointer$#1.offset| |c_node_create_#res#1.base|)))) is different from false [2024-11-18 13:09:39,690 WARN L873 $PredicateComparison]: unable to prove that (and (= |c_node_create_#res#1.offset| 0) (= (select |c_old(#valid)| |c_node_create_#res#1.base|) 0) (= |c_#memory_int#1| (store |c_old(#memory_int#1)| |c_node_create_#res#1.base| (select |c_#memory_int#1| |c_node_create_#res#1.base|))) (exists ((v_arrayElimCell_58 Int) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_15| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_19| (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (not (= v_arrayElimCell_58 0)) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_19| v_arrayElimCell_58) 1) (= (select |v_old(#valid)_AFTER_CALL_19| .cse0) 0) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_19| |v_#valid_BEFORE_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_19| .cse1 (select |v_#valid_BEFORE_CALL_15| .cse1))) |v_#valid_BEFORE_CALL_15|) (= (select |v_#valid_BEFORE_CALL_15| .cse0) 1)))) (= |c_#memory_$Pointer$#1.base| (store |c_old(#memory_$Pointer$#1.base)| |c_node_create_#res#1.base| (select |c_#memory_$Pointer$#1.base| |c_node_create_#res#1.base|))) (= |c_#memory_$Pointer$#1.offset| (store |c_old(#memory_$Pointer$#1.offset)| |c_node_create_#res#1.base| (select |c_#memory_$Pointer$#1.offset| |c_node_create_#res#1.base|)))) is different from true [2024-11-18 13:09:39,743 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-18 13:09:39,744 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 92 treesize of output 63 [2024-11-18 13:09:39,759 INFO L349 Elim1Store]: treesize reduction 29, result has 46.3 percent of original size [2024-11-18 13:09:39,759 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 40 treesize of output 47 [2024-11-18 13:09:39,791 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2024-11-18 13:09:39,791 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 39 [2024-11-18 13:09:39,828 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))) (let ((.cse3 (= .cse0 .cse1))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |c_ULTIMATE.start_dll_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= .cse0 0)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_20| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_19| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_20| .cse1) 1) (= (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_19| |v_old(#valid)_AFTER_CALL_20|))) (store |v_old(#valid)_AFTER_CALL_19| .cse2 (select |v_old(#valid)_AFTER_CALL_20| .cse2))) |v_old(#valid)_AFTER_CALL_20|) (= (select |v_old(#valid)_AFTER_CALL_19| .cse1) 0) (= (select |v_old(#valid)_AFTER_CALL_19| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_20| |c_ULTIMATE.start_dll_append_#t~ret7#1.base|) 0))) (= |c_ULTIMATE.start_dll_append_#t~ret7#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (or (= |c_ULTIMATE.start_dll_append_#t~ret7#1.base| .cse0) (= (select (select |c_#memory_int#1| .cse0) 0) 1) .cse3) (exists ((|v_old(#valid)_AFTER_CALL_21| (Array Int Int)) (v_arrayElimCell_58 Int) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_15| (Array Int Int))) (let ((.cse4 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (not (= v_arrayElimCell_58 0)) (= (select |v_old(#valid)_AFTER_CALL_21| .cse4) 0) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_21| v_arrayElimCell_58) 1) (= |v_#valid_BEFORE_CALL_15| (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_21| |v_#valid_BEFORE_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_21| .cse5 (select |v_#valid_BEFORE_CALL_15| .cse5)))) (= (select |v_#valid_BEFORE_CALL_15| .cse4) 1)))) (or (= (select (select |c_#memory_$Pointer$#1.offset| .cse1) 4) 0) (= |c_ULTIMATE.start_dll_append_#t~ret7#1.base| .cse1) .cse3) (= |c_ULTIMATE.start_dll_append_~head#1.offset| 0))))) is different from false [2024-11-18 13:09:39,831 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))) (let ((.cse3 (= .cse0 .cse1))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |c_ULTIMATE.start_dll_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= .cse0 0)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_20| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_19| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_20| .cse1) 1) (= (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_19| |v_old(#valid)_AFTER_CALL_20|))) (store |v_old(#valid)_AFTER_CALL_19| .cse2 (select |v_old(#valid)_AFTER_CALL_20| .cse2))) |v_old(#valid)_AFTER_CALL_20|) (= (select |v_old(#valid)_AFTER_CALL_19| .cse1) 0) (= (select |v_old(#valid)_AFTER_CALL_19| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_20| |c_ULTIMATE.start_dll_append_#t~ret7#1.base|) 0))) (= |c_ULTIMATE.start_dll_append_#t~ret7#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (or (= |c_ULTIMATE.start_dll_append_#t~ret7#1.base| .cse0) (= (select (select |c_#memory_int#1| .cse0) 0) 1) .cse3) (exists ((|v_old(#valid)_AFTER_CALL_21| (Array Int Int)) (v_arrayElimCell_58 Int) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_15| (Array Int Int))) (let ((.cse4 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (not (= v_arrayElimCell_58 0)) (= (select |v_old(#valid)_AFTER_CALL_21| .cse4) 0) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_21| v_arrayElimCell_58) 1) (= |v_#valid_BEFORE_CALL_15| (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_21| |v_#valid_BEFORE_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_21| .cse5 (select |v_#valid_BEFORE_CALL_15| .cse5)))) (= (select |v_#valid_BEFORE_CALL_15| .cse4) 1)))) (or (= (select (select |c_#memory_$Pointer$#1.offset| .cse1) 4) 0) (= |c_ULTIMATE.start_dll_append_#t~ret7#1.base| .cse1) .cse3) (= |c_ULTIMATE.start_dll_append_~head#1.offset| 0))))) is different from true [2024-11-18 13:09:39,907 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))) (let ((.cse3 (= .cse0 .cse1))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |c_ULTIMATE.start_dll_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_append_~new_last~0#1.offset| 0) (not (= .cse0 0)) (exists ((|v_old(#valid)_AFTER_CALL_20| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_19| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_20| .cse1) 1) (= (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_19| |v_old(#valid)_AFTER_CALL_20|))) (store |v_old(#valid)_AFTER_CALL_19| .cse2 (select |v_old(#valid)_AFTER_CALL_20| .cse2))) |v_old(#valid)_AFTER_CALL_20|) (= (select |v_old(#valid)_AFTER_CALL_19| .cse1) 0) (= (select |v_old(#valid)_AFTER_CALL_19| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_20| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) 0))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (or (= (select (select |c_#memory_$Pointer$#1.offset| .cse1) 4) 0) (= .cse1 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) .cse3) (= |c_ULTIMATE.start_main_~data~0#1| 1) (or (= .cse0 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) (= (select (select |c_#memory_int#1| .cse0) 0) 1) .cse3) (exists ((|v_old(#valid)_AFTER_CALL_21| (Array Int Int)) (v_arrayElimCell_58 Int) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_15| (Array Int Int))) (let ((.cse4 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (not (= v_arrayElimCell_58 0)) (= (select |v_old(#valid)_AFTER_CALL_21| .cse4) 0) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_21| v_arrayElimCell_58) 1) (= |v_#valid_BEFORE_CALL_15| (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_21| |v_#valid_BEFORE_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_21| .cse5 (select |v_#valid_BEFORE_CALL_15| .cse5)))) (= (select |v_#valid_BEFORE_CALL_15| .cse4) 1)))) (= |c_ULTIMATE.start_dll_append_~head#1.offset| 0))))) is different from false [2024-11-18 13:09:39,909 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))) (let ((.cse3 (= .cse0 .cse1))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |c_ULTIMATE.start_dll_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_append_~new_last~0#1.offset| 0) (not (= .cse0 0)) (exists ((|v_old(#valid)_AFTER_CALL_20| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_19| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_20| .cse1) 1) (= (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_19| |v_old(#valid)_AFTER_CALL_20|))) (store |v_old(#valid)_AFTER_CALL_19| .cse2 (select |v_old(#valid)_AFTER_CALL_20| .cse2))) |v_old(#valid)_AFTER_CALL_20|) (= (select |v_old(#valid)_AFTER_CALL_19| .cse1) 0) (= (select |v_old(#valid)_AFTER_CALL_19| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_20| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) 0))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (or (= (select (select |c_#memory_$Pointer$#1.offset| .cse1) 4) 0) (= .cse1 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) .cse3) (= |c_ULTIMATE.start_main_~data~0#1| 1) (or (= .cse0 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) (= (select (select |c_#memory_int#1| .cse0) 0) 1) .cse3) (exists ((|v_old(#valid)_AFTER_CALL_21| (Array Int Int)) (v_arrayElimCell_58 Int) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_15| (Array Int Int))) (let ((.cse4 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (not (= v_arrayElimCell_58 0)) (= (select |v_old(#valid)_AFTER_CALL_21| .cse4) 0) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_21| v_arrayElimCell_58) 1) (= |v_#valid_BEFORE_CALL_15| (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_21| |v_#valid_BEFORE_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_21| .cse5 (select |v_#valid_BEFORE_CALL_15| .cse5)))) (= (select |v_#valid_BEFORE_CALL_15| .cse4) 1)))) (= |c_ULTIMATE.start_dll_append_~head#1.offset| 0))))) is different from true [2024-11-18 13:09:39,982 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| .cse0) 4))) (let ((.cse3 (= .cse1 .cse0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |c_ULTIMATE.start_dll_append_~new_last~0#1.offset| 0) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse0) (not (= .cse1 0)) (exists ((|v_old(#valid)_AFTER_CALL_20| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_19| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_20| .cse0) 1) (= (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_19| |v_old(#valid)_AFTER_CALL_20|))) (store |v_old(#valid)_AFTER_CALL_19| .cse2 (select |v_old(#valid)_AFTER_CALL_20| .cse2))) |v_old(#valid)_AFTER_CALL_20|) (= (select |v_old(#valid)_AFTER_CALL_19| .cse0) 0) (= (select |v_old(#valid)_AFTER_CALL_19| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_20| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) 0))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (or (= (select (select |c_#memory_$Pointer$#1.offset| .cse0) 4) 0) (= .cse0 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) .cse3) (= |c_ULTIMATE.start_main_~data~0#1| 1) (or (= .cse1 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) (= (select (select |c_#memory_int#1| .cse1) 0) 1) .cse3) (= |c_ULTIMATE.start_dll_append_~last~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_21| (Array Int Int)) (v_arrayElimCell_58 Int) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_15| (Array Int Int))) (let ((.cse4 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (not (= v_arrayElimCell_58 0)) (= (select |v_old(#valid)_AFTER_CALL_21| .cse4) 0) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_21| v_arrayElimCell_58) 1) (= |v_#valid_BEFORE_CALL_15| (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_21| |v_#valid_BEFORE_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_21| .cse5 (select |v_#valid_BEFORE_CALL_15| .cse5)))) (= (select |v_#valid_BEFORE_CALL_15| .cse4) 1)))))))) is different from false [2024-11-18 13:09:39,985 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| .cse0) 4))) (let ((.cse3 (= .cse1 .cse0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |c_ULTIMATE.start_dll_append_~new_last~0#1.offset| 0) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse0) (not (= .cse1 0)) (exists ((|v_old(#valid)_AFTER_CALL_20| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_19| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_20| .cse0) 1) (= (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_19| |v_old(#valid)_AFTER_CALL_20|))) (store |v_old(#valid)_AFTER_CALL_19| .cse2 (select |v_old(#valid)_AFTER_CALL_20| .cse2))) |v_old(#valid)_AFTER_CALL_20|) (= (select |v_old(#valid)_AFTER_CALL_19| .cse0) 0) (= (select |v_old(#valid)_AFTER_CALL_19| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_20| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) 0))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (or (= (select (select |c_#memory_$Pointer$#1.offset| .cse0) 4) 0) (= .cse0 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) .cse3) (= |c_ULTIMATE.start_main_~data~0#1| 1) (or (= .cse1 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) (= (select (select |c_#memory_int#1| .cse1) 0) 1) .cse3) (= |c_ULTIMATE.start_dll_append_~last~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_21| (Array Int Int)) (v_arrayElimCell_58 Int) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_15| (Array Int Int))) (let ((.cse4 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (not (= v_arrayElimCell_58 0)) (= (select |v_old(#valid)_AFTER_CALL_21| .cse4) 0) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_21| v_arrayElimCell_58) 1) (= |v_#valid_BEFORE_CALL_15| (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_21| |v_#valid_BEFORE_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_21| .cse5 (select |v_#valid_BEFORE_CALL_15| .cse5)))) (= (select |v_#valid_BEFORE_CALL_15| .cse4) 1)))))))) is different from true [2024-11-18 13:09:40,129 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))) (let ((.cse3 (select (select |c_#memory_$Pointer$#1.offset| .cse1) 4)) (.cse4 (= .cse0 .cse1))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |c_ULTIMATE.start_dll_append_~new_last~0#1.offset| 0) (not (= .cse0 0)) (exists ((|v_old(#valid)_AFTER_CALL_20| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_19| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_20| .cse1) 1) (= (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_19| |v_old(#valid)_AFTER_CALL_20|))) (store |v_old(#valid)_AFTER_CALL_19| .cse2 (select |v_old(#valid)_AFTER_CALL_20| .cse2))) |v_old(#valid)_AFTER_CALL_20|) (= (select |v_old(#valid)_AFTER_CALL_19| .cse1) 0) (= (select |v_old(#valid)_AFTER_CALL_19| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_20| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) 0))) (<= .cse3 |c_ULTIMATE.start_dll_append_~last~0#1.offset|) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (or (= .cse3 0) (= .cse1 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) .cse4) (= |c_ULTIMATE.start_main_~data~0#1| 1) (or (= .cse0 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) (= (select (select |c_#memory_int#1| .cse0) 0) 1) .cse4) (exists ((|v_old(#valid)_AFTER_CALL_21| (Array Int Int)) (v_arrayElimCell_58 Int) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_15| (Array Int Int))) (let ((.cse5 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (not (= v_arrayElimCell_58 0)) (= (select |v_old(#valid)_AFTER_CALL_21| .cse5) 0) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_21| v_arrayElimCell_58) 1) (= |v_#valid_BEFORE_CALL_15| (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_21| |v_#valid_BEFORE_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_21| .cse6 (select |v_#valid_BEFORE_CALL_15| .cse6)))) (= (select |v_#valid_BEFORE_CALL_15| .cse5) 1)))))))) is different from false [2024-11-18 13:09:40,131 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))) (let ((.cse3 (select (select |c_#memory_$Pointer$#1.offset| .cse1) 4)) (.cse4 (= .cse0 .cse1))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |c_ULTIMATE.start_dll_append_~new_last~0#1.offset| 0) (not (= .cse0 0)) (exists ((|v_old(#valid)_AFTER_CALL_20| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_19| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_20| .cse1) 1) (= (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_19| |v_old(#valid)_AFTER_CALL_20|))) (store |v_old(#valid)_AFTER_CALL_19| .cse2 (select |v_old(#valid)_AFTER_CALL_20| .cse2))) |v_old(#valid)_AFTER_CALL_20|) (= (select |v_old(#valid)_AFTER_CALL_19| .cse1) 0) (= (select |v_old(#valid)_AFTER_CALL_19| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_20| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) 0))) (<= .cse3 |c_ULTIMATE.start_dll_append_~last~0#1.offset|) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (or (= .cse3 0) (= .cse1 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) .cse4) (= |c_ULTIMATE.start_main_~data~0#1| 1) (or (= .cse0 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) (= (select (select |c_#memory_int#1| .cse0) 0) 1) .cse4) (exists ((|v_old(#valid)_AFTER_CALL_21| (Array Int Int)) (v_arrayElimCell_58 Int) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_15| (Array Int Int))) (let ((.cse5 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (not (= v_arrayElimCell_58 0)) (= (select |v_old(#valid)_AFTER_CALL_21| .cse5) 0) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_21| v_arrayElimCell_58) 1) (= |v_#valid_BEFORE_CALL_15| (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_21| |v_#valid_BEFORE_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_21| .cse6 (select |v_#valid_BEFORE_CALL_15| .cse6)))) (= (select |v_#valid_BEFORE_CALL_15| .cse5) 1)))))))) is different from true [2024-11-18 13:09:40,208 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))) (let ((.cse3 (select (select |c_#memory_$Pointer$#1.offset| .cse1) 4)) (.cse4 (= .cse0 .cse1))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |c_ULTIMATE.start_dll_append_#t~mem10#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_append_~last~0#1.base|) (+ |c_ULTIMATE.start_dll_append_~last~0#1.offset| 4))) (= |c_ULTIMATE.start_dll_append_~new_last~0#1.offset| 0) (not (= .cse0 0)) (exists ((|v_old(#valid)_AFTER_CALL_20| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_19| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_20| .cse1) 1) (= (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_19| |v_old(#valid)_AFTER_CALL_20|))) (store |v_old(#valid)_AFTER_CALL_19| .cse2 (select |v_old(#valid)_AFTER_CALL_20| .cse2))) |v_old(#valid)_AFTER_CALL_20|) (= (select |v_old(#valid)_AFTER_CALL_19| .cse1) 0) (= (select |v_old(#valid)_AFTER_CALL_19| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_20| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) 0))) (<= .cse3 |c_ULTIMATE.start_dll_append_~last~0#1.offset|) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (or (= .cse3 0) (= .cse1 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) .cse4) (= |c_ULTIMATE.start_main_~data~0#1| 1) (or (= .cse0 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) (= (select (select |c_#memory_int#1| .cse0) 0) 1) .cse4) (exists ((|v_old(#valid)_AFTER_CALL_21| (Array Int Int)) (v_arrayElimCell_58 Int) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_15| (Array Int Int))) (let ((.cse5 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (not (= v_arrayElimCell_58 0)) (= (select |v_old(#valid)_AFTER_CALL_21| .cse5) 0) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_21| v_arrayElimCell_58) 1) (= |v_#valid_BEFORE_CALL_15| (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_21| |v_#valid_BEFORE_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_21| .cse6 (select |v_#valid_BEFORE_CALL_15| .cse6)))) (= (select |v_#valid_BEFORE_CALL_15| .cse5) 1)))))))) is different from false [2024-11-18 13:09:40,211 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))) (let ((.cse3 (select (select |c_#memory_$Pointer$#1.offset| .cse1) 4)) (.cse4 (= .cse0 .cse1))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |c_ULTIMATE.start_dll_append_#t~mem10#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_append_~last~0#1.base|) (+ |c_ULTIMATE.start_dll_append_~last~0#1.offset| 4))) (= |c_ULTIMATE.start_dll_append_~new_last~0#1.offset| 0) (not (= .cse0 0)) (exists ((|v_old(#valid)_AFTER_CALL_20| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_19| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_20| .cse1) 1) (= (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_19| |v_old(#valid)_AFTER_CALL_20|))) (store |v_old(#valid)_AFTER_CALL_19| .cse2 (select |v_old(#valid)_AFTER_CALL_20| .cse2))) |v_old(#valid)_AFTER_CALL_20|) (= (select |v_old(#valid)_AFTER_CALL_19| .cse1) 0) (= (select |v_old(#valid)_AFTER_CALL_19| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_20| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) 0))) (<= .cse3 |c_ULTIMATE.start_dll_append_~last~0#1.offset|) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (or (= .cse3 0) (= .cse1 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) .cse4) (= |c_ULTIMATE.start_main_~data~0#1| 1) (or (= .cse0 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) (= (select (select |c_#memory_int#1| .cse0) 0) 1) .cse4) (exists ((|v_old(#valid)_AFTER_CALL_21| (Array Int Int)) (v_arrayElimCell_58 Int) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_15| (Array Int Int))) (let ((.cse5 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (not (= v_arrayElimCell_58 0)) (= (select |v_old(#valid)_AFTER_CALL_21| .cse5) 0) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_21| v_arrayElimCell_58) 1) (= |v_#valid_BEFORE_CALL_15| (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_21| |v_#valid_BEFORE_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_21| .cse6 (select |v_#valid_BEFORE_CALL_15| .cse6)))) (= (select |v_#valid_BEFORE_CALL_15| .cse5) 1)))))))) is different from true [2024-11-18 13:09:40,288 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))) (let ((.cse3 (select (select |c_#memory_$Pointer$#1.offset| .cse1) 4)) (.cse4 (= .cse0 .cse1))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |c_ULTIMATE.start_dll_append_~new_last~0#1.offset| 0) (not (= .cse0 0)) (exists ((|v_old(#valid)_AFTER_CALL_20| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_19| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_20| .cse1) 1) (= (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_19| |v_old(#valid)_AFTER_CALL_20|))) (store |v_old(#valid)_AFTER_CALL_19| .cse2 (select |v_old(#valid)_AFTER_CALL_20| .cse2))) |v_old(#valid)_AFTER_CALL_20|) (= (select |v_old(#valid)_AFTER_CALL_19| .cse1) 0) (= (select |v_old(#valid)_AFTER_CALL_19| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_20| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) 0))) (<= .cse3 |c_ULTIMATE.start_dll_append_~last~0#1.offset|) (= (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_append_~last~0#1.base|) (+ |c_ULTIMATE.start_dll_append_~last~0#1.offset| 4)) 0) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (or (= .cse3 0) (= .cse1 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) .cse4) (= |c_ULTIMATE.start_main_~data~0#1| 1) (or (= .cse0 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) (= (select (select |c_#memory_int#1| .cse0) 0) 1) .cse4) (exists ((|v_old(#valid)_AFTER_CALL_21| (Array Int Int)) (v_arrayElimCell_58 Int) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_15| (Array Int Int))) (let ((.cse5 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (not (= v_arrayElimCell_58 0)) (= (select |v_old(#valid)_AFTER_CALL_21| .cse5) 0) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_21| v_arrayElimCell_58) 1) (= |v_#valid_BEFORE_CALL_15| (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_21| |v_#valid_BEFORE_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_21| .cse6 (select |v_#valid_BEFORE_CALL_15| .cse6)))) (= (select |v_#valid_BEFORE_CALL_15| .cse5) 1)))))))) is different from false [2024-11-18 13:09:40,291 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))) (let ((.cse3 (select (select |c_#memory_$Pointer$#1.offset| .cse1) 4)) (.cse4 (= .cse0 .cse1))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |c_ULTIMATE.start_dll_append_~new_last~0#1.offset| 0) (not (= .cse0 0)) (exists ((|v_old(#valid)_AFTER_CALL_20| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_19| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_20| .cse1) 1) (= (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_19| |v_old(#valid)_AFTER_CALL_20|))) (store |v_old(#valid)_AFTER_CALL_19| .cse2 (select |v_old(#valid)_AFTER_CALL_20| .cse2))) |v_old(#valid)_AFTER_CALL_20|) (= (select |v_old(#valid)_AFTER_CALL_19| .cse1) 0) (= (select |v_old(#valid)_AFTER_CALL_19| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_20| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) 0))) (<= .cse3 |c_ULTIMATE.start_dll_append_~last~0#1.offset|) (= (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_append_~last~0#1.base|) (+ |c_ULTIMATE.start_dll_append_~last~0#1.offset| 4)) 0) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (or (= .cse3 0) (= .cse1 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) .cse4) (= |c_ULTIMATE.start_main_~data~0#1| 1) (or (= .cse0 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) (= (select (select |c_#memory_int#1| .cse0) 0) 1) .cse4) (exists ((|v_old(#valid)_AFTER_CALL_21| (Array Int Int)) (v_arrayElimCell_58 Int) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_15| (Array Int Int))) (let ((.cse5 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (not (= v_arrayElimCell_58 0)) (= (select |v_old(#valid)_AFTER_CALL_21| .cse5) 0) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_21| v_arrayElimCell_58) 1) (= |v_#valid_BEFORE_CALL_15| (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_21| |v_#valid_BEFORE_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_21| .cse6 (select |v_#valid_BEFORE_CALL_15| .cse6)))) (= (select |v_#valid_BEFORE_CALL_15| .cse5) 1)))))))) is different from true [2024-11-18 13:09:40,334 INFO L349 Elim1Store]: treesize reduction 53, result has 17.2 percent of original size [2024-11-18 13:09:40,334 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 259 treesize of output 138 [2024-11-18 13:09:40,361 INFO L349 Elim1Store]: treesize reduction 64, result has 19.0 percent of original size [2024-11-18 13:09:40,361 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 347 treesize of output 200 [2024-11-18 13:09:40,372 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 131 treesize of output 54 [2024-11-18 13:09:40,378 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-18 13:09:40,379 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 35 [2024-11-18 13:09:40,387 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-18 13:09:40,387 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 122 treesize of output 108 [2024-11-18 13:09:40,394 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-18 13:09:40,395 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-18 13:09:40,396 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 113 treesize of output 77 [2024-11-18 13:09:40,449 INFO L349 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2024-11-18 13:09:40,449 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 177 treesize of output 103 [2024-11-18 13:09:40,455 WARN L214 Elim1Store]: Array PQE input equivalent to false [2024-11-18 13:09:40,482 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| .cse0) 4))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (exists ((|v_old(#valid)_AFTER_CALL_20| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~last~0#1.offset_23| Int) (|v_old(#valid)_AFTER_CALL_19| (Array Int Int))) (let ((.cse2 (+ |v_ULTIMATE.start_dll_append_~last~0#1.offset_23| 4))) (and (= (select |v_old(#valid)_AFTER_CALL_20| .cse0) 1) (= (select (select |c_#memory_$Pointer$#1.offset| .cse1) .cse2) 0) (= (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_19| |v_old(#valid)_AFTER_CALL_20|))) (store |v_old(#valid)_AFTER_CALL_19| .cse3 (select |v_old(#valid)_AFTER_CALL_20| .cse3))) |v_old(#valid)_AFTER_CALL_20|) (= (select |v_old(#valid)_AFTER_CALL_19| .cse0) 0) (= (select |v_old(#valid)_AFTER_CALL_20| (select (select |c_#memory_$Pointer$#1.base| .cse1) .cse2)) 0) (= (select |v_old(#valid)_AFTER_CALL_19| .cse1) 1) (<= 0 |v_ULTIMATE.start_dll_append_~last~0#1.offset_23|)))) (not (= .cse1 0)) (or (= (select (select |c_#memory_int#1| .cse1) 0) 1) (= .cse1 .cse0)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#1.offset| .cse0) 4) 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_old(#valid)_AFTER_CALL_21| (Array Int Int)) (v_arrayElimCell_58 Int) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_15| (Array Int Int))) (let ((.cse4 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (not (= v_arrayElimCell_58 0)) (= (select |v_old(#valid)_AFTER_CALL_21| .cse4) 0) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_21| v_arrayElimCell_58) 1) (= |v_#valid_BEFORE_CALL_15| (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_21| |v_#valid_BEFORE_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_21| .cse5 (select |v_#valid_BEFORE_CALL_15| .cse5)))) (= (select |v_#valid_BEFORE_CALL_15| .cse4) 1))))))) is different from false [2024-11-18 13:09:40,485 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| .cse0) 4))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (exists ((|v_old(#valid)_AFTER_CALL_20| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~last~0#1.offset_23| Int) (|v_old(#valid)_AFTER_CALL_19| (Array Int Int))) (let ((.cse2 (+ |v_ULTIMATE.start_dll_append_~last~0#1.offset_23| 4))) (and (= (select |v_old(#valid)_AFTER_CALL_20| .cse0) 1) (= (select (select |c_#memory_$Pointer$#1.offset| .cse1) .cse2) 0) (= (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_19| |v_old(#valid)_AFTER_CALL_20|))) (store |v_old(#valid)_AFTER_CALL_19| .cse3 (select |v_old(#valid)_AFTER_CALL_20| .cse3))) |v_old(#valid)_AFTER_CALL_20|) (= (select |v_old(#valid)_AFTER_CALL_19| .cse0) 0) (= (select |v_old(#valid)_AFTER_CALL_20| (select (select |c_#memory_$Pointer$#1.base| .cse1) .cse2)) 0) (= (select |v_old(#valid)_AFTER_CALL_19| .cse1) 1) (<= 0 |v_ULTIMATE.start_dll_append_~last~0#1.offset_23|)))) (not (= .cse1 0)) (or (= (select (select |c_#memory_int#1| .cse1) 0) 1) (= .cse1 .cse0)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#1.offset| .cse0) 4) 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_old(#valid)_AFTER_CALL_21| (Array Int Int)) (v_arrayElimCell_58 Int) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_15| (Array Int Int))) (let ((.cse4 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (not (= v_arrayElimCell_58 0)) (= (select |v_old(#valid)_AFTER_CALL_21| .cse4) 0) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_21| v_arrayElimCell_58) 1) (= |v_#valid_BEFORE_CALL_15| (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_21| |v_#valid_BEFORE_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_21| .cse5 (select |v_#valid_BEFORE_CALL_15| .cse5)))) (= (select |v_#valid_BEFORE_CALL_15| .cse4) 1))))))) is different from true [2024-11-18 13:09:40,512 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-18 13:09:40,513 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 147 treesize of output 103 [2024-11-18 13:09:40,522 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-18 13:09:40,522 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 [2024-11-18 13:09:40,549 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~ptr~0#1.base|) 4))) (and (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (or (= .cse0 |c_ULTIMATE.start_main_~ptr~0#1.base|) (= (select (select |c_#memory_int#1| .cse0) 0) 1)) (not (= .cse0 0)) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~ptr~0#1.base|) 4) 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_old(#valid)_AFTER_CALL_20| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~last~0#1.offset_23| Int) (|v_old(#valid)_AFTER_CALL_19| (Array Int Int))) (let ((.cse1 (+ |v_ULTIMATE.start_dll_append_~last~0#1.offset_23| 4))) (and (= 0 (select |v_old(#valid)_AFTER_CALL_20| (select (select |c_#memory_$Pointer$#1.base| .cse0) .cse1))) (= (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_19| |v_old(#valid)_AFTER_CALL_20|))) (store |v_old(#valid)_AFTER_CALL_19| .cse2 (select |v_old(#valid)_AFTER_CALL_20| .cse2))) |v_old(#valid)_AFTER_CALL_20|) (= (select |v_old(#valid)_AFTER_CALL_19| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_19| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (<= 0 |v_ULTIMATE.start_dll_append_~last~0#1.offset_23|) (= (select (select |c_#memory_$Pointer$#1.offset| .cse0) .cse1) 0) (= (select |v_old(#valid)_AFTER_CALL_20| |c_ULTIMATE.start_main_~ptr~0#1.base|) 1)))))) is different from false [2024-11-18 13:09:40,551 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~ptr~0#1.base|) 4))) (and (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (or (= .cse0 |c_ULTIMATE.start_main_~ptr~0#1.base|) (= (select (select |c_#memory_int#1| .cse0) 0) 1)) (not (= .cse0 0)) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~ptr~0#1.base|) 4) 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_old(#valid)_AFTER_CALL_20| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~last~0#1.offset_23| Int) (|v_old(#valid)_AFTER_CALL_19| (Array Int Int))) (let ((.cse1 (+ |v_ULTIMATE.start_dll_append_~last~0#1.offset_23| 4))) (and (= 0 (select |v_old(#valid)_AFTER_CALL_20| (select (select |c_#memory_$Pointer$#1.base| .cse0) .cse1))) (= (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_19| |v_old(#valid)_AFTER_CALL_20|))) (store |v_old(#valid)_AFTER_CALL_19| .cse2 (select |v_old(#valid)_AFTER_CALL_20| .cse2))) |v_old(#valid)_AFTER_CALL_20|) (= (select |v_old(#valid)_AFTER_CALL_19| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_19| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (<= 0 |v_ULTIMATE.start_dll_append_~last~0#1.offset_23|) (= (select (select |c_#memory_$Pointer$#1.offset| .cse0) .cse1) 0) (= (select |v_old(#valid)_AFTER_CALL_20| |c_ULTIMATE.start_main_~ptr~0#1.base|) 1)))))) is different from true [2024-11-18 13:09:40,595 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-11-18 13:09:40,596 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 72 treesize of output 41 [2024-11-18 13:09:40,601 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-18 13:09:40,602 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 17 treesize of output 7 [2024-11-18 13:09:40,642 WARN L851 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (= (select (select |c_#memory_int#1| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) 1) (= |c_ULTIMATE.start_main_~data~0#1| 1) (not (= |c_ULTIMATE.start_main_~ptr~0#1.base| 0)) (exists ((|v_old(#valid)_AFTER_CALL_20| (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.base_18| Int) (v_arrayElimCell_79 Int) (|v_old(#valid)_AFTER_CALL_19| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_20| |v_ULTIMATE.start_main_~ptr~0#1.base_18|) 1) (= (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_19| |v_old(#valid)_AFTER_CALL_20|))) (store |v_old(#valid)_AFTER_CALL_19| .cse0 (select |v_old(#valid)_AFTER_CALL_20| .cse0))) |v_old(#valid)_AFTER_CALL_20|) (= (select |v_old(#valid)_AFTER_CALL_19| |c_ULTIMATE.start_main_~ptr~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_20| v_arrayElimCell_79) 0) (= (select |v_old(#valid)_AFTER_CALL_19| |v_ULTIMATE.start_main_~ptr~0#1.base_18|) 0)))) is different from false [2024-11-18 13:09:40,643 WARN L873 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (= (select (select |c_#memory_int#1| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) 1) (= |c_ULTIMATE.start_main_~data~0#1| 1) (not (= |c_ULTIMATE.start_main_~ptr~0#1.base| 0)) (exists ((|v_old(#valid)_AFTER_CALL_20| (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.base_18| Int) (v_arrayElimCell_79 Int) (|v_old(#valid)_AFTER_CALL_19| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_20| |v_ULTIMATE.start_main_~ptr~0#1.base_18|) 1) (= (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_19| |v_old(#valid)_AFTER_CALL_20|))) (store |v_old(#valid)_AFTER_CALL_19| .cse0 (select |v_old(#valid)_AFTER_CALL_20| .cse0))) |v_old(#valid)_AFTER_CALL_20|) (= (select |v_old(#valid)_AFTER_CALL_19| |c_ULTIMATE.start_main_~ptr~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_20| v_arrayElimCell_79) 0) (= (select |v_old(#valid)_AFTER_CALL_19| |v_ULTIMATE.start_main_~ptr~0#1.base_18|) 0)))) is different from true [2024-11-18 13:09:40,679 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 18 not checked. [2024-11-18 13:09:40,680 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-18 13:09:40,793 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1337 (Array Int Int)) (v_ArrVal_1342 (Array Int Int)) (v_ArrVal_1341 (Array Int Int)) (v_ArrVal_1340 (Array Int Int))) (let ((.cse0 (+ |c_ULTIMATE.start_dll_append_~last~0#1.offset| 4))) (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 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_append_~last~0#1.base| v_ArrVal_1340) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1342) (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_append_~last~0#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_append_~last~0#1.base|) .cse0 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1341) .cse1) .cse2)) (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base| (store (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base|) .cse0 |c_ULTIMATE.start_dll_append_~new_last~0#1.offset|)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1337) .cse1) .cse2)))) (not (= v_ArrVal_1340 (store (select |c_#memory_int#1| |c_ULTIMATE.start_dll_append_~last~0#1.base|) .cse0 (select v_ArrVal_1340 .cse0))))))) is different from false [2024-11-18 13:09:40,960 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1337 (Array Int Int)) (v_ArrVal_1342 (Array Int Int)) (v_ArrVal_1341 (Array Int Int)) (v_ArrVal_1340 (Array Int Int)) (|v_ULTIMATE.start_dll_append_~last~0#1.offset_25| Int)) (let ((.cse5 (+ |c_ULTIMATE.start_dll_append_~last~0#1.offset| 4))) (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_append_~last~0#1.base|) .cse5))) (let ((.cse0 (select |c_#memory_$Pointer$#1.base| .cse2)) (.cse1 (+ |v_ULTIMATE.start_dll_append_~last~0#1.offset_25| 4))) (or (not (= (select .cse0 .cse1) 0)) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse3 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse4 (+ (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 (store |c_#memory_int#1| .cse2 v_ArrVal_1340) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1342) (select (select (store (store |c_#memory_$Pointer$#1.base| .cse2 (store .cse0 .cse1 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1341) .cse3) .cse4)) (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse2 (store (select |c_#memory_$Pointer$#1.offset| .cse2) .cse1 |c_ULTIMATE.start_dll_append_~new_last~0#1.offset|)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1337) .cse3) .cse4)))) (< |v_ULTIMATE.start_dll_append_~last~0#1.offset_25| (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base|) .cse5)) (not (= (store (select |c_#memory_int#1| .cse2) .cse1 (select v_ArrVal_1340 .cse1)) v_ArrVal_1340))))))) is different from false [2024-11-18 13:09:40,992 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1337 (Array Int Int)) (v_ArrVal_1342 (Array Int Int)) (v_ArrVal_1341 (Array Int Int)) (v_ArrVal_1340 (Array Int Int)) (|v_ULTIMATE.start_dll_append_~last~0#1.offset_25| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse1 (+ (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 4))) (let ((.cse4 (select (select |c_#memory_$Pointer$#1.base| .cse0) .cse1))) (let ((.cse2 (select |c_#memory_$Pointer$#1.base| .cse4)) (.cse3 (+ |v_ULTIMATE.start_dll_append_~last~0#1.offset_25| 4))) (or (< |v_ULTIMATE.start_dll_append_~last~0#1.offset_25| (select (select |c_#memory_$Pointer$#1.offset| .cse0) .cse1)) (not (= (select .cse2 .cse3) 0)) (not (= v_ArrVal_1340 (store (select |c_#memory_int#1| .cse4) .cse3 (select v_ArrVal_1340 .cse3)))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse5 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse6 (+ (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 (store |c_#memory_int#1| .cse4 v_ArrVal_1340) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1342) (select (select (store (store |c_#memory_$Pointer$#1.base| .cse4 (store .cse2 .cse3 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1341) .cse5) .cse6)) (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse4 (store (select |c_#memory_$Pointer$#1.offset| .cse4) .cse3 |c_ULTIMATE.start_dll_append_~new_last~0#1.offset|)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1337) .cse5) .cse6))))))))) is different from false [2024-11-18 13:09:41,165 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1337 (Array Int Int)) (v_ArrVal_1353 (Array Int Int)) (v_ArrVal_1342 (Array Int Int)) (|v_ULTIMATE.start_dll_append_#t~ret7#1.base_31| Int) (v_ArrVal_1341 (Array Int Int)) (v_ArrVal_1352 (Array Int Int)) (v_ArrVal_1340 (Array Int Int)) (v_ArrVal_1351 (Array Int Int)) (|v_ULTIMATE.start_dll_append_~last~0#1.offset_25| Int)) (let ((.cse8 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_31| v_ArrVal_1353)) (.cse6 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse7 (+ (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 4))) (let ((.cse2 (select (select .cse8 .cse6) .cse7))) (let ((.cse0 (select .cse8 .cse2)) (.cse1 (+ |v_ULTIMATE.start_dll_append_~last~0#1.offset_25| 4)) (.cse5 (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_31| v_ArrVal_1352))) (or (not (= (select .cse0 .cse1) 0)) (not (= (store (select (store |c_#memory_int#1| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_31| v_ArrVal_1351) .cse2) .cse1 (select v_ArrVal_1340 .cse1)) v_ArrVal_1340)) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_31|) 0)) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse3 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse4 (+ (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 (store |c_#memory_int#1| .cse2 v_ArrVal_1340) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_31| v_ArrVal_1342) (select (select (store (store |c_#memory_$Pointer$#1.base| .cse2 (store .cse0 .cse1 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_31|)) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_31| v_ArrVal_1341) .cse3) .cse4)) (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse2 (store (select .cse5 .cse2) .cse1 0)) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_31| v_ArrVal_1337) .cse3) .cse4)))) (< |v_ULTIMATE.start_dll_append_~last~0#1.offset_25| (select (select .cse5 .cse6) .cse7))))))) is different from false [2024-11-18 13:09:41,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1617898447] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 13:09:41,167 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-18 13:09:41,167 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 30] total 52 [2024-11-18 13:09:41,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1427824105] [2024-11-18 13:09:41,169 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-18 13:09:41,169 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2024-11-18 13:09:41,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 13:09:41,169 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2024-11-18 13:09:41,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=1457, Unknown=40, NotChecked=2134, Total=3782 [2024-11-18 13:09:41,170 INFO L87 Difference]: Start difference. First operand 48 states and 54 transitions. Second operand has 52 states, 50 states have (on average 1.32) internal successors, (66), 43 states have internal predecessors, (66), 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) [2024-11-18 13:09:41,468 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_int#1| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 0))) (let ((.cse1 (= .cse2 1))) (and (or (exists ((|v_#memory_int#1_BEFORE_CALL_6| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_#memory_int#1_BEFORE_CALL_6| |c_#memory_int#1|))) (and (= (select (select |v_#memory_int#1_BEFORE_CALL_6| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 0) 1) (= |c_#memory_int#1| (store |v_#memory_int#1_BEFORE_CALL_6| .cse0 (select |c_#memory_int#1| .cse0))) (= |c_ULTIMATE.start_dll_create_#t~ret4#1.base| .cse0)))) .cse1) (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_#t~ret4#1.base|) 1) (not (= |c_ULTIMATE.start_dll_create_#t~ret4#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (= |c_ULTIMATE.start_dll_create_#t~ret4#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_dll_create_~data#1| 1) .cse1 (= |c_ULTIMATE.start_main_~data~0#1| .cse2) (= (select (select |c_#memory_int#1| |c_ULTIMATE.start_dll_create_#t~ret4#1.base|) 0) 1) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1) (exists ((|v_old(#valid)_AFTER_CALL_19| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_19| |c_ULTIMATE.start_dll_create_#t~ret4#1.base|) 0) (= |c_#valid| (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_19| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_19| .cse3 (select |c_#valid| .cse3)))) (= (select |v_old(#valid)_AFTER_CALL_19| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1)))))) is different from false [2024-11-18 13:09:41,470 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_int#1| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 0))) (let ((.cse1 (= .cse2 1))) (and (or (exists ((|v_#memory_int#1_BEFORE_CALL_6| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_#memory_int#1_BEFORE_CALL_6| |c_#memory_int#1|))) (and (= (select (select |v_#memory_int#1_BEFORE_CALL_6| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 0) 1) (= |c_#memory_int#1| (store |v_#memory_int#1_BEFORE_CALL_6| .cse0 (select |c_#memory_int#1| .cse0))) (= |c_ULTIMATE.start_dll_create_#t~ret4#1.base| .cse0)))) .cse1) (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_#t~ret4#1.base|) 1) (not (= |c_ULTIMATE.start_dll_create_#t~ret4#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (= |c_ULTIMATE.start_dll_create_#t~ret4#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_dll_create_~data#1| 1) .cse1 (= |c_ULTIMATE.start_main_~data~0#1| .cse2) (= (select (select |c_#memory_int#1| |c_ULTIMATE.start_dll_create_#t~ret4#1.base|) 0) 1) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1) (exists ((|v_old(#valid)_AFTER_CALL_19| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_19| |c_ULTIMATE.start_dll_create_#t~ret4#1.base|) 0) (= |c_#valid| (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_19| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_19| .cse3 (select |c_#valid| .cse3)))) (= (select |v_old(#valid)_AFTER_CALL_19| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1)))))) is different from true [2024-11-18 13:09:41,473 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (.cse2 (select |c_#memory_int#1| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (.cse1 (select (select |c_#memory_int#1| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 0)) (.cse4 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4))) (and (or .cse0 (= .cse1 1) (exists ((|v_#memory_int#1_188| (Array Int (Array Int Int)))) (and (= |c_#memory_int#1| (store |v_#memory_int#1_188| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse2)) (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_188|))) (and (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse3) (= (select (select |v_#memory_int#1_BEFORE_CALL_6| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 0) 1) (= |v_#memory_int#1_188| (store |v_#memory_int#1_BEFORE_CALL_6| .cse3 (select |v_#memory_int#1_188| .cse3))))))))) (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| 0) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| .cse4) 1) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (not .cse0) (= (select .cse2 0) 1) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_old(#valid)_AFTER_CALL_19| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_19| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 0) (= |c_#valid| (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_19| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_19| .cse5 (select |c_#valid| .cse5)))) (= (select |v_old(#valid)_AFTER_CALL_19| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1))) (not (= (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 8) 0)) (= |c_ULTIMATE.start_main_~data~0#1| .cse1) (= .cse4 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4) 0))) is different from false [2024-11-18 13:09:41,476 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (.cse2 (select |c_#memory_int#1| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (.cse1 (select (select |c_#memory_int#1| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 0)) (.cse4 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4))) (and (or .cse0 (= .cse1 1) (exists ((|v_#memory_int#1_188| (Array Int (Array Int Int)))) (and (= |c_#memory_int#1| (store |v_#memory_int#1_188| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse2)) (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_188|))) (and (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse3) (= (select (select |v_#memory_int#1_BEFORE_CALL_6| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 0) 1) (= |v_#memory_int#1_188| (store |v_#memory_int#1_BEFORE_CALL_6| .cse3 (select |v_#memory_int#1_188| .cse3))))))))) (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| 0) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| .cse4) 1) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (not .cse0) (= (select .cse2 0) 1) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_old(#valid)_AFTER_CALL_19| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_19| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 0) (= |c_#valid| (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_19| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_19| .cse5 (select |c_#valid| .cse5)))) (= (select |v_old(#valid)_AFTER_CALL_19| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1))) (not (= (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 8) 0)) (= |c_ULTIMATE.start_main_~data~0#1| .cse1) (= .cse4 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4) 0))) is different from true [2024-11-18 13:09:41,478 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4))) (let ((.cse0 (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse3)) (.cse1 (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4) 0)) (.cse4 (select (select |c_#memory_int#1| .cse3) 0))) (and (or .cse0 .cse1) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_19| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_19| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 0) (= |c_#valid| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_19| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_19| .cse2 (select |c_#valid| .cse2)))) (= (select |v_old(#valid)_AFTER_CALL_19| .cse3) 1))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| .cse3) 1) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (= |c_ULTIMATE.start_main_~data~0#1| 1) (not .cse0) (or (= .cse4 1) .cse0) (not (= .cse3 0)) .cse1 (= |c_ULTIMATE.start_main_~data~0#1| .cse4)))) is different from false [2024-11-18 13:09:41,479 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4))) (let ((.cse0 (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse3)) (.cse1 (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4) 0)) (.cse4 (select (select |c_#memory_int#1| .cse3) 0))) (and (or .cse0 .cse1) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_19| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_19| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 0) (= |c_#valid| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_19| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_19| .cse2 (select |c_#valid| .cse2)))) (= (select |v_old(#valid)_AFTER_CALL_19| .cse3) 1))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| .cse3) 1) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (= |c_ULTIMATE.start_main_~data~0#1| 1) (not .cse0) (or (= .cse4 1) .cse0) (not (= .cse3 0)) .cse1 (= |c_ULTIMATE.start_main_~data~0#1| .cse4)))) is different from true [2024-11-18 13:09:41,481 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4))) (let ((.cse1 (= .cse0 |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (.cse2 (select (select |c_#memory_int#1| .cse0) 0)) (.cse3 (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4) 0))) (and (= (select |c_#valid| .cse0) 1) (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (not .cse1) (or .cse1 (= .cse2 1)) (or .cse1 .cse3) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_old(#valid)_AFTER_CALL_19| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_19| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 0) (= |c_#valid| (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_19| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_19| .cse4 (select |c_#valid| .cse4)))) (= (select |v_old(#valid)_AFTER_CALL_19| .cse0) 1))) (= |c_ULTIMATE.start_main_~data~0#1| .cse2) .cse3 (not (= .cse0 0)) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1)))) is different from false [2024-11-18 13:09:41,482 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4))) (let ((.cse1 (= .cse0 |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (.cse2 (select (select |c_#memory_int#1| .cse0) 0)) (.cse3 (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4) 0))) (and (= (select |c_#valid| .cse0) 1) (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (not .cse1) (or .cse1 (= .cse2 1)) (or .cse1 .cse3) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_old(#valid)_AFTER_CALL_19| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_19| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 0) (= |c_#valid| (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_19| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_19| .cse4 (select |c_#valid| .cse4)))) (= (select |v_old(#valid)_AFTER_CALL_19| .cse0) 1))) (= |c_ULTIMATE.start_main_~data~0#1| .cse2) .cse3 (not (= .cse0 0)) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1)))) is different from true [2024-11-18 13:09:41,485 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_#res#1.base|) 4))) (let ((.cse1 (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_#res#1.base|) 4) 0)) (.cse3 (= .cse0 |c_ULTIMATE.start_dll_create_#res#1.base|)) (.cse2 (select (select |c_#memory_int#1| .cse0) 0))) (and (= (select |c_#valid| |c_ULTIMATE.start_dll_create_#res#1.base|) 1) (not (= .cse0 0)) .cse1 (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (or (= .cse2 1) .cse3) (= |c_ULTIMATE.start_main_~data~0#1| 1) (not .cse3) (exists ((|v_old(#valid)_AFTER_CALL_19| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_19| |c_ULTIMATE.start_dll_create_#res#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_19| .cse0) 1) (= |c_#valid| (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_19| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_19| .cse4 (select |c_#valid| .cse4)))))) (= |c_ULTIMATE.start_dll_create_#res#1.offset| 0) (or .cse1 .cse3) (= (select |c_#valid| .cse0) 1) (= |c_ULTIMATE.start_main_~data~0#1| .cse2)))) is different from false [2024-11-18 13:09:41,487 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_#res#1.base|) 4))) (let ((.cse1 (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_#res#1.base|) 4) 0)) (.cse3 (= .cse0 |c_ULTIMATE.start_dll_create_#res#1.base|)) (.cse2 (select (select |c_#memory_int#1| .cse0) 0))) (and (= (select |c_#valid| |c_ULTIMATE.start_dll_create_#res#1.base|) 1) (not (= .cse0 0)) .cse1 (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (or (= .cse2 1) .cse3) (= |c_ULTIMATE.start_main_~data~0#1| 1) (not .cse3) (exists ((|v_old(#valid)_AFTER_CALL_19| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_19| |c_ULTIMATE.start_dll_create_#res#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_19| .cse0) 1) (= |c_#valid| (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_19| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_19| .cse4 (select |c_#valid| .cse4)))))) (= |c_ULTIMATE.start_dll_create_#res#1.offset| 0) (or .cse1 .cse3) (= (select |c_#valid| .cse0) 1) (= |c_ULTIMATE.start_main_~data~0#1| .cse2)))) is different from true [2024-11-18 13:09:41,490 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse5 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse2 (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|)) (.cse4 (= .cse2 .cse5)) (.cse3 (select (select |c_#memory_$Pointer$#1.base| .cse1) 4))) (and (= (select .cse0 0) 0) (= |c_ULTIMATE.start_dll_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |c_#valid| .cse1) 1) (not (= .cse2 0)) (= (select |c_#valid| .cse3) 1) (= (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (not (= .cse1 .cse3)) (or (= (select (select |c_#memory_int#1| .cse2) 0) 1) .cse4) (= (select |c_#valid| .cse5) 1) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#1.offset| .cse1) 4) 0) (= |c_ULTIMATE.start_dll_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= |c_ULTIMATE.start_main_~data~0#1| 1) (or (= (select (select |c_#memory_$Pointer$#1.offset| .cse5) 4) 0) .cse4) (exists ((|v_old(#valid)_AFTER_CALL_19| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_19| .cse5) 0) (= (select |v_old(#valid)_AFTER_CALL_19| .cse2) 1) (= |c_#valid| (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_19| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_19| .cse6 (select |c_#valid| .cse6)))))) (= |c_ULTIMATE.start_dll_append_~head#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int#1| .cse3) 0)))))) is different from false [2024-11-18 13:09:41,492 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse5 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse2 (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|)) (.cse4 (= .cse2 .cse5)) (.cse3 (select (select |c_#memory_$Pointer$#1.base| .cse1) 4))) (and (= (select .cse0 0) 0) (= |c_ULTIMATE.start_dll_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |c_#valid| .cse1) 1) (not (= .cse2 0)) (= (select |c_#valid| .cse3) 1) (= (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (not (= .cse1 .cse3)) (or (= (select (select |c_#memory_int#1| .cse2) 0) 1) .cse4) (= (select |c_#valid| .cse5) 1) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#1.offset| .cse1) 4) 0) (= |c_ULTIMATE.start_dll_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= |c_ULTIMATE.start_main_~data~0#1| 1) (or (= (select (select |c_#memory_$Pointer$#1.offset| .cse5) 4) 0) .cse4) (exists ((|v_old(#valid)_AFTER_CALL_19| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_19| .cse5) 0) (= (select |v_old(#valid)_AFTER_CALL_19| .cse2) 1) (= |c_#valid| (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_19| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_19| .cse6 (select |c_#valid| .cse6)))))) (= |c_ULTIMATE.start_dll_append_~head#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int#1| .cse3) 0)))))) is different from true [2024-11-18 13:09:41,495 WARN L851 $PredicateComparison]: unable to prove that (and (= |c_#memory_int#1| |c_old(#memory_int#1)|) (= |c_#memory_$Pointer$#1.offset| |c_old(#memory_$Pointer$#1.offset)|) (= |c_node_create_#in~data#1| |c_node_create_~data#1|) (exists ((v_arrayElimCell_58 Int) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_15| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_19| (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (not (= v_arrayElimCell_58 0)) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_19| v_arrayElimCell_58) 1) (= (select |v_old(#valid)_AFTER_CALL_19| .cse0) 0) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_19| |v_#valid_BEFORE_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_19| .cse1 (select |v_#valid_BEFORE_CALL_15| .cse1))) |v_#valid_BEFORE_CALL_15|) (= (select |v_#valid_BEFORE_CALL_15| .cse0) 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 [2024-11-18 13:09:41,497 WARN L873 $PredicateComparison]: unable to prove that (and (= |c_#memory_int#1| |c_old(#memory_int#1)|) (= |c_#memory_$Pointer$#1.offset| |c_old(#memory_$Pointer$#1.offset)|) (= |c_node_create_#in~data#1| |c_node_create_~data#1|) (exists ((v_arrayElimCell_58 Int) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_15| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_19| (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (not (= v_arrayElimCell_58 0)) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_19| v_arrayElimCell_58) 1) (= (select |v_old(#valid)_AFTER_CALL_19| .cse0) 0) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_19| |v_#valid_BEFORE_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_19| .cse1 (select |v_#valid_BEFORE_CALL_15| .cse1))) |v_#valid_BEFORE_CALL_15|) (= (select |v_#valid_BEFORE_CALL_15| .cse0) 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 [2024-11-18 13:09:41,502 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (@diff |c_old(#memory_int#1)| |c_#memory_int#1|)) (.cse5 (@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|)) (.cse1 (select |c_#memory_int#1| |c_node_create_#res#1.base|))) (and (= |c_node_create_#res#1.offset| 0) (= (select |c_old(#valid)| |c_node_create_#res#1.base|) 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))) (= |c_#memory_int#1| (store |c_old(#memory_int#1)| |c_node_create_#res#1.base| .cse1)) (= |c_#memory_int#1| (store |c_old(#memory_int#1)| .cse2 (select |c_#memory_int#1| .cse2))) (or (= |c_#memory_int#1| |c_old(#memory_int#1)|) (= .cse2 |c_node_create_#res#1.base|)) (exists ((v_arrayElimCell_58 Int) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_15| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_19| (Array Int Int))) (let ((.cse3 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (not (= v_arrayElimCell_58 0)) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_19| v_arrayElimCell_58) 1) (= (select |v_old(#valid)_AFTER_CALL_19| .cse3) 0) (= (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_19| |v_#valid_BEFORE_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_19| .cse4 (select |v_#valid_BEFORE_CALL_15| .cse4))) |v_#valid_BEFORE_CALL_15|) (= (select |v_#valid_BEFORE_CALL_15| .cse3) 1)))) (= |c_#memory_$Pointer$#1.base| (store |c_old(#memory_$Pointer$#1.base)| |c_node_create_#res#1.base| (select |c_#memory_$Pointer$#1.base| |c_node_create_#res#1.base|))) (= |c_#memory_$Pointer$#1.offset| (store |c_old(#memory_$Pointer$#1.offset)| |c_node_create_#res#1.base| (select |c_#memory_$Pointer$#1.offset| |c_node_create_#res#1.base|))) (or (= |c_#memory_$Pointer$#1.offset| |c_old(#memory_$Pointer$#1.offset)|) (= (select |c_old(#valid)| .cse5) 0)) (= |c_#memory_$Pointer$#1.offset| (store |c_old(#memory_$Pointer$#1.offset)| .cse5 (select |c_#memory_$Pointer$#1.offset| .cse5))) (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 .cse1 0)))) is different from false [2024-11-18 13:09:41,506 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse2 (@diff |c_old(#memory_int#1)| |c_#memory_int#1|)) (.cse5 (@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|)) (.cse1 (select |c_#memory_int#1| |c_node_create_#res#1.base|))) (and (= |c_node_create_#res#1.offset| 0) (= (select |c_old(#valid)| |c_node_create_#res#1.base|) 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))) (= |c_#memory_int#1| (store |c_old(#memory_int#1)| |c_node_create_#res#1.base| .cse1)) (= |c_#memory_int#1| (store |c_old(#memory_int#1)| .cse2 (select |c_#memory_int#1| .cse2))) (or (= |c_#memory_int#1| |c_old(#memory_int#1)|) (= .cse2 |c_node_create_#res#1.base|)) (exists ((v_arrayElimCell_58 Int) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_15| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_19| (Array Int Int))) (let ((.cse3 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (not (= v_arrayElimCell_58 0)) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_19| v_arrayElimCell_58) 1) (= (select |v_old(#valid)_AFTER_CALL_19| .cse3) 0) (= (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_19| |v_#valid_BEFORE_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_19| .cse4 (select |v_#valid_BEFORE_CALL_15| .cse4))) |v_#valid_BEFORE_CALL_15|) (= (select |v_#valid_BEFORE_CALL_15| .cse3) 1)))) (= |c_#memory_$Pointer$#1.base| (store |c_old(#memory_$Pointer$#1.base)| |c_node_create_#res#1.base| (select |c_#memory_$Pointer$#1.base| |c_node_create_#res#1.base|))) (= |c_#memory_$Pointer$#1.offset| (store |c_old(#memory_$Pointer$#1.offset)| |c_node_create_#res#1.base| (select |c_#memory_$Pointer$#1.offset| |c_node_create_#res#1.base|))) (or (= |c_#memory_$Pointer$#1.offset| |c_old(#memory_$Pointer$#1.offset)|) (= (select |c_old(#valid)| .cse5) 0)) (= |c_#memory_$Pointer$#1.offset| (store |c_old(#memory_$Pointer$#1.offset)| .cse5 (select |c_#memory_$Pointer$#1.offset| .cse5))) (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 .cse1 0)))) is different from true [2024-11-18 13:09:41,515 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse0 (select (select |c_#memory_$Pointer$#1.base| .cse3) 4))) (let ((.cse5 (= .cse0 .cse3)) (.cse2 (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) (= |c_ULTIMATE.start_dll_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= .cse0 0)) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 0) (not (= .cse1 .cse2)) (not (= |c_ULTIMATE.start_dll_append_#t~ret7#1.base| .cse2)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#1.offset| .cse1) 4) 0) (exists ((|v_old(#valid)_AFTER_CALL_20| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_19| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_20| .cse3) 1) (= (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_19| |v_old(#valid)_AFTER_CALL_20|))) (store |v_old(#valid)_AFTER_CALL_19| .cse4 (select |v_old(#valid)_AFTER_CALL_20| .cse4))) |v_old(#valid)_AFTER_CALL_20|) (= (select |v_old(#valid)_AFTER_CALL_19| .cse3) 0) (= (select |v_old(#valid)_AFTER_CALL_19| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_20| |c_ULTIMATE.start_dll_append_#t~ret7#1.base|) 0))) (= |c_ULTIMATE.start_dll_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= |c_ULTIMATE.start_dll_append_#t~ret7#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (or (= |c_ULTIMATE.start_dll_append_#t~ret7#1.base| .cse0) (= (select (select |c_#memory_int#1| .cse0) 0) 1) .cse5) (exists ((|v_old(#valid)_AFTER_CALL_21| (Array Int Int)) (v_arrayElimCell_58 Int) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_15| (Array Int Int))) (let ((.cse6 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (not (= v_arrayElimCell_58 0)) (= (select |v_old(#valid)_AFTER_CALL_21| .cse6) 0) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_21| v_arrayElimCell_58) 1) (= |v_#valid_BEFORE_CALL_15| (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_21| |v_#valid_BEFORE_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_21| .cse7 (select |v_#valid_BEFORE_CALL_15| .cse7)))) (= (select |v_#valid_BEFORE_CALL_15| .cse6) 1)))) (or (= (select (select |c_#memory_$Pointer$#1.offset| .cse3) 4) 0) (= |c_ULTIMATE.start_dll_append_#t~ret7#1.base| .cse3) .cse5) (not (= |c_ULTIMATE.start_dll_append_#t~ret7#1.base| .cse1)) (= |c_ULTIMATE.start_dll_append_~head#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int#1| .cse2) 0)))))) is different from false [2024-11-18 13:09:41,517 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse0 (select (select |c_#memory_$Pointer$#1.base| .cse3) 4))) (let ((.cse5 (= .cse0 .cse3)) (.cse2 (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) (= |c_ULTIMATE.start_dll_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= .cse0 0)) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 0) (not (= .cse1 .cse2)) (not (= |c_ULTIMATE.start_dll_append_#t~ret7#1.base| .cse2)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#1.offset| .cse1) 4) 0) (exists ((|v_old(#valid)_AFTER_CALL_20| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_19| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_20| .cse3) 1) (= (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_19| |v_old(#valid)_AFTER_CALL_20|))) (store |v_old(#valid)_AFTER_CALL_19| .cse4 (select |v_old(#valid)_AFTER_CALL_20| .cse4))) |v_old(#valid)_AFTER_CALL_20|) (= (select |v_old(#valid)_AFTER_CALL_19| .cse3) 0) (= (select |v_old(#valid)_AFTER_CALL_19| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_20| |c_ULTIMATE.start_dll_append_#t~ret7#1.base|) 0))) (= |c_ULTIMATE.start_dll_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= |c_ULTIMATE.start_dll_append_#t~ret7#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (or (= |c_ULTIMATE.start_dll_append_#t~ret7#1.base| .cse0) (= (select (select |c_#memory_int#1| .cse0) 0) 1) .cse5) (exists ((|v_old(#valid)_AFTER_CALL_21| (Array Int Int)) (v_arrayElimCell_58 Int) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_15| (Array Int Int))) (let ((.cse6 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (not (= v_arrayElimCell_58 0)) (= (select |v_old(#valid)_AFTER_CALL_21| .cse6) 0) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_21| v_arrayElimCell_58) 1) (= |v_#valid_BEFORE_CALL_15| (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_21| |v_#valid_BEFORE_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_21| .cse7 (select |v_#valid_BEFORE_CALL_15| .cse7)))) (= (select |v_#valid_BEFORE_CALL_15| .cse6) 1)))) (or (= (select (select |c_#memory_$Pointer$#1.offset| .cse3) 4) 0) (= |c_ULTIMATE.start_dll_append_#t~ret7#1.base| .cse3) .cse5) (not (= |c_ULTIMATE.start_dll_append_#t~ret7#1.base| .cse1)) (= |c_ULTIMATE.start_dll_append_~head#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int#1| .cse2) 0)))))) is different from true [2024-11-18 13:09:41,527 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse0 (select (select |c_#memory_$Pointer$#1.base| .cse2) 4))) (let ((.cse5 (= .cse0 .cse2)) (.cse4 (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) (= |c_ULTIMATE.start_dll_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_append_~new_last~0#1.offset| 0) (not (= .cse0 0)) (not (= .cse1 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) (exists ((|v_old(#valid)_AFTER_CALL_20| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_19| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_20| .cse2) 1) (= (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_19| |v_old(#valid)_AFTER_CALL_20|))) (store |v_old(#valid)_AFTER_CALL_19| .cse3 (select |v_old(#valid)_AFTER_CALL_20| .cse3))) |v_old(#valid)_AFTER_CALL_20|) (= (select |v_old(#valid)_AFTER_CALL_19| .cse2) 0) (= (select |v_old(#valid)_AFTER_CALL_19| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_20| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) 0))) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 0) (not (= .cse1 .cse4)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#1.offset| .cse1) 4) 0) (or (= (select (select |c_#memory_$Pointer$#1.offset| .cse2) 4) 0) (= .cse2 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) .cse5) (= |c_ULTIMATE.start_dll_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= |c_ULTIMATE.start_main_~data~0#1| 1) (or (= .cse0 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) (= (select (select |c_#memory_int#1| .cse0) 0) 1) .cse5) (exists ((|v_old(#valid)_AFTER_CALL_21| (Array Int Int)) (v_arrayElimCell_58 Int) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_15| (Array Int Int))) (let ((.cse6 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (not (= v_arrayElimCell_58 0)) (= (select |v_old(#valid)_AFTER_CALL_21| .cse6) 0) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_21| v_arrayElimCell_58) 1) (= |v_#valid_BEFORE_CALL_15| (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_21| |v_#valid_BEFORE_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_21| .cse7 (select |v_#valid_BEFORE_CALL_15| .cse7)))) (= (select |v_#valid_BEFORE_CALL_15| .cse6) 1)))) (not (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| .cse4)) (= |c_ULTIMATE.start_dll_append_~head#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int#1| .cse4) 0)))))) is different from false [2024-11-18 13:09:41,529 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse0 (select (select |c_#memory_$Pointer$#1.base| .cse2) 4))) (let ((.cse5 (= .cse0 .cse2)) (.cse4 (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) (= |c_ULTIMATE.start_dll_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_append_~new_last~0#1.offset| 0) (not (= .cse0 0)) (not (= .cse1 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) (exists ((|v_old(#valid)_AFTER_CALL_20| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_19| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_20| .cse2) 1) (= (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_19| |v_old(#valid)_AFTER_CALL_20|))) (store |v_old(#valid)_AFTER_CALL_19| .cse3 (select |v_old(#valid)_AFTER_CALL_20| .cse3))) |v_old(#valid)_AFTER_CALL_20|) (= (select |v_old(#valid)_AFTER_CALL_19| .cse2) 0) (= (select |v_old(#valid)_AFTER_CALL_19| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_20| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) 0))) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 0) (not (= .cse1 .cse4)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#1.offset| .cse1) 4) 0) (or (= (select (select |c_#memory_$Pointer$#1.offset| .cse2) 4) 0) (= .cse2 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) .cse5) (= |c_ULTIMATE.start_dll_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= |c_ULTIMATE.start_main_~data~0#1| 1) (or (= .cse0 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) (= (select (select |c_#memory_int#1| .cse0) 0) 1) .cse5) (exists ((|v_old(#valid)_AFTER_CALL_21| (Array Int Int)) (v_arrayElimCell_58 Int) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_15| (Array Int Int))) (let ((.cse6 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (not (= v_arrayElimCell_58 0)) (= (select |v_old(#valid)_AFTER_CALL_21| .cse6) 0) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_21| v_arrayElimCell_58) 1) (= |v_#valid_BEFORE_CALL_15| (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_21| |v_#valid_BEFORE_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_21| .cse7 (select |v_#valid_BEFORE_CALL_15| .cse7)))) (= (select |v_#valid_BEFORE_CALL_15| .cse6) 1)))) (not (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| .cse4)) (= |c_ULTIMATE.start_dll_append_~head#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int#1| .cse4) 0)))))) is different from true [2024-11-18 13:09:41,536 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse1 (select .cse5 0))) (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| .cse1) 4))) (let ((.cse0 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse4 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_append_~last~0#1.base|) 4)) (.cse6 (= .cse2 .cse1))) (and (= (select .cse0 0) 0) (= |c_ULTIMATE.start_dll_append_~new_last~0#1.offset| 0) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse1) (not (= .cse2 0)) (exists ((|v_old(#valid)_AFTER_CALL_20| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_19| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_20| .cse1) 1) (= (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_19| |v_old(#valid)_AFTER_CALL_20|))) (store |v_old(#valid)_AFTER_CALL_19| .cse3 (select |v_old(#valid)_AFTER_CALL_20| .cse3))) |v_old(#valid)_AFTER_CALL_20|) (= (select |v_old(#valid)_AFTER_CALL_19| .cse1) 0) (= (select |v_old(#valid)_AFTER_CALL_19| .cse2) 1) (= (select |v_old(#valid)_AFTER_CALL_20| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) 0))) (= (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int#1| .cse4) 0)) (not (= |c_ULTIMATE.start_dll_append_~last~0#1.base| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) (not (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse4)) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| (select .cse5 |c_ULTIMATE.start_main_~#s~0#1.offset|)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base|) 4) 0) (or (= (select (select |c_#memory_$Pointer$#1.offset| .cse1) 4) 0) (= .cse1 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) .cse6) (not (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| .cse4)) (= |c_ULTIMATE.start_main_~data~0#1| 1) (or (= .cse2 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) (= (select (select |c_#memory_int#1| .cse2) 0) 1) .cse6) (= |c_ULTIMATE.start_dll_append_~last~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_21| (Array Int Int)) (v_arrayElimCell_58 Int) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_15| (Array Int Int))) (let ((.cse7 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (not (= v_arrayElimCell_58 0)) (= (select |v_old(#valid)_AFTER_CALL_21| .cse7) 0) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_21| v_arrayElimCell_58) 1) (= |v_#valid_BEFORE_CALL_15| (let ((.cse8 (@diff |v_old(#valid)_AFTER_CALL_21| |v_#valid_BEFORE_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_21| .cse8 (select |v_#valid_BEFORE_CALL_15| .cse8)))) (= (select |v_#valid_BEFORE_CALL_15| .cse7) 1))))))))) is different from false [2024-11-18 13:09:41,538 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse1 (select .cse5 0))) (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| .cse1) 4))) (let ((.cse0 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse4 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_append_~last~0#1.base|) 4)) (.cse6 (= .cse2 .cse1))) (and (= (select .cse0 0) 0) (= |c_ULTIMATE.start_dll_append_~new_last~0#1.offset| 0) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse1) (not (= .cse2 0)) (exists ((|v_old(#valid)_AFTER_CALL_20| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_19| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_20| .cse1) 1) (= (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_19| |v_old(#valid)_AFTER_CALL_20|))) (store |v_old(#valid)_AFTER_CALL_19| .cse3 (select |v_old(#valid)_AFTER_CALL_20| .cse3))) |v_old(#valid)_AFTER_CALL_20|) (= (select |v_old(#valid)_AFTER_CALL_19| .cse1) 0) (= (select |v_old(#valid)_AFTER_CALL_19| .cse2) 1) (= (select |v_old(#valid)_AFTER_CALL_20| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) 0))) (= (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int#1| .cse4) 0)) (not (= |c_ULTIMATE.start_dll_append_~last~0#1.base| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) (not (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse4)) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| (select .cse5 |c_ULTIMATE.start_main_~#s~0#1.offset|)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base|) 4) 0) (or (= (select (select |c_#memory_$Pointer$#1.offset| .cse1) 4) 0) (= .cse1 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) .cse6) (not (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| .cse4)) (= |c_ULTIMATE.start_main_~data~0#1| 1) (or (= .cse2 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) (= (select (select |c_#memory_int#1| .cse2) 0) 1) .cse6) (= |c_ULTIMATE.start_dll_append_~last~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_21| (Array Int Int)) (v_arrayElimCell_58 Int) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_15| (Array Int Int))) (let ((.cse7 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (not (= v_arrayElimCell_58 0)) (= (select |v_old(#valid)_AFTER_CALL_21| .cse7) 0) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_21| v_arrayElimCell_58) 1) (= |v_#valid_BEFORE_CALL_15| (let ((.cse8 (@diff |v_old(#valid)_AFTER_CALL_21| |v_#valid_BEFORE_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_21| .cse8 (select |v_#valid_BEFORE_CALL_15| .cse8)))) (= (select |v_#valid_BEFORE_CALL_15| .cse7) 1))))))))) is different from true [2024-11-18 13:09:41,546 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse1 (select .cse5 0))) (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| .cse1) 4))) (let ((.cse0 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse4 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_append_~last~0#1.base|) 4)) (.cse6 (= .cse2 .cse1))) (and (= (select .cse0 0) 0) (= |c_ULTIMATE.start_dll_append_~new_last~0#1.offset| 0) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse1) (not (= .cse2 0)) (exists ((|v_old(#valid)_AFTER_CALL_20| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_19| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_20| .cse1) 1) (= (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_19| |v_old(#valid)_AFTER_CALL_20|))) (store |v_old(#valid)_AFTER_CALL_19| .cse3 (select |v_old(#valid)_AFTER_CALL_20| .cse3))) |v_old(#valid)_AFTER_CALL_20|) (= (select |v_old(#valid)_AFTER_CALL_19| .cse1) 0) (= (select |v_old(#valid)_AFTER_CALL_19| .cse2) 1) (= (select |v_old(#valid)_AFTER_CALL_20| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) 0))) (= (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int#1| .cse4) 0)) (not (= |c_ULTIMATE.start_dll_append_~last~0#1.base| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) (not (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse4)) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| (select .cse5 |c_ULTIMATE.start_main_~#s~0#1.offset|)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base|) 4) 0) (or (= (select (select |c_#memory_$Pointer$#1.offset| .cse1) 4) 0) (= .cse1 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) .cse6) (not (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| .cse4)) (= |c_ULTIMATE.start_main_~data~0#1| 1) (or (= .cse2 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) (= (select (select |c_#memory_int#1| .cse2) 0) 1) .cse6) (= |c_ULTIMATE.start_dll_append_~last~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_21| (Array Int Int)) (v_arrayElimCell_58 Int) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_15| (Array Int Int))) (let ((.cse7 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (not (= v_arrayElimCell_58 0)) (= (select |v_old(#valid)_AFTER_CALL_21| .cse7) 0) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_21| v_arrayElimCell_58) 1) (= |v_#valid_BEFORE_CALL_15| (let ((.cse8 (@diff |v_old(#valid)_AFTER_CALL_21| |v_#valid_BEFORE_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_21| .cse8 (select |v_#valid_BEFORE_CALL_15| .cse8)))) (= (select |v_#valid_BEFORE_CALL_15| .cse7) 1)))) (= |c_ULTIMATE.start_dll_append_#t~mem10#1.offset| 0)))))) is different from false [2024-11-18 13:09:41,549 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse1 (select .cse5 0))) (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| .cse1) 4))) (let ((.cse0 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse4 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_append_~last~0#1.base|) 4)) (.cse6 (= .cse2 .cse1))) (and (= (select .cse0 0) 0) (= |c_ULTIMATE.start_dll_append_~new_last~0#1.offset| 0) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse1) (not (= .cse2 0)) (exists ((|v_old(#valid)_AFTER_CALL_20| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_19| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_20| .cse1) 1) (= (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_19| |v_old(#valid)_AFTER_CALL_20|))) (store |v_old(#valid)_AFTER_CALL_19| .cse3 (select |v_old(#valid)_AFTER_CALL_20| .cse3))) |v_old(#valid)_AFTER_CALL_20|) (= (select |v_old(#valid)_AFTER_CALL_19| .cse1) 0) (= (select |v_old(#valid)_AFTER_CALL_19| .cse2) 1) (= (select |v_old(#valid)_AFTER_CALL_20| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) 0))) (= (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int#1| .cse4) 0)) (not (= |c_ULTIMATE.start_dll_append_~last~0#1.base| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) (not (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse4)) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| (select .cse5 |c_ULTIMATE.start_main_~#s~0#1.offset|)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base|) 4) 0) (or (= (select (select |c_#memory_$Pointer$#1.offset| .cse1) 4) 0) (= .cse1 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) .cse6) (not (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| .cse4)) (= |c_ULTIMATE.start_main_~data~0#1| 1) (or (= .cse2 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) (= (select (select |c_#memory_int#1| .cse2) 0) 1) .cse6) (= |c_ULTIMATE.start_dll_append_~last~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_21| (Array Int Int)) (v_arrayElimCell_58 Int) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_15| (Array Int Int))) (let ((.cse7 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (not (= v_arrayElimCell_58 0)) (= (select |v_old(#valid)_AFTER_CALL_21| .cse7) 0) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_21| v_arrayElimCell_58) 1) (= |v_#valid_BEFORE_CALL_15| (let ((.cse8 (@diff |v_old(#valid)_AFTER_CALL_21| |v_#valid_BEFORE_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_21| .cse8 (select |v_#valid_BEFORE_CALL_15| .cse8)))) (= (select |v_#valid_BEFORE_CALL_15| .cse7) 1)))) (= |c_ULTIMATE.start_dll_append_#t~mem10#1.offset| 0)))))) is different from true [2024-11-18 13:09:41,556 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse9 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse2 (select .cse9 0))) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| .cse2) 4))) (let ((.cse0 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse5 (select (select |c_#memory_$Pointer$#1.offset| .cse2) 4)) (.cse6 (= .cse1 .cse2)) (.cse4 (select .cse9 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (and (= (select .cse0 0) 0) (= |c_ULTIMATE.start_dll_append_~new_last~0#1.offset| 0) (not (= .cse1 0)) (exists ((|v_old(#valid)_AFTER_CALL_20| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_19| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_20| .cse2) 1) (= (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_19| |v_old(#valid)_AFTER_CALL_20|))) (store |v_old(#valid)_AFTER_CALL_19| .cse3 (select |v_old(#valid)_AFTER_CALL_20| .cse3))) |v_old(#valid)_AFTER_CALL_20|) (= (select |v_old(#valid)_AFTER_CALL_19| .cse2) 0) (= (select |v_old(#valid)_AFTER_CALL_19| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_20| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) 0))) (= (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (not (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse4)) (<= .cse5 |c_ULTIMATE.start_dll_append_~last~0#1.offset|) (not (= |c_ULTIMATE.start_dll_append_~last~0#1.base| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) (not (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| .cse4)) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse1) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (or (= .cse5 0) (= .cse2 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) .cse6) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| (select (select |c_#memory_$Pointer$#1.base| .cse4) 4)) (= |c_ULTIMATE.start_main_~data~0#1| 1) (or (= .cse1 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) (= (select (select |c_#memory_int#1| .cse1) 0) 1) .cse6) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int#1| |c_ULTIMATE.start_dll_append_~last~0#1.base|) 0)) (exists ((|v_old(#valid)_AFTER_CALL_21| (Array Int Int)) (v_arrayElimCell_58 Int) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_15| (Array Int Int))) (let ((.cse7 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (not (= v_arrayElimCell_58 0)) (= (select |v_old(#valid)_AFTER_CALL_21| .cse7) 0) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_21| v_arrayElimCell_58) 1) (= |v_#valid_BEFORE_CALL_15| (let ((.cse8 (@diff |v_old(#valid)_AFTER_CALL_21| |v_#valid_BEFORE_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_21| .cse8 (select |v_#valid_BEFORE_CALL_15| .cse8)))) (= (select |v_#valid_BEFORE_CALL_15| .cse7) 1)))) (not (= (+ |c_ULTIMATE.start_dll_append_~last~0#1.offset| 4) 0)) (= (select (select |c_#memory_$Pointer$#1.offset| .cse4) 4) 0)))))) is different from false [2024-11-18 13:09:41,558 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse9 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse2 (select .cse9 0))) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| .cse2) 4))) (let ((.cse0 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse5 (select (select |c_#memory_$Pointer$#1.offset| .cse2) 4)) (.cse6 (= .cse1 .cse2)) (.cse4 (select .cse9 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (and (= (select .cse0 0) 0) (= |c_ULTIMATE.start_dll_append_~new_last~0#1.offset| 0) (not (= .cse1 0)) (exists ((|v_old(#valid)_AFTER_CALL_20| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_19| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_20| .cse2) 1) (= (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_19| |v_old(#valid)_AFTER_CALL_20|))) (store |v_old(#valid)_AFTER_CALL_19| .cse3 (select |v_old(#valid)_AFTER_CALL_20| .cse3))) |v_old(#valid)_AFTER_CALL_20|) (= (select |v_old(#valid)_AFTER_CALL_19| .cse2) 0) (= (select |v_old(#valid)_AFTER_CALL_19| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_20| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) 0))) (= (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (not (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse4)) (<= .cse5 |c_ULTIMATE.start_dll_append_~last~0#1.offset|) (not (= |c_ULTIMATE.start_dll_append_~last~0#1.base| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) (not (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| .cse4)) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse1) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (or (= .cse5 0) (= .cse2 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) .cse6) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| (select (select |c_#memory_$Pointer$#1.base| .cse4) 4)) (= |c_ULTIMATE.start_main_~data~0#1| 1) (or (= .cse1 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) (= (select (select |c_#memory_int#1| .cse1) 0) 1) .cse6) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int#1| |c_ULTIMATE.start_dll_append_~last~0#1.base|) 0)) (exists ((|v_old(#valid)_AFTER_CALL_21| (Array Int Int)) (v_arrayElimCell_58 Int) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_15| (Array Int Int))) (let ((.cse7 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (not (= v_arrayElimCell_58 0)) (= (select |v_old(#valid)_AFTER_CALL_21| .cse7) 0) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_21| v_arrayElimCell_58) 1) (= |v_#valid_BEFORE_CALL_15| (let ((.cse8 (@diff |v_old(#valid)_AFTER_CALL_21| |v_#valid_BEFORE_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_21| .cse8 (select |v_#valid_BEFORE_CALL_15| .cse8)))) (= (select |v_#valid_BEFORE_CALL_15| .cse7) 1)))) (not (= (+ |c_ULTIMATE.start_dll_append_~last~0#1.offset| 4) 0)) (= (select (select |c_#memory_$Pointer$#1.offset| .cse4) 4) 0)))))) is different from true [2024-11-18 13:09:41,566 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse10 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse3 (select .cse10 0))) (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| .cse3) 4))) (let ((.cse0 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse6 (select (select |c_#memory_$Pointer$#1.offset| .cse3) 4)) (.cse7 (= .cse2 .cse3)) (.cse1 (+ |c_ULTIMATE.start_dll_append_~last~0#1.offset| 4)) (.cse5 (select .cse10 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (and (= (select .cse0 0) 0) (= |c_ULTIMATE.start_dll_append_#t~mem10#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_append_~last~0#1.base|) .cse1)) (= |c_ULTIMATE.start_dll_append_~new_last~0#1.offset| 0) (not (= .cse2 0)) (exists ((|v_old(#valid)_AFTER_CALL_20| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_19| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_20| .cse3) 1) (= (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_19| |v_old(#valid)_AFTER_CALL_20|))) (store |v_old(#valid)_AFTER_CALL_19| .cse4 (select |v_old(#valid)_AFTER_CALL_20| .cse4))) |v_old(#valid)_AFTER_CALL_20|) (= (select |v_old(#valid)_AFTER_CALL_19| .cse3) 0) (= (select |v_old(#valid)_AFTER_CALL_19| .cse2) 1) (= (select |v_old(#valid)_AFTER_CALL_20| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) 0))) (= (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (not (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse5)) (<= .cse6 |c_ULTIMATE.start_dll_append_~last~0#1.offset|) (not (= |c_ULTIMATE.start_dll_append_~last~0#1.base| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) (not (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| .cse5)) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse2) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (or (= .cse6 0) (= .cse3 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) .cse7) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| (select (select |c_#memory_$Pointer$#1.base| .cse5) 4)) (= |c_ULTIMATE.start_main_~data~0#1| 1) (or (= .cse2 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) (= (select (select |c_#memory_int#1| .cse2) 0) 1) .cse7) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int#1| |c_ULTIMATE.start_dll_append_~last~0#1.base|) 0)) (exists ((|v_old(#valid)_AFTER_CALL_21| (Array Int Int)) (v_arrayElimCell_58 Int) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_15| (Array Int Int))) (let ((.cse8 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (not (= v_arrayElimCell_58 0)) (= (select |v_old(#valid)_AFTER_CALL_21| .cse8) 0) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_21| v_arrayElimCell_58) 1) (= |v_#valid_BEFORE_CALL_15| (let ((.cse9 (@diff |v_old(#valid)_AFTER_CALL_21| |v_#valid_BEFORE_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_21| .cse9 (select |v_#valid_BEFORE_CALL_15| .cse9)))) (= (select |v_#valid_BEFORE_CALL_15| .cse8) 1)))) (not (= .cse1 0)) (= (select (select |c_#memory_$Pointer$#1.offset| .cse5) 4) 0)))))) is different from false [2024-11-18 13:09:41,570 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse10 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse3 (select .cse10 0))) (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| .cse3) 4))) (let ((.cse0 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse6 (select (select |c_#memory_$Pointer$#1.offset| .cse3) 4)) (.cse7 (= .cse2 .cse3)) (.cse1 (+ |c_ULTIMATE.start_dll_append_~last~0#1.offset| 4)) (.cse5 (select .cse10 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (and (= (select .cse0 0) 0) (= |c_ULTIMATE.start_dll_append_#t~mem10#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_append_~last~0#1.base|) .cse1)) (= |c_ULTIMATE.start_dll_append_~new_last~0#1.offset| 0) (not (= .cse2 0)) (exists ((|v_old(#valid)_AFTER_CALL_20| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_19| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_20| .cse3) 1) (= (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_19| |v_old(#valid)_AFTER_CALL_20|))) (store |v_old(#valid)_AFTER_CALL_19| .cse4 (select |v_old(#valid)_AFTER_CALL_20| .cse4))) |v_old(#valid)_AFTER_CALL_20|) (= (select |v_old(#valid)_AFTER_CALL_19| .cse3) 0) (= (select |v_old(#valid)_AFTER_CALL_19| .cse2) 1) (= (select |v_old(#valid)_AFTER_CALL_20| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) 0))) (= (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (not (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse5)) (<= .cse6 |c_ULTIMATE.start_dll_append_~last~0#1.offset|) (not (= |c_ULTIMATE.start_dll_append_~last~0#1.base| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) (not (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| .cse5)) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse2) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (or (= .cse6 0) (= .cse3 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) .cse7) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| (select (select |c_#memory_$Pointer$#1.base| .cse5) 4)) (= |c_ULTIMATE.start_main_~data~0#1| 1) (or (= .cse2 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) (= (select (select |c_#memory_int#1| .cse2) 0) 1) .cse7) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int#1| |c_ULTIMATE.start_dll_append_~last~0#1.base|) 0)) (exists ((|v_old(#valid)_AFTER_CALL_21| (Array Int Int)) (v_arrayElimCell_58 Int) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_15| (Array Int Int))) (let ((.cse8 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (not (= v_arrayElimCell_58 0)) (= (select |v_old(#valid)_AFTER_CALL_21| .cse8) 0) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_21| v_arrayElimCell_58) 1) (= |v_#valid_BEFORE_CALL_15| (let ((.cse9 (@diff |v_old(#valid)_AFTER_CALL_21| |v_#valid_BEFORE_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_21| .cse9 (select |v_#valid_BEFORE_CALL_15| .cse9)))) (= (select |v_#valid_BEFORE_CALL_15| .cse8) 1)))) (not (= .cse1 0)) (= (select (select |c_#memory_$Pointer$#1.offset| .cse5) 4) 0)))))) is different from true [2024-11-18 13:09:41,577 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse10 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse2 (select .cse10 0))) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| .cse2) 4))) (let ((.cse0 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse5 (select (select |c_#memory_$Pointer$#1.offset| .cse2) 4)) (.cse7 (= .cse1 .cse2)) (.cse6 (+ |c_ULTIMATE.start_dll_append_~last~0#1.offset| 4)) (.cse4 (select .cse10 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (and (= (select .cse0 0) 0) (= |c_ULTIMATE.start_dll_append_~new_last~0#1.offset| 0) (not (= .cse1 0)) (exists ((|v_old(#valid)_AFTER_CALL_20| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_19| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_20| .cse2) 1) (= (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_19| |v_old(#valid)_AFTER_CALL_20|))) (store |v_old(#valid)_AFTER_CALL_19| .cse3 (select |v_old(#valid)_AFTER_CALL_20| .cse3))) |v_old(#valid)_AFTER_CALL_20|) (= (select |v_old(#valid)_AFTER_CALL_19| .cse2) 0) (= (select |v_old(#valid)_AFTER_CALL_19| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_20| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) 0))) (= (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (not (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse4)) (<= .cse5 |c_ULTIMATE.start_dll_append_~last~0#1.offset|) (not (= |c_ULTIMATE.start_dll_append_~last~0#1.base| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) (= (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_append_~last~0#1.base|) .cse6) 0) (not (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| .cse4)) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse1) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (or (= .cse5 0) (= .cse2 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) .cse7) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| (select (select |c_#memory_$Pointer$#1.base| .cse4) 4)) (= |c_ULTIMATE.start_main_~data~0#1| 1) (or (= .cse1 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) (= (select (select |c_#memory_int#1| .cse1) 0) 1) .cse7) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int#1| |c_ULTIMATE.start_dll_append_~last~0#1.base|) 0)) (exists ((|v_old(#valid)_AFTER_CALL_21| (Array Int Int)) (v_arrayElimCell_58 Int) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_15| (Array Int Int))) (let ((.cse8 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (not (= v_arrayElimCell_58 0)) (= (select |v_old(#valid)_AFTER_CALL_21| .cse8) 0) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_21| v_arrayElimCell_58) 1) (= |v_#valid_BEFORE_CALL_15| (let ((.cse9 (@diff |v_old(#valid)_AFTER_CALL_21| |v_#valid_BEFORE_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_21| .cse9 (select |v_#valid_BEFORE_CALL_15| .cse9)))) (= (select |v_#valid_BEFORE_CALL_15| .cse8) 1)))) (not (= .cse6 0)) (= (select (select |c_#memory_$Pointer$#1.offset| .cse4) 4) 0)))))) is different from false [2024-11-18 13:09:41,579 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse10 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse2 (select .cse10 0))) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| .cse2) 4))) (let ((.cse0 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse5 (select (select |c_#memory_$Pointer$#1.offset| .cse2) 4)) (.cse7 (= .cse1 .cse2)) (.cse6 (+ |c_ULTIMATE.start_dll_append_~last~0#1.offset| 4)) (.cse4 (select .cse10 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (and (= (select .cse0 0) 0) (= |c_ULTIMATE.start_dll_append_~new_last~0#1.offset| 0) (not (= .cse1 0)) (exists ((|v_old(#valid)_AFTER_CALL_20| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_19| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_20| .cse2) 1) (= (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_19| |v_old(#valid)_AFTER_CALL_20|))) (store |v_old(#valid)_AFTER_CALL_19| .cse3 (select |v_old(#valid)_AFTER_CALL_20| .cse3))) |v_old(#valid)_AFTER_CALL_20|) (= (select |v_old(#valid)_AFTER_CALL_19| .cse2) 0) (= (select |v_old(#valid)_AFTER_CALL_19| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_20| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) 0))) (= (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (not (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse4)) (<= .cse5 |c_ULTIMATE.start_dll_append_~last~0#1.offset|) (not (= |c_ULTIMATE.start_dll_append_~last~0#1.base| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) (= (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_append_~last~0#1.base|) .cse6) 0) (not (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| .cse4)) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse1) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (or (= .cse5 0) (= .cse2 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) .cse7) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| (select (select |c_#memory_$Pointer$#1.base| .cse4) 4)) (= |c_ULTIMATE.start_main_~data~0#1| 1) (or (= .cse1 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) (= (select (select |c_#memory_int#1| .cse1) 0) 1) .cse7) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int#1| |c_ULTIMATE.start_dll_append_~last~0#1.base|) 0)) (exists ((|v_old(#valid)_AFTER_CALL_21| (Array Int Int)) (v_arrayElimCell_58 Int) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_15| (Array Int Int))) (let ((.cse8 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (not (= v_arrayElimCell_58 0)) (= (select |v_old(#valid)_AFTER_CALL_21| .cse8) 0) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_21| v_arrayElimCell_58) 1) (= |v_#valid_BEFORE_CALL_15| (let ((.cse9 (@diff |v_old(#valid)_AFTER_CALL_21| |v_#valid_BEFORE_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_21| .cse9 (select |v_#valid_BEFORE_CALL_15| .cse9)))) (= (select |v_#valid_BEFORE_CALL_15| .cse8) 1)))) (not (= .cse6 0)) (= (select (select |c_#memory_$Pointer$#1.offset| .cse4) 4) 0)))))) is different from true [2024-11-18 13:09:41,587 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse8 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse1 (select .cse8 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| .cse1) 4)) (.cse5 (select .cse8 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (and (= (select .cse0 0) 0) (exists ((|v_old(#valid)_AFTER_CALL_20| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~last~0#1.offset_23| Int) (|v_old(#valid)_AFTER_CALL_19| (Array Int Int))) (let ((.cse3 (+ |v_ULTIMATE.start_dll_append_~last~0#1.offset_23| 4))) (and (= (select |v_old(#valid)_AFTER_CALL_20| .cse1) 1) (= (select (select |c_#memory_$Pointer$#1.offset| .cse2) .cse3) 0) (= (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_19| |v_old(#valid)_AFTER_CALL_20|))) (store |v_old(#valid)_AFTER_CALL_19| .cse4 (select |v_old(#valid)_AFTER_CALL_20| .cse4))) |v_old(#valid)_AFTER_CALL_20|) (= (select |v_old(#valid)_AFTER_CALL_19| .cse1) 0) (= (select |v_old(#valid)_AFTER_CALL_20| (select (select |c_#memory_$Pointer$#1.base| .cse2) .cse3)) 0) (= (select |v_old(#valid)_AFTER_CALL_19| .cse2) 1) (<= 0 |v_ULTIMATE.start_dll_append_~last~0#1.offset_23|)))) (not (= .cse2 0)) (= (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (or (= (select (select |c_#memory_int#1| .cse2) 0) 1) (= .cse2 .cse1)) (= |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| (select (select |c_#memory_int#1| (select (select |c_#memory_$Pointer$#1.base| .cse5) 4)) 0)) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_old(#valid)_AFTER_CALL_21| (Array Int Int)) (v_arrayElimCell_58 Int) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_15| (Array Int Int))) (let ((.cse6 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (not (= v_arrayElimCell_58 0)) (= (select |v_old(#valid)_AFTER_CALL_21| .cse6) 0) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_21| v_arrayElimCell_58) 1) (= |v_#valid_BEFORE_CALL_15| (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_21| |v_#valid_BEFORE_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_21| .cse7 (select |v_#valid_BEFORE_CALL_15| .cse7)))) (= (select |v_#valid_BEFORE_CALL_15| .cse6) 1)))) (= (select (select |c_#memory_$Pointer$#1.offset| .cse5) 4) 0))))) is different from false [2024-11-18 13:09:41,590 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse8 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse1 (select .cse8 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| .cse1) 4)) (.cse5 (select .cse8 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (and (= (select .cse0 0) 0) (exists ((|v_old(#valid)_AFTER_CALL_20| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~last~0#1.offset_23| Int) (|v_old(#valid)_AFTER_CALL_19| (Array Int Int))) (let ((.cse3 (+ |v_ULTIMATE.start_dll_append_~last~0#1.offset_23| 4))) (and (= (select |v_old(#valid)_AFTER_CALL_20| .cse1) 1) (= (select (select |c_#memory_$Pointer$#1.offset| .cse2) .cse3) 0) (= (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_19| |v_old(#valid)_AFTER_CALL_20|))) (store |v_old(#valid)_AFTER_CALL_19| .cse4 (select |v_old(#valid)_AFTER_CALL_20| .cse4))) |v_old(#valid)_AFTER_CALL_20|) (= (select |v_old(#valid)_AFTER_CALL_19| .cse1) 0) (= (select |v_old(#valid)_AFTER_CALL_20| (select (select |c_#memory_$Pointer$#1.base| .cse2) .cse3)) 0) (= (select |v_old(#valid)_AFTER_CALL_19| .cse2) 1) (<= 0 |v_ULTIMATE.start_dll_append_~last~0#1.offset_23|)))) (not (= .cse2 0)) (= (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (or (= (select (select |c_#memory_int#1| .cse2) 0) 1) (= .cse2 .cse1)) (= |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| (select (select |c_#memory_int#1| (select (select |c_#memory_$Pointer$#1.base| .cse5) 4)) 0)) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_old(#valid)_AFTER_CALL_21| (Array Int Int)) (v_arrayElimCell_58 Int) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_15| (Array Int Int))) (let ((.cse6 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 0))) (and (not (= v_arrayElimCell_58 0)) (= (select |v_old(#valid)_AFTER_CALL_21| .cse6) 0) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_21| v_arrayElimCell_58) 1) (= |v_#valid_BEFORE_CALL_15| (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_21| |v_#valid_BEFORE_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_21| .cse7 (select |v_#valid_BEFORE_CALL_15| .cse7)))) (= (select |v_#valid_BEFORE_CALL_15| .cse6) 1)))) (= (select (select |c_#memory_$Pointer$#1.offset| .cse5) 4) 0))))) is different from true [2024-11-18 13:09:41,597 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~ptr~0#1.base|) 4))) (let ((.cse1 (select (select |c_#memory_int#1| .cse0) 0))) (and (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (or (= .cse0 |c_ULTIMATE.start_main_~ptr~0#1.base|) (= .cse1 1)) (not (= .cse0 0)) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~ptr~0#1.base|) 4) 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_old(#valid)_AFTER_CALL_20| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~last~0#1.offset_23| Int) (|v_old(#valid)_AFTER_CALL_19| (Array Int Int))) (let ((.cse2 (+ |v_ULTIMATE.start_dll_append_~last~0#1.offset_23| 4))) (and (= 0 (select |v_old(#valid)_AFTER_CALL_20| (select (select |c_#memory_$Pointer$#1.base| .cse0) .cse2))) (= (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_19| |v_old(#valid)_AFTER_CALL_20|))) (store |v_old(#valid)_AFTER_CALL_19| .cse3 (select |v_old(#valid)_AFTER_CALL_20| .cse3))) |v_old(#valid)_AFTER_CALL_20|) (= (select |v_old(#valid)_AFTER_CALL_19| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_19| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (<= 0 |v_ULTIMATE.start_dll_append_~last~0#1.offset_23|) (= (select (select |c_#memory_$Pointer$#1.offset| .cse0) .cse2) 0) (= (select |v_old(#valid)_AFTER_CALL_20| |c_ULTIMATE.start_main_~ptr~0#1.base|) 1)))) (= |c_ULTIMATE.start_main_~data~0#1| .cse1)))) is different from false [2024-11-18 13:09:41,598 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~ptr~0#1.base|) 4))) (let ((.cse1 (select (select |c_#memory_int#1| .cse0) 0))) (and (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (or (= .cse0 |c_ULTIMATE.start_main_~ptr~0#1.base|) (= .cse1 1)) (not (= .cse0 0)) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~ptr~0#1.base|) 4) 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_old(#valid)_AFTER_CALL_20| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~last~0#1.offset_23| Int) (|v_old(#valid)_AFTER_CALL_19| (Array Int Int))) (let ((.cse2 (+ |v_ULTIMATE.start_dll_append_~last~0#1.offset_23| 4))) (and (= 0 (select |v_old(#valid)_AFTER_CALL_20| (select (select |c_#memory_$Pointer$#1.base| .cse0) .cse2))) (= (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_19| |v_old(#valid)_AFTER_CALL_20|))) (store |v_old(#valid)_AFTER_CALL_19| .cse3 (select |v_old(#valid)_AFTER_CALL_20| .cse3))) |v_old(#valid)_AFTER_CALL_20|) (= (select |v_old(#valid)_AFTER_CALL_19| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_19| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (<= 0 |v_ULTIMATE.start_dll_append_~last~0#1.offset_23|) (= (select (select |c_#memory_$Pointer$#1.offset| .cse0) .cse2) 0) (= (select |v_old(#valid)_AFTER_CALL_20| |c_ULTIMATE.start_main_~ptr~0#1.base|) 1)))) (= |c_ULTIMATE.start_main_~data~0#1| .cse1)))) is different from true [2024-11-18 13:09:41,629 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int#1| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0))) (and (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| .cse0) (= .cse0 1) (= |c_ULTIMATE.start_main_~data~0#1| 1) (not (= |c_ULTIMATE.start_main_~ptr~0#1.base| 0)) (exists ((|v_old(#valid)_AFTER_CALL_20| (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.base_18| Int) (v_arrayElimCell_79 Int) (|v_old(#valid)_AFTER_CALL_19| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_20| |v_ULTIMATE.start_main_~ptr~0#1.base_18|) 1) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_19| |v_old(#valid)_AFTER_CALL_20|))) (store |v_old(#valid)_AFTER_CALL_19| .cse1 (select |v_old(#valid)_AFTER_CALL_20| .cse1))) |v_old(#valid)_AFTER_CALL_20|) (= (select |v_old(#valid)_AFTER_CALL_19| |c_ULTIMATE.start_main_~ptr~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_20| v_arrayElimCell_79) 0) (= (select |v_old(#valid)_AFTER_CALL_19| |v_ULTIMATE.start_main_~ptr~0#1.base_18|) 0))))) is different from false [2024-11-18 13:09:41,630 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int#1| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0))) (and (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| .cse0) (= .cse0 1) (= |c_ULTIMATE.start_main_~data~0#1| 1) (not (= |c_ULTIMATE.start_main_~ptr~0#1.base| 0)) (exists ((|v_old(#valid)_AFTER_CALL_20| (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.base_18| Int) (v_arrayElimCell_79 Int) (|v_old(#valid)_AFTER_CALL_19| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_20| |v_ULTIMATE.start_main_~ptr~0#1.base_18|) 1) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_19| |v_old(#valid)_AFTER_CALL_20|))) (store |v_old(#valid)_AFTER_CALL_19| .cse1 (select |v_old(#valid)_AFTER_CALL_20| .cse1))) |v_old(#valid)_AFTER_CALL_20|) (= (select |v_old(#valid)_AFTER_CALL_19| |c_ULTIMATE.start_main_~ptr~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_20| v_arrayElimCell_79) 0) (= (select |v_old(#valid)_AFTER_CALL_19| |v_ULTIMATE.start_main_~ptr~0#1.base_18|) 0))))) is different from true [2024-11-18 13:09:41,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 13:09:41,711 INFO L93 Difference]: Finished difference Result 75 states and 84 transitions. [2024-11-18 13:09:41,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-11-18 13:09:41,711 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 50 states have (on average 1.32) internal successors, (66), 43 states have internal predecessors, (66), 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 44 [2024-11-18 13:09:41,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 13:09:41,712 INFO L225 Difference]: With dead ends: 75 [2024-11-18 13:09:41,712 INFO L226 Difference]: Without dead ends: 73 [2024-11-18 13:09:41,713 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 82 ConstructedPredicates, 40 IntricatePredicates, 0 DeprecatedPredicates, 233 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=209, Invalid=1767, Unknown=76, NotChecked=4920, Total=6972 [2024-11-18 13:09:41,714 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 6 mSDsluCounter, 358 mSDsCounter, 0 mSdLazyCounter, 374 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 383 SdHoareTripleChecker+Invalid, 2320 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 374 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1942 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-18 13:09:41,714 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 383 Invalid, 2320 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 374 Invalid, 0 Unknown, 1942 Unchecked, 0.3s Time] [2024-11-18 13:09:41,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2024-11-18 13:09:41,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2024-11-18 13:09:41,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 64 states have (on average 1.125) internal successors, (72), 64 states have internal predecessors, (72), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-18 13:09:41,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 82 transitions. [2024-11-18 13:09:41,732 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 82 transitions. Word has length 44 [2024-11-18 13:09:41,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 13:09:41,732 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 82 transitions. [2024-11-18 13:09:41,732 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 50 states have (on average 1.32) internal successors, (66), 43 states have internal predecessors, (66), 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) [2024-11-18 13:09:41,733 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 82 transitions. [2024-11-18 13:09:41,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-18 13:09:41,734 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 13:09:41,734 INFO L215 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, 1, 1, 1, 1, 1] [2024-11-18 13:09:41,749 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-18 13:09:41,934 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 13:09:41,934 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 13:09:41,935 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 13:09:41,935 INFO L85 PathProgramCache]: Analyzing trace with hash 478170515, now seen corresponding path program 2 times [2024-11-18 13:09:41,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 13:09:41,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [695169362] [2024-11-18 13:09:41,935 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-18 13:09:41,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 13:09:42,004 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-18 13:09:42,005 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-18 13:09:43,889 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 7 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 13:09:43,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 13:09:43,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [695169362] [2024-11-18 13:09:43,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [695169362] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 13:09:43,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1827287999] [2024-11-18 13:09:43,889 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-18 13:09:43,890 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 13:09:43,890 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 13:09:43,891 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) [2024-11-18 13:09:43,891 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-18 13:09:44,043 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-18 13:09:44,043 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-18 13:09:44,048 INFO L255 TraceCheckSpWp]: Trace formula consists of 413 conjuncts, 147 conjuncts are in the unsatisfiable core [2024-11-18 13:09:44,052 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 13:09:44,089 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 [2024-11-18 13:09:44,144 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 [2024-11-18 13:09:44,321 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 [2024-11-18 13:09:44,382 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-18 13:09:44,382 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 [2024-11-18 13:09:44,401 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-18 13:09:44,401 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 [2024-11-18 13:09:44,470 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 [2024-11-18 13:09:44,478 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 11 [2024-11-18 13:09:44,482 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 17 treesize of output 19 [2024-11-18 13:09:44,486 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2024-11-18 13:09:44,554 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-18 13:09:44,555 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 88 treesize of output 75 [2024-11-18 13:09:44,560 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 25 [2024-11-18 13:09:44,566 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2024-11-18 13:09:44,863 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 [2024-11-18 13:09:44,868 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 [2024-11-18 13:09:44,872 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 [2024-11-18 13:09:44,875 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 [2024-11-18 13:09:45,102 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2024-11-18 13:09:45,102 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 [2024-11-18 13:09:45,114 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-18 13:09:45,115 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 [2024-11-18 13:09:45,134 INFO L349 Elim1Store]: treesize reduction 48, result has 47.3 percent of original size [2024-11-18 13:09:45,134 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 53 [2024-11-18 13:09:45,160 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2024-11-18 13:09:45,160 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 [2024-11-18 13:09:45,487 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 55 treesize of output 23 [2024-11-18 13:09:45,602 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 19 treesize of output 7 [2024-11-18 13:09:45,698 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 23 [2024-11-18 13:09:45,712 INFO L349 Elim1Store]: treesize reduction 49, result has 2.0 percent of original size [2024-11-18 13:09:45,712 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 1 [2024-11-18 13:09:45,785 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 [2024-11-18 13:09:45,870 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 10 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 13:09:45,871 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-18 13:09:45,880 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1555 (Array Int Int)) (v_ArrVal_1554 (Array Int Int)) (|ULTIMATE.start_dll_append_~last~0#1.base| Int)) (or (not (= (let ((.cse0 (+ |c_ULTIMATE.start_dll_append_~last~0#1.offset| 4))) (store (select |c_#memory_int#1| |ULTIMATE.start_dll_append_~last~0#1.base|) .cse0 (select v_ArrVal_1555 .cse0))) v_ArrVal_1555)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#1| |ULTIMATE.start_dll_append_~last~0#1.base| v_ArrVal_1555) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1554) (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|))))) is different from false [2024-11-18 13:09:45,894 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_append_~last~0#1.base_33| Int) (v_ArrVal_1555 (Array Int Int)) (v_ArrVal_1554 (Array Int Int))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#1| |v_ULTIMATE.start_dll_append_~last~0#1.base_33| v_ArrVal_1555) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1554) (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 (+ (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base|) (+ |c_ULTIMATE.start_dll_append_~last~0#1.offset| 4)) 4))) (store (select |c_#memory_int#1| |v_ULTIMATE.start_dll_append_~last~0#1.base_33|) .cse0 (select v_ArrVal_1555 .cse0))) v_ArrVal_1555)))) is different from false [2024-11-18 13:09:45,905 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_append_~last~0#1.base_33| Int) (v_ArrVal_1555 (Array Int Int)) (v_ArrVal_1554 (Array Int Int))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#1| |v_ULTIMATE.start_dll_append_~last~0#1.base_33| v_ArrVal_1555) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1554) (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 (+ (let ((.cse1 (+ |c_ULTIMATE.start_dll_append_~last~0#1.offset| 4))) (select (select |c_#memory_$Pointer$#1.offset| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_append_~last~0#1.base|) .cse1)) (+ (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base|) .cse1) 4))) 4))) (store (select |c_#memory_int#1| |v_ULTIMATE.start_dll_append_~last~0#1.base_33|) .cse0 (select v_ArrVal_1555 .cse0))) v_ArrVal_1555)))) is different from false [2024-11-18 13:09:45,919 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_append_~last~0#1.base_33| Int) (v_ArrVal_1555 (Array Int Int)) (v_ArrVal_1554 (Array Int Int))) (or (not (= (let ((.cse0 (+ (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse2 (+ (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 4))) (select (select |c_#memory_$Pointer$#1.offset| (select (select |c_#memory_$Pointer$#1.base| .cse1) .cse2)) (+ (select (select |c_#memory_$Pointer$#1.offset| .cse1) .cse2) 4))) 4))) (store (select |c_#memory_int#1| |v_ULTIMATE.start_dll_append_~last~0#1.base_33|) .cse0 (select v_ArrVal_1555 .cse0))) v_ArrVal_1555)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#1| |v_ULTIMATE.start_dll_append_~last~0#1.base_33| v_ArrVal_1555) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1554) (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|))))) is different from false [2024-11-18 13:09:45,928 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_append_~last~0#1.base_33| Int) (v_ArrVal_1555 (Array Int Int)) (v_ArrVal_1554 (Array Int Int))) (or (not (= (let ((.cse0 (+ (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse2 (+ (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 4))) (select (select |c_#memory_$Pointer$#1.offset| (select (select |c_#memory_$Pointer$#1.base| .cse1) .cse2)) (+ (select (select |c_#memory_$Pointer$#1.offset| .cse1) .cse2) 4))) 4))) (store (select |c_#memory_int#1| |v_ULTIMATE.start_dll_append_~last~0#1.base_33|) .cse0 (select v_ArrVal_1555 .cse0))) v_ArrVal_1555)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#1| |v_ULTIMATE.start_dll_append_~last~0#1.base_33| v_ArrVal_1555) |c_ULTIMATE.start_dll_append_#t~ret7#1.base| v_ArrVal_1554) (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|))))) is different from false [2024-11-18 13:09:46,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1827287999] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 13:09:46,091 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-18 13:09:46,091 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 28] total 53 [2024-11-18 13:09:46,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [686133236] [2024-11-18 13:09:46,091 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-18 13:09:46,091 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2024-11-18 13:09:46,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 13:09:46,092 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2024-11-18 13:09:46,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=2718, Unknown=5, NotChecked=540, Total=3422 [2024-11-18 13:09:46,093 INFO L87 Difference]: Start difference. First operand 73 states and 82 transitions. Second operand has 53 states, 51 states have (on average 1.3725490196078431) internal successors, (70), 43 states have internal predecessors, (70), 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) [2024-11-18 13:09:48,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 13:09:48,190 INFO L93 Difference]: Finished difference Result 87 states and 98 transitions. [2024-11-18 13:09:48,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-11-18 13:09:48,191 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 51 states have (on average 1.3725490196078431) internal successors, (70), 43 states have internal predecessors, (70), 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 44 [2024-11-18 13:09:48,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 13:09:48,191 INFO L225 Difference]: With dead ends: 87 [2024-11-18 13:09:48,191 INFO L226 Difference]: Without dead ends: 85 [2024-11-18 13:09:48,192 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 1096 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=355, Invalid=5822, Unknown=5, NotChecked=790, Total=6972 [2024-11-18 13:09:48,193 INFO L432 NwaCegarLoop]: 16 mSDtfsCounter, 37 mSDsluCounter, 411 mSDsCounter, 0 mSdLazyCounter, 1255 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 427 SdHoareTripleChecker+Invalid, 1276 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 1255 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-18 13:09:48,194 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 427 Invalid, 1276 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 1255 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-18 13:09:48,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2024-11-18 13:09:48,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 75. [2024-11-18 13:09:48,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 66 states have (on average 1.1363636363636365) internal successors, (75), 66 states have internal predecessors, (75), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-18 13:09:48,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 85 transitions. [2024-11-18 13:09:48,203 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 85 transitions. Word has length 44 [2024-11-18 13:09:48,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 13:09:48,203 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 85 transitions. [2024-11-18 13:09:48,203 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 51 states have (on average 1.3725490196078431) internal successors, (70), 43 states have internal predecessors, (70), 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) [2024-11-18 13:09:48,203 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 85 transitions. [2024-11-18 13:09:48,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-11-18 13:09:48,204 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 13:09:48,204 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 13:09:48,218 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-11-18 13:09:48,404 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,SelfDestructingSolverStorable10 [2024-11-18 13:09:48,405 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 13:09:48,405 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 13:09:48,405 INFO L85 PathProgramCache]: Analyzing trace with hash -397769244, now seen corresponding path program 1 times [2024-11-18 13:09:48,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 13:09:48,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455815057] [2024-11-18 13:09:48,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 13:09:48,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 13:09:48,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 13:09:49,780 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 14 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 13:09:49,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 13:09:49,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1455815057] [2024-11-18 13:09:49,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1455815057] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 13:09:49,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [613929865] [2024-11-18 13:09:49,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 13:09:49,781 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 13:09:49,781 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 13:09:49,782 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) [2024-11-18 13:09:49,783 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-18 13:09:50,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 13:09:50,112 INFO L255 TraceCheckSpWp]: Trace formula consists of 427 conjuncts, 135 conjuncts are in the unsatisfiable core [2024-11-18 13:09:50,115 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 13:09:50,140 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 [2024-11-18 13:09:50,260 WARN L851 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_#t~ret4#1.base|) 1) (exists ((|v_#valid_BEFORE_CALL_22| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_22| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_22| |c_ULTIMATE.start_dll_create_#t~ret4#1.base|) 0) (= |c_#valid| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_22| |c_#valid|))) (store |v_#valid_BEFORE_CALL_22| .cse0 (select |c_#valid| .cse0)))))) (= |c_ULTIMATE.start_dll_create_#t~ret4#1.offset| 0)) is different from false [2024-11-18 13:09:50,262 WARN L873 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_#t~ret4#1.base|) 1) (exists ((|v_#valid_BEFORE_CALL_22| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_22| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_22| |c_ULTIMATE.start_dll_create_#t~ret4#1.base|) 0) (= |c_#valid| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_22| |c_#valid|))) (store |v_#valid_BEFORE_CALL_22| .cse0 (select |c_#valid| .cse0)))))) (= |c_ULTIMATE.start_dll_create_#t~ret4#1.offset| 0)) is different from true [2024-11-18 13:09:50,266 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 [2024-11-18 13:09:50,275 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 [2024-11-18 13:09:50,278 WARN L851 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (= (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4) |c_ULTIMATE.start_dll_create_~head~0#1.base|) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4) 0) (exists ((|v_#valid_BEFORE_CALL_22| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_22| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1) (= |c_#valid| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_22| |c_#valid|))) (store |v_#valid_BEFORE_CALL_22| .cse0 (select |c_#valid| .cse0)))) (= (select |v_#valid_BEFORE_CALL_22| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 0)))) is different from false [2024-11-18 13:09:50,280 WARN L873 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (= (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4) |c_ULTIMATE.start_dll_create_~head~0#1.base|) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4) 0) (exists ((|v_#valid_BEFORE_CALL_22| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_22| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1) (= |c_#valid| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_22| |c_#valid|))) (store |v_#valid_BEFORE_CALL_22| .cse0 (select |c_#valid| .cse0)))) (= (select |v_#valid_BEFORE_CALL_22| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 0)))) is different from true [2024-11-18 13:09:50,292 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-18 13:09:50,292 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 42 treesize of output 39 [2024-11-18 13:09:50,301 INFO L349 Elim1Store]: treesize reduction 21, result has 38.2 percent of original size [2024-11-18 13:09:50,301 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 24 treesize of output 19 [2024-11-18 13:09:50,312 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4))) (and (or (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse0) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4) 0)) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (exists ((|v_#valid_BEFORE_CALL_22| (Array Int Int))) (and (= |c_#valid| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_22| |c_#valid|))) (store |v_#valid_BEFORE_CALL_22| .cse1 (select |c_#valid| .cse1)))) (= (select |v_#valid_BEFORE_CALL_22| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_22| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 0))))) is different from false [2024-11-18 13:09:50,313 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4))) (and (or (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse0) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4) 0)) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (exists ((|v_#valid_BEFORE_CALL_22| (Array Int Int))) (and (= |c_#valid| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_22| |c_#valid|))) (store |v_#valid_BEFORE_CALL_22| .cse1 (select |c_#valid| .cse1)))) (= (select |v_#valid_BEFORE_CALL_22| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_22| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 0))))) is different from true [2024-11-18 13:09:50,327 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4))) (and (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_22| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_22| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_22| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 0) (= |c_#valid| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_22| |c_#valid|))) (store |v_#valid_BEFORE_CALL_22| .cse1 (select |c_#valid| .cse1)))))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (or (= .cse0 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4) 0)) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1))) is different from false [2024-11-18 13:09:50,329 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4))) (and (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_22| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_22| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_22| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 0) (= |c_#valid| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_22| |c_#valid|))) (store |v_#valid_BEFORE_CALL_22| .cse1 (select |c_#valid| .cse1)))))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (or (= .cse0 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4) 0)) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1))) is different from true [2024-11-18 13:09:50,357 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_#res#1.base|) 4))) (and (= (select |c_#valid| |c_ULTIMATE.start_dll_create_#res#1.base|) 1) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_22| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_22| |c_ULTIMATE.start_dll_create_#res#1.base|) 0) (= |c_#valid| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_22| |c_#valid|))) (store |v_#valid_BEFORE_CALL_22| .cse0 (select |c_#valid| .cse0)))) (= (select |v_#valid_BEFORE_CALL_22| .cse1) 1))) (= |c_ULTIMATE.start_dll_create_#res#1.offset| 0) (or (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_#res#1.base|) 4) 0) (= .cse1 |c_ULTIMATE.start_dll_create_#res#1.base|)))) is different from false [2024-11-18 13:09:50,358 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_#res#1.base|) 4))) (and (= (select |c_#valid| |c_ULTIMATE.start_dll_create_#res#1.base|) 1) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_22| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_22| |c_ULTIMATE.start_dll_create_#res#1.base|) 0) (= |c_#valid| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_22| |c_#valid|))) (store |v_#valid_BEFORE_CALL_22| .cse0 (select |c_#valid| .cse0)))) (= (select |v_#valid_BEFORE_CALL_22| .cse1) 1))) (= |c_ULTIMATE.start_dll_create_#res#1.offset| 0) (or (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_#res#1.base|) 4) 0) (= .cse1 |c_ULTIMATE.start_dll_create_#res#1.base|)))) is different from true [2024-11-18 13:09:50,377 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| .cse0) 4))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |c_ULTIMATE.start_dll_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#valid_BEFORE_CALL_22| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_22| .cse0) 0) (= 1 (select |v_#valid_BEFORE_CALL_22| .cse1)) (= |c_#valid| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_22| |c_#valid|))) (store |v_#valid_BEFORE_CALL_22| .cse2 (select |c_#valid| .cse2)))))) (= (select |c_#valid| .cse0) 1) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (or (= (select (select |c_#memory_$Pointer$#1.offset| .cse0) 4) 0) (= .cse1 .cse0)) (= |c_ULTIMATE.start_dll_append_~head#1.offset| 0)))) is different from false [2024-11-18 13:09:50,379 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| .cse0) 4))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |c_ULTIMATE.start_dll_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#valid_BEFORE_CALL_22| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_22| .cse0) 0) (= 1 (select |v_#valid_BEFORE_CALL_22| .cse1)) (= |c_#valid| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_22| |c_#valid|))) (store |v_#valid_BEFORE_CALL_22| .cse2 (select |c_#valid| .cse2)))))) (= (select |c_#valid| .cse0) 1) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (or (= (select (select |c_#memory_$Pointer$#1.offset| .cse0) 4) 0) (= .cse1 .cse0)) (= |c_ULTIMATE.start_dll_append_~head#1.offset| 0)))) is different from true [2024-11-18 13:09:50,388 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 19 [2024-11-18 13:09:50,392 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 17 [2024-11-18 13:09:50,420 WARN L851 $PredicateComparison]: unable to prove that (and (exists ((|v_#valid_BEFORE_CALL_23| (Array Int Int)) (|v_#valid_BEFORE_CALL_22| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8| Int) (v_arrayElimCell_116 Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8|) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8|) 0) 0) (= (select |v_#valid_BEFORE_CALL_22| v_arrayElimCell_116) 1) (= (select |v_#valid_BEFORE_CALL_23| .cse0) 1) (= |v_#valid_BEFORE_CALL_23| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_22| |v_#valid_BEFORE_CALL_23|))) (store |v_#valid_BEFORE_CALL_22| .cse1 (select |v_#valid_BEFORE_CALL_23| .cse1)))) (= (select |v_#valid_BEFORE_CALL_22| .cse0) 0)))) (= |c_#valid| |c_old(#valid)|) (= |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 [2024-11-18 13:09:50,422 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((|v_#valid_BEFORE_CALL_23| (Array Int Int)) (|v_#valid_BEFORE_CALL_22| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8| Int) (v_arrayElimCell_116 Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8|) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8|) 0) 0) (= (select |v_#valid_BEFORE_CALL_22| v_arrayElimCell_116) 1) (= (select |v_#valid_BEFORE_CALL_23| .cse0) 1) (= |v_#valid_BEFORE_CALL_23| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_22| |v_#valid_BEFORE_CALL_23|))) (store |v_#valid_BEFORE_CALL_22| .cse1 (select |v_#valid_BEFORE_CALL_23| .cse1)))) (= (select |v_#valid_BEFORE_CALL_22| .cse0) 0)))) (= |c_#valid| |c_old(#valid)|) (= |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 [2024-11-18 13:09:50,443 WARN L851 $PredicateComparison]: unable to prove that (and (exists ((|v_#valid_BEFORE_CALL_23| (Array Int Int)) (|v_#valid_BEFORE_CALL_22| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8| Int) (v_arrayElimCell_116 Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8|) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8|) 0) 0) (= (select |v_#valid_BEFORE_CALL_22| v_arrayElimCell_116) 1) (= (select |v_#valid_BEFORE_CALL_23| .cse0) 1) (= |v_#valid_BEFORE_CALL_23| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_22| |v_#valid_BEFORE_CALL_23|))) (store |v_#valid_BEFORE_CALL_22| .cse1 (select |v_#valid_BEFORE_CALL_23| .cse1)))) (= (select |v_#valid_BEFORE_CALL_22| .cse0) 0)))) (not (= |c_node_create_~temp~0#1.base| 0)) (= |c_#memory_$Pointer$#1.offset| |c_old(#memory_$Pointer$#1.offset)|) (= |c_node_create_~temp~0#1.offset| 0) (= (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 [2024-11-18 13:09:50,445 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((|v_#valid_BEFORE_CALL_23| (Array Int Int)) (|v_#valid_BEFORE_CALL_22| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8| Int) (v_arrayElimCell_116 Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8|) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8|) 0) 0) (= (select |v_#valid_BEFORE_CALL_22| v_arrayElimCell_116) 1) (= (select |v_#valid_BEFORE_CALL_23| .cse0) 1) (= |v_#valid_BEFORE_CALL_23| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_22| |v_#valid_BEFORE_CALL_23|))) (store |v_#valid_BEFORE_CALL_22| .cse1 (select |v_#valid_BEFORE_CALL_23| .cse1)))) (= (select |v_#valid_BEFORE_CALL_22| .cse0) 0)))) (not (= |c_node_create_~temp~0#1.base| 0)) (= |c_#memory_$Pointer$#1.offset| |c_old(#memory_$Pointer$#1.offset)|) (= |c_node_create_~temp~0#1.offset| 0) (= (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 [2024-11-18 13:09:50,490 WARN L851 $PredicateComparison]: unable to prove that (and (exists ((|v_#valid_BEFORE_CALL_23| (Array Int Int)) (|v_#valid_BEFORE_CALL_22| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8| Int) (v_arrayElimCell_116 Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8|) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8|) 0) 0) (= (select |v_#valid_BEFORE_CALL_22| v_arrayElimCell_116) 1) (= (select |v_#valid_BEFORE_CALL_23| .cse0) 1) (= |v_#valid_BEFORE_CALL_23| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_22| |v_#valid_BEFORE_CALL_23|))) (store |v_#valid_BEFORE_CALL_22| .cse1 (select |v_#valid_BEFORE_CALL_23| .cse1)))) (= (select |v_#valid_BEFORE_CALL_22| .cse0) 0)))) (= |c_node_create_#res#1.offset| 0) (= (select |c_old(#valid)| |c_node_create_#res#1.base|) 0) (not (= |c_node_create_#res#1.base| 0)) (= |c_#memory_$Pointer$#1.base| (store |c_old(#memory_$Pointer$#1.base)| |c_node_create_#res#1.base| (select |c_#memory_$Pointer$#1.base| |c_node_create_#res#1.base|))) (= |c_#memory_$Pointer$#1.offset| (store |c_old(#memory_$Pointer$#1.offset)| |c_node_create_#res#1.base| (select |c_#memory_$Pointer$#1.offset| |c_node_create_#res#1.base|)))) is different from false [2024-11-18 13:09:50,495 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((|v_#valid_BEFORE_CALL_23| (Array Int Int)) (|v_#valid_BEFORE_CALL_22| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8| Int) (v_arrayElimCell_116 Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8|) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8|) 0) 0) (= (select |v_#valid_BEFORE_CALL_22| v_arrayElimCell_116) 1) (= (select |v_#valid_BEFORE_CALL_23| .cse0) 1) (= |v_#valid_BEFORE_CALL_23| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_22| |v_#valid_BEFORE_CALL_23|))) (store |v_#valid_BEFORE_CALL_22| .cse1 (select |v_#valid_BEFORE_CALL_23| .cse1)))) (= (select |v_#valid_BEFORE_CALL_22| .cse0) 0)))) (= |c_node_create_#res#1.offset| 0) (= (select |c_old(#valid)| |c_node_create_#res#1.base|) 0) (not (= |c_node_create_#res#1.base| 0)) (= |c_#memory_$Pointer$#1.base| (store |c_old(#memory_$Pointer$#1.base)| |c_node_create_#res#1.base| (select |c_#memory_$Pointer$#1.base| |c_node_create_#res#1.base|))) (= |c_#memory_$Pointer$#1.offset| (store |c_old(#memory_$Pointer$#1.offset)| |c_node_create_#res#1.base| (select |c_#memory_$Pointer$#1.offset| |c_node_create_#res#1.base|)))) is different from true [2024-11-18 13:09:50,531 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-18 13:09:50,532 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 36 treesize of output 31 [2024-11-18 13:09:50,537 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-18 13:09:50,538 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 49 treesize of output 38 [2024-11-18 13:09:50,584 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| .cse2) 4))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (exists ((|v_#valid_BEFORE_CALL_23| (Array Int Int)) (|v_#valid_BEFORE_CALL_22| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8| Int) (v_arrayElimCell_116 Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8|) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8|) 0) 0) (= (select |v_#valid_BEFORE_CALL_22| v_arrayElimCell_116) 1) (= (select |v_#valid_BEFORE_CALL_23| .cse0) 1) (= |v_#valid_BEFORE_CALL_23| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_22| |v_#valid_BEFORE_CALL_23|))) (store |v_#valid_BEFORE_CALL_22| .cse1 (select |v_#valid_BEFORE_CALL_23| .cse1)))) (= (select |v_#valid_BEFORE_CALL_22| .cse0) 0)))) (= |c_ULTIMATE.start_dll_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (not (= |c_ULTIMATE.start_dll_append_#t~ret7#1.base| 0)) (= |c_ULTIMATE.start_dll_append_#t~ret7#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_25| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_27| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_27| .cse2) 1) (= (select |v_#valid_BEFORE_CALL_25| .cse2) 0) (= (select |v_#valid_BEFORE_CALL_25| .cse3) 1) (= (select |v_old(#valid)_AFTER_CALL_27| |c_ULTIMATE.start_dll_append_#t~ret7#1.base|) 0) (= |v_old(#valid)_AFTER_CALL_27| (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_25| |v_old(#valid)_AFTER_CALL_27|))) (store |v_#valid_BEFORE_CALL_25| .cse4 (select |v_old(#valid)_AFTER_CALL_27| .cse4)))))) (or (= (select (select |c_#memory_$Pointer$#1.offset| .cse2) 4) 0) (= .cse3 .cse2)) (= |c_ULTIMATE.start_dll_append_~head#1.offset| 0)))) is different from false [2024-11-18 13:09:50,587 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| .cse2) 4))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (exists ((|v_#valid_BEFORE_CALL_23| (Array Int Int)) (|v_#valid_BEFORE_CALL_22| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8| Int) (v_arrayElimCell_116 Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8|) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8|) 0) 0) (= (select |v_#valid_BEFORE_CALL_22| v_arrayElimCell_116) 1) (= (select |v_#valid_BEFORE_CALL_23| .cse0) 1) (= |v_#valid_BEFORE_CALL_23| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_22| |v_#valid_BEFORE_CALL_23|))) (store |v_#valid_BEFORE_CALL_22| .cse1 (select |v_#valid_BEFORE_CALL_23| .cse1)))) (= (select |v_#valid_BEFORE_CALL_22| .cse0) 0)))) (= |c_ULTIMATE.start_dll_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (not (= |c_ULTIMATE.start_dll_append_#t~ret7#1.base| 0)) (= |c_ULTIMATE.start_dll_append_#t~ret7#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_25| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_27| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_27| .cse2) 1) (= (select |v_#valid_BEFORE_CALL_25| .cse2) 0) (= (select |v_#valid_BEFORE_CALL_25| .cse3) 1) (= (select |v_old(#valid)_AFTER_CALL_27| |c_ULTIMATE.start_dll_append_#t~ret7#1.base|) 0) (= |v_old(#valid)_AFTER_CALL_27| (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_25| |v_old(#valid)_AFTER_CALL_27|))) (store |v_#valid_BEFORE_CALL_25| .cse4 (select |v_old(#valid)_AFTER_CALL_27| .cse4)))))) (or (= (select (select |c_#memory_$Pointer$#1.offset| .cse2) 4) 0) (= .cse3 .cse2)) (= |c_ULTIMATE.start_dll_append_~head#1.offset| 0)))) is different from true [2024-11-18 13:09:50,641 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| .cse2) 4))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (exists ((|v_#valid_BEFORE_CALL_23| (Array Int Int)) (|v_#valid_BEFORE_CALL_22| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8| Int) (v_arrayElimCell_116 Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8|) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8|) 0) 0) (= (select |v_#valid_BEFORE_CALL_22| v_arrayElimCell_116) 1) (= (select |v_#valid_BEFORE_CALL_23| .cse0) 1) (= |v_#valid_BEFORE_CALL_23| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_22| |v_#valid_BEFORE_CALL_23|))) (store |v_#valid_BEFORE_CALL_22| .cse1 (select |v_#valid_BEFORE_CALL_23| .cse1)))) (= (select |v_#valid_BEFORE_CALL_22| .cse0) 0)))) (= |c_ULTIMATE.start_dll_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_append_~new_last~0#1.offset| 0) (not (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| 0)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_25| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_27| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_27| .cse2) 1) (= (select |v_#valid_BEFORE_CALL_25| .cse2) 0) (= (select |v_#valid_BEFORE_CALL_25| .cse3) 1) (= (select |v_old(#valid)_AFTER_CALL_27| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) 0) (= |v_old(#valid)_AFTER_CALL_27| (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_25| |v_old(#valid)_AFTER_CALL_27|))) (store |v_#valid_BEFORE_CALL_25| .cse4 (select |v_old(#valid)_AFTER_CALL_27| .cse4)))))) (or (= (select (select |c_#memory_$Pointer$#1.offset| .cse2) 4) 0) (= .cse3 .cse2)) (= |c_ULTIMATE.start_dll_append_~head#1.offset| 0)))) is different from false [2024-11-18 13:09:50,643 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| .cse2) 4))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (exists ((|v_#valid_BEFORE_CALL_23| (Array Int Int)) (|v_#valid_BEFORE_CALL_22| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8| Int) (v_arrayElimCell_116 Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8|) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8|) 0) 0) (= (select |v_#valid_BEFORE_CALL_22| v_arrayElimCell_116) 1) (= (select |v_#valid_BEFORE_CALL_23| .cse0) 1) (= |v_#valid_BEFORE_CALL_23| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_22| |v_#valid_BEFORE_CALL_23|))) (store |v_#valid_BEFORE_CALL_22| .cse1 (select |v_#valid_BEFORE_CALL_23| .cse1)))) (= (select |v_#valid_BEFORE_CALL_22| .cse0) 0)))) (= |c_ULTIMATE.start_dll_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_append_~new_last~0#1.offset| 0) (not (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| 0)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_25| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_27| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_27| .cse2) 1) (= (select |v_#valid_BEFORE_CALL_25| .cse2) 0) (= (select |v_#valid_BEFORE_CALL_25| .cse3) 1) (= (select |v_old(#valid)_AFTER_CALL_27| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) 0) (= |v_old(#valid)_AFTER_CALL_27| (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_25| |v_old(#valid)_AFTER_CALL_27|))) (store |v_#valid_BEFORE_CALL_25| .cse4 (select |v_old(#valid)_AFTER_CALL_27| .cse4)))))) (or (= (select (select |c_#memory_$Pointer$#1.offset| .cse2) 4) 0) (= .cse3 .cse2)) (= |c_ULTIMATE.start_dll_append_~head#1.offset| 0)))) is different from true [2024-11-18 13:09:50,691 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| .cse2) 4))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (exists ((|v_#valid_BEFORE_CALL_23| (Array Int Int)) (|v_#valid_BEFORE_CALL_22| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8| Int) (v_arrayElimCell_116 Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8|) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8|) 0) 0) (= (select |v_#valid_BEFORE_CALL_22| v_arrayElimCell_116) 1) (= (select |v_#valid_BEFORE_CALL_23| .cse0) 1) (= |v_#valid_BEFORE_CALL_23| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_22| |v_#valid_BEFORE_CALL_23|))) (store |v_#valid_BEFORE_CALL_22| .cse1 (select |v_#valid_BEFORE_CALL_23| .cse1)))) (= (select |v_#valid_BEFORE_CALL_22| .cse0) 0)))) (= |c_ULTIMATE.start_dll_append_~new_last~0#1.offset| 0) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse2) (not (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| 0)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_25| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_27| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_27| .cse2) 1) (= (select |v_#valid_BEFORE_CALL_25| .cse2) 0) (= (select |v_#valid_BEFORE_CALL_25| .cse3) 1) (= (select |v_old(#valid)_AFTER_CALL_27| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) 0) (= |v_old(#valid)_AFTER_CALL_27| (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_25| |v_old(#valid)_AFTER_CALL_27|))) (store |v_#valid_BEFORE_CALL_25| .cse4 (select |v_old(#valid)_AFTER_CALL_27| .cse4)))))) (= |c_ULTIMATE.start_dll_append_~last~0#1.offset| 0) (or (= (select (select |c_#memory_$Pointer$#1.offset| .cse2) 4) 0) (= .cse3 .cse2))))) is different from false [2024-11-18 13:09:50,693 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| .cse2) 4))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (exists ((|v_#valid_BEFORE_CALL_23| (Array Int Int)) (|v_#valid_BEFORE_CALL_22| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8| Int) (v_arrayElimCell_116 Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8|) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8|) 0) 0) (= (select |v_#valid_BEFORE_CALL_22| v_arrayElimCell_116) 1) (= (select |v_#valid_BEFORE_CALL_23| .cse0) 1) (= |v_#valid_BEFORE_CALL_23| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_22| |v_#valid_BEFORE_CALL_23|))) (store |v_#valid_BEFORE_CALL_22| .cse1 (select |v_#valid_BEFORE_CALL_23| .cse1)))) (= (select |v_#valid_BEFORE_CALL_22| .cse0) 0)))) (= |c_ULTIMATE.start_dll_append_~new_last~0#1.offset| 0) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse2) (not (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| 0)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_25| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_27| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_27| .cse2) 1) (= (select |v_#valid_BEFORE_CALL_25| .cse2) 0) (= (select |v_#valid_BEFORE_CALL_25| .cse3) 1) (= (select |v_old(#valid)_AFTER_CALL_27| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) 0) (= |v_old(#valid)_AFTER_CALL_27| (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_25| |v_old(#valid)_AFTER_CALL_27|))) (store |v_#valid_BEFORE_CALL_25| .cse4 (select |v_old(#valid)_AFTER_CALL_27| .cse4)))))) (= |c_ULTIMATE.start_dll_append_~last~0#1.offset| 0) (or (= (select (select |c_#memory_$Pointer$#1.offset| .cse2) 4) 0) (= .cse3 .cse2))))) is different from true [2024-11-18 13:09:50,787 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse5 (select (select |c_#memory_$Pointer$#1.offset| .cse3) 4)) (.cse2 (select (select |c_#memory_$Pointer$#1.base| .cse3) 4))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (exists ((|v_#valid_BEFORE_CALL_23| (Array Int Int)) (|v_#valid_BEFORE_CALL_22| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8| Int) (v_arrayElimCell_116 Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8|) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8|) 0) 0) (= (select |v_#valid_BEFORE_CALL_22| v_arrayElimCell_116) 1) (= (select |v_#valid_BEFORE_CALL_23| .cse0) 1) (= |v_#valid_BEFORE_CALL_23| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_22| |v_#valid_BEFORE_CALL_23|))) (store |v_#valid_BEFORE_CALL_22| .cse1 (select |v_#valid_BEFORE_CALL_23| .cse1)))) (= (select |v_#valid_BEFORE_CALL_22| .cse0) 0)))) (= |c_ULTIMATE.start_dll_append_~new_last~0#1.offset| 0) (not (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| 0)) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse2) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_25| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_27| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_27| .cse3) 1) (= (select |v_#valid_BEFORE_CALL_25| .cse3) 0) (= (select |v_#valid_BEFORE_CALL_25| .cse2) 1) (= (select |v_old(#valid)_AFTER_CALL_27| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) 0) (= |v_old(#valid)_AFTER_CALL_27| (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_25| |v_old(#valid)_AFTER_CALL_27|))) (store |v_#valid_BEFORE_CALL_25| .cse4 (select |v_old(#valid)_AFTER_CALL_27| .cse4)))))) (= |c_ULTIMATE.start_dll_append_~last~0#1.offset| .cse5) (or (= .cse5 0) (= .cse2 .cse3))))) is different from false [2024-11-18 13:09:50,789 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse5 (select (select |c_#memory_$Pointer$#1.offset| .cse3) 4)) (.cse2 (select (select |c_#memory_$Pointer$#1.base| .cse3) 4))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (exists ((|v_#valid_BEFORE_CALL_23| (Array Int Int)) (|v_#valid_BEFORE_CALL_22| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8| Int) (v_arrayElimCell_116 Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8|) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8|) 0) 0) (= (select |v_#valid_BEFORE_CALL_22| v_arrayElimCell_116) 1) (= (select |v_#valid_BEFORE_CALL_23| .cse0) 1) (= |v_#valid_BEFORE_CALL_23| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_22| |v_#valid_BEFORE_CALL_23|))) (store |v_#valid_BEFORE_CALL_22| .cse1 (select |v_#valid_BEFORE_CALL_23| .cse1)))) (= (select |v_#valid_BEFORE_CALL_22| .cse0) 0)))) (= |c_ULTIMATE.start_dll_append_~new_last~0#1.offset| 0) (not (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| 0)) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse2) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_25| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_27| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_27| .cse3) 1) (= (select |v_#valid_BEFORE_CALL_25| .cse3) 0) (= (select |v_#valid_BEFORE_CALL_25| .cse2) 1) (= (select |v_old(#valid)_AFTER_CALL_27| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) 0) (= |v_old(#valid)_AFTER_CALL_27| (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_25| |v_old(#valid)_AFTER_CALL_27|))) (store |v_#valid_BEFORE_CALL_25| .cse4 (select |v_old(#valid)_AFTER_CALL_27| .cse4)))))) (= |c_ULTIMATE.start_dll_append_~last~0#1.offset| .cse5) (or (= .cse5 0) (= .cse2 .cse3))))) is different from true [2024-11-18 13:09:50,885 INFO L349 Elim1Store]: treesize reduction 53, result has 17.2 percent of original size [2024-11-18 13:09:50,885 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 125 treesize of output 90 [2024-11-18 13:09:50,901 INFO L349 Elim1Store]: treesize reduction 80, result has 15.8 percent of original size [2024-11-18 13:09:50,902 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 232 treesize of output 169 [2024-11-18 13:09:50,905 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-18 13:09:50,906 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 167 treesize of output 124 [2024-11-18 13:09:50,910 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-18 13:09:50,922 INFO L349 Elim1Store]: treesize reduction 100, result has 18.7 percent of original size [2024-11-18 13:09:50,922 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 158 treesize of output 136 [2024-11-18 13:09:50,957 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse5 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse4 (select (select |c_#memory_$Pointer$#1.offset| .cse5) 4))) (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| .cse5) 4)) (.cse3 (+ .cse4 4))) (let ((.cse6 (select (select |c_#memory_$Pointer$#1.base| .cse2) .cse3))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (exists ((|v_#valid_BEFORE_CALL_23| (Array Int Int)) (|v_#valid_BEFORE_CALL_22| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8| Int) (v_arrayElimCell_116 Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8|) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8|) 0) 0) (= (select |v_#valid_BEFORE_CALL_22| v_arrayElimCell_116) 1) (= (select |v_#valid_BEFORE_CALL_23| .cse0) 1) (= |v_#valid_BEFORE_CALL_23| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_22| |v_#valid_BEFORE_CALL_23|))) (store |v_#valid_BEFORE_CALL_22| .cse1 (select |v_#valid_BEFORE_CALL_23| .cse1)))) (= (select |v_#valid_BEFORE_CALL_22| .cse0) 0)))) (= (select (select |c_#memory_$Pointer$#1.offset| .cse2) .cse3) 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (or (= .cse4 0) (= .cse2 .cse5)) (exists ((|v_#valid_BEFORE_CALL_25| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_27| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_27| .cse6) 0) (= (select |v_old(#valid)_AFTER_CALL_27| .cse5) 1) (= (select |v_#valid_BEFORE_CALL_25| .cse5) 0) (= (select |v_#valid_BEFORE_CALL_25| .cse2) 1) (= |v_old(#valid)_AFTER_CALL_27| (let ((.cse7 (@diff |v_#valid_BEFORE_CALL_25| |v_old(#valid)_AFTER_CALL_27|))) (store |v_#valid_BEFORE_CALL_25| .cse7 (select |v_old(#valid)_AFTER_CALL_27| .cse7)))))) (not (= .cse6 0))))))) is different from false [2024-11-18 13:09:50,959 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse5 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse4 (select (select |c_#memory_$Pointer$#1.offset| .cse5) 4))) (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| .cse5) 4)) (.cse3 (+ .cse4 4))) (let ((.cse6 (select (select |c_#memory_$Pointer$#1.base| .cse2) .cse3))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (exists ((|v_#valid_BEFORE_CALL_23| (Array Int Int)) (|v_#valid_BEFORE_CALL_22| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8| Int) (v_arrayElimCell_116 Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8|) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8|) 0) 0) (= (select |v_#valid_BEFORE_CALL_22| v_arrayElimCell_116) 1) (= (select |v_#valid_BEFORE_CALL_23| .cse0) 1) (= |v_#valid_BEFORE_CALL_23| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_22| |v_#valid_BEFORE_CALL_23|))) (store |v_#valid_BEFORE_CALL_22| .cse1 (select |v_#valid_BEFORE_CALL_23| .cse1)))) (= (select |v_#valid_BEFORE_CALL_22| .cse0) 0)))) (= (select (select |c_#memory_$Pointer$#1.offset| .cse2) .cse3) 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (or (= .cse4 0) (= .cse2 .cse5)) (exists ((|v_#valid_BEFORE_CALL_25| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_27| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_27| .cse6) 0) (= (select |v_old(#valid)_AFTER_CALL_27| .cse5) 1) (= (select |v_#valid_BEFORE_CALL_25| .cse5) 0) (= (select |v_#valid_BEFORE_CALL_25| .cse2) 1) (= |v_old(#valid)_AFTER_CALL_27| (let ((.cse7 (@diff |v_#valid_BEFORE_CALL_25| |v_old(#valid)_AFTER_CALL_27|))) (store |v_#valid_BEFORE_CALL_25| .cse7 (select |v_old(#valid)_AFTER_CALL_27| .cse7)))))) (not (= .cse6 0))))))) is different from true [2024-11-18 13:09:50,978 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-18 13:09:50,978 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 162 treesize of output 110 [2024-11-18 13:09:50,986 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-18 13:09:50,987 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 [2024-11-18 13:09:51,008 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~ptr~0#1.base|) 4))) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~ptr~0#1.base|) 4)) (.cse4 (+ .cse3 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| .cse1) .cse4))) (and (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_25| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_27| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_25| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_27| .cse0) 0) (= (select |v_#valid_BEFORE_CALL_25| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_27| |c_ULTIMATE.start_main_~ptr~0#1.base|) 1) (= |v_old(#valid)_AFTER_CALL_27| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_25| |v_old(#valid)_AFTER_CALL_27|))) (store |v_#valid_BEFORE_CALL_25| .cse2 (select |v_old(#valid)_AFTER_CALL_27| .cse2)))))) (or (= .cse3 0) (= .cse1 |c_ULTIMATE.start_main_~ptr~0#1.base|)) (= (select (select |c_#memory_$Pointer$#1.offset| .cse1) .cse4) 0) (not (= 0 .cse0)))))) is different from false [2024-11-18 13:09:51,009 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~ptr~0#1.base|) 4))) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~ptr~0#1.base|) 4)) (.cse4 (+ .cse3 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| .cse1) .cse4))) (and (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_25| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_27| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_25| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_27| .cse0) 0) (= (select |v_#valid_BEFORE_CALL_25| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_27| |c_ULTIMATE.start_main_~ptr~0#1.base|) 1) (= |v_old(#valid)_AFTER_CALL_27| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_25| |v_old(#valid)_AFTER_CALL_27|))) (store |v_#valid_BEFORE_CALL_25| .cse2 (select |v_old(#valid)_AFTER_CALL_27| .cse2)))))) (or (= .cse3 0) (= .cse1 |c_ULTIMATE.start_main_~ptr~0#1.base|)) (= (select (select |c_#memory_$Pointer$#1.offset| .cse1) .cse4) 0) (not (= 0 .cse0)))))) is different from true [2024-11-18 13:09:51,063 WARN L851 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_25| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_27| (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.base_22| Int)) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_main_~ptr~0#1.base_22|) 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| .cse1) 4))) (and (= (select |v_old(#valid)_AFTER_CALL_27| .cse0) 0) (= (select |v_#valid_BEFORE_CALL_25| .cse1) 1) (= (select (select |c_#memory_$Pointer$#1.offset| .cse1) 4) 0) (= (select |v_old(#valid)_AFTER_CALL_27| |v_ULTIMATE.start_main_~ptr~0#1.base_22|) 1) (not (= .cse0 0)) (= .cse1 |c_ULTIMATE.start_main_~ptr~0#1.base|) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_main_~ptr~0#1.base_22|) 4) 0) (= |v_old(#valid)_AFTER_CALL_27| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_25| |v_old(#valid)_AFTER_CALL_27|))) (store |v_#valid_BEFORE_CALL_25| .cse2 (select |v_old(#valid)_AFTER_CALL_27| .cse2)))) (= (select |v_#valid_BEFORE_CALL_25| |v_ULTIMATE.start_main_~ptr~0#1.base_22|) 0)))))) is different from false [2024-11-18 13:09:51,064 WARN L873 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_25| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_27| (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.base_22| Int)) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_main_~ptr~0#1.base_22|) 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| .cse1) 4))) (and (= (select |v_old(#valid)_AFTER_CALL_27| .cse0) 0) (= (select |v_#valid_BEFORE_CALL_25| .cse1) 1) (= (select (select |c_#memory_$Pointer$#1.offset| .cse1) 4) 0) (= (select |v_old(#valid)_AFTER_CALL_27| |v_ULTIMATE.start_main_~ptr~0#1.base_22|) 1) (not (= .cse0 0)) (= .cse1 |c_ULTIMATE.start_main_~ptr~0#1.base|) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_main_~ptr~0#1.base_22|) 4) 0) (= |v_old(#valid)_AFTER_CALL_27| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_25| |v_old(#valid)_AFTER_CALL_27|))) (store |v_#valid_BEFORE_CALL_25| .cse2 (select |v_old(#valid)_AFTER_CALL_27| .cse2)))) (= (select |v_#valid_BEFORE_CALL_25| |v_ULTIMATE.start_main_~ptr~0#1.base_22|) 0)))))) is different from true [2024-11-18 13:09:51,091 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-18 13:09:51,091 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 57 treesize of output 28 [2024-11-18 13:09:51,096 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-18 13:09:51,096 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 15 treesize of output 7 [2024-11-18 13:09:51,108 WARN L851 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (not (= |c_ULTIMATE.start_main_~ptr~0#1.base| 0)) (exists ((|v_#valid_BEFORE_CALL_25| (Array Int Int)) (v_arrayElimIndex_17 Int) (|v_old(#valid)_AFTER_CALL_27| (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.base_22| Int)) (and (= (select |v_#valid_BEFORE_CALL_25| v_arrayElimIndex_17) 1) (= (select |v_old(#valid)_AFTER_CALL_27| |v_ULTIMATE.start_main_~ptr~0#1.base_22|) 1) (= (select |v_old(#valid)_AFTER_CALL_27| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= |v_old(#valid)_AFTER_CALL_27| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_25| |v_old(#valid)_AFTER_CALL_27|))) (store |v_#valid_BEFORE_CALL_25| .cse0 (select |v_old(#valid)_AFTER_CALL_27| .cse0)))) (= (select |v_#valid_BEFORE_CALL_25| |v_ULTIMATE.start_main_~ptr~0#1.base_22|) 0)))) is different from false [2024-11-18 13:09:51,109 WARN L873 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (not (= |c_ULTIMATE.start_main_~ptr~0#1.base| 0)) (exists ((|v_#valid_BEFORE_CALL_25| (Array Int Int)) (v_arrayElimIndex_17 Int) (|v_old(#valid)_AFTER_CALL_27| (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.base_22| Int)) (and (= (select |v_#valid_BEFORE_CALL_25| v_arrayElimIndex_17) 1) (= (select |v_old(#valid)_AFTER_CALL_27| |v_ULTIMATE.start_main_~ptr~0#1.base_22|) 1) (= (select |v_old(#valid)_AFTER_CALL_27| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= |v_old(#valid)_AFTER_CALL_27| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_25| |v_old(#valid)_AFTER_CALL_27|))) (store |v_#valid_BEFORE_CALL_25| .cse0 (select |v_old(#valid)_AFTER_CALL_27| .cse0)))) (= (select |v_#valid_BEFORE_CALL_25| |v_ULTIMATE.start_main_~ptr~0#1.base_22|) 0)))) is different from true [2024-11-18 13:09:51,110 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 20 not checked. [2024-11-18 13:09:51,110 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-18 13:09:59,398 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1760 (Array Int Int)) (v_ArrVal_1759 (Array Int Int))) (let ((.cse8 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse9 (+ (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 4))) (let ((.cse6 (select (select |c_#memory_$Pointer$#1.base| .cse8) .cse9)) (.cse7 (+ (select (select |c_#memory_$Pointer$#1.offset| .cse8) .cse9) 4))) (let ((.cse3 (store (store |c_#memory_$Pointer$#1.offset| .cse6 (store (select |c_#memory_$Pointer$#1.offset| .cse6) .cse7 |c_ULTIMATE.start_dll_append_~new_last~0#1.offset|)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1760)) (.cse0 (store (store |c_#memory_$Pointer$#1.base| .cse6 (store (select |c_#memory_$Pointer$#1.base| .cse6) .cse7 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1759)) (.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))) (let ((.cse1 (select (select .cse0 .cse4) .cse5)) (.cse2 (+ (select (select .cse3 .cse4) .cse5) 4))) (or (not (= (select (select .cse0 .cse1) .cse2) 0)) (not (= (select (select .cse3 .cse1) .cse2) 0)))))))) is different from false [2024-11-18 13:09:59,410 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1760 (Array Int Int)) (v_ArrVal_1759 (Array Int Int))) (let ((.cse8 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse9 (+ (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 4))) (let ((.cse6 (select (select |c_#memory_$Pointer$#1.base| .cse8) .cse9)) (.cse7 (+ (select (select |c_#memory_$Pointer$#1.offset| .cse8) .cse9) 4))) (let ((.cse3 (store (store |c_#memory_$Pointer$#1.offset| .cse6 (store (select |c_#memory_$Pointer$#1.offset| .cse6) .cse7 |c_ULTIMATE.start_dll_append_#t~ret7#1.offset|)) |c_ULTIMATE.start_dll_append_#t~ret7#1.base| v_ArrVal_1760)) (.cse0 (store (store |c_#memory_$Pointer$#1.base| .cse6 (store (select |c_#memory_$Pointer$#1.base| .cse6) .cse7 |c_ULTIMATE.start_dll_append_#t~ret7#1.base|)) |c_ULTIMATE.start_dll_append_#t~ret7#1.base| v_ArrVal_1759)) (.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))) (let ((.cse1 (select (select .cse0 .cse4) .cse5)) (.cse2 (+ 4 (select (select .cse3 .cse4) .cse5)))) (or (not (= (select (select .cse0 .cse1) .cse2) 0)) (not (= (select (select .cse3 .cse1) .cse2) 0)))))))) is different from false [2024-11-18 13:09:59,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [613929865] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 13:09:59,579 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-18 13:09:59,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 49 [2024-11-18 13:09:59,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1424689881] [2024-11-18 13:09:59,579 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-18 13:09:59,579 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2024-11-18 13:09:59,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 13:09:59,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2024-11-18 13:09:59,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=1384, Unknown=39, NotChecked=1748, Total=3306 [2024-11-18 13:09:59,581 INFO L87 Difference]: Start difference. First operand 75 states and 85 transitions. Second operand has 49 states, 47 states have (on average 1.4680851063829787) internal successors, (69), 40 states have internal predecessors, (69), 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) [2024-11-18 13:09:59,789 WARN L851 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_#t~ret4#1.base|) 1) (exists ((|v_#valid_BEFORE_CALL_22| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_22| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_22| |c_ULTIMATE.start_dll_create_#t~ret4#1.base|) 0) (= |c_#valid| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_22| |c_#valid|))) (store |v_#valid_BEFORE_CALL_22| .cse0 (select |c_#valid| .cse0)))))) (not (= |c_ULTIMATE.start_dll_create_#t~ret4#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (= |c_ULTIMATE.start_dll_create_#t~ret4#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1)) is different from false [2024-11-18 13:09:59,790 WARN L873 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_#t~ret4#1.base|) 1) (exists ((|v_#valid_BEFORE_CALL_22| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_22| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_22| |c_ULTIMATE.start_dll_create_#t~ret4#1.base|) 0) (= |c_#valid| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_22| |c_#valid|))) (store |v_#valid_BEFORE_CALL_22| .cse0 (select |c_#valid| .cse0)))))) (not (= |c_ULTIMATE.start_dll_create_#t~ret4#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (= |c_ULTIMATE.start_dll_create_#t~ret4#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1)) is different from true [2024-11-18 13:09:59,792 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4))) (and (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| .cse0) 1) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (= .cse0 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4) 0) (exists ((|v_#valid_BEFORE_CALL_22| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_22| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1) (= |c_#valid| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_22| |c_#valid|))) (store |v_#valid_BEFORE_CALL_22| .cse1 (select |c_#valid| .cse1)))) (= (select |v_#valid_BEFORE_CALL_22| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 0))))) is different from false [2024-11-18 13:09:59,794 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4))) (and (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| .cse0) 1) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (= .cse0 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4) 0) (exists ((|v_#valid_BEFORE_CALL_22| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_22| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1) (= |c_#valid| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_22| |c_#valid|))) (store |v_#valid_BEFORE_CALL_22| .cse1 (select |c_#valid| .cse1)))) (= (select |v_#valid_BEFORE_CALL_22| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 0))))) is different from true [2024-11-18 13:09:59,796 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4))) (let ((.cse0 (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse2)) (.cse1 (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4) 0))) (and (or .cse0 .cse1) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| .cse2) 1) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (exists ((|v_#valid_BEFORE_CALL_22| (Array Int Int))) (and (= |c_#valid| (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_22| |c_#valid|))) (store |v_#valid_BEFORE_CALL_22| .cse3 (select |c_#valid| .cse3)))) (= (select |v_#valid_BEFORE_CALL_22| .cse2) 1) (= (select |v_#valid_BEFORE_CALL_22| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 0))) (not .cse0) .cse1))) is different from false [2024-11-18 13:09:59,797 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4))) (let ((.cse0 (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse2)) (.cse1 (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4) 0))) (and (or .cse0 .cse1) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| .cse2) 1) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (exists ((|v_#valid_BEFORE_CALL_22| (Array Int Int))) (and (= |c_#valid| (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_22| |c_#valid|))) (store |v_#valid_BEFORE_CALL_22| .cse3 (select |c_#valid| .cse3)))) (= (select |v_#valid_BEFORE_CALL_22| .cse2) 1) (= (select |v_#valid_BEFORE_CALL_22| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 0))) (not .cse0) .cse1))) is different from true [2024-11-18 13:09:59,799 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4))) (let ((.cse2 (= .cse0 |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (.cse3 (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4) 0))) (and (= (select |c_#valid| .cse0) 1) (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_22| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_22| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_22| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 0) (= |c_#valid| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_22| |c_#valid|))) (store |v_#valid_BEFORE_CALL_22| .cse1 (select |c_#valid| .cse1)))))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (not .cse2) (or .cse2 .cse3) .cse3 (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1)))) is different from false [2024-11-18 13:09:59,800 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4))) (let ((.cse2 (= .cse0 |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (.cse3 (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4) 0))) (and (= (select |c_#valid| .cse0) 1) (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_22| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_22| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_22| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 0) (= |c_#valid| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_22| |c_#valid|))) (store |v_#valid_BEFORE_CALL_22| .cse1 (select |c_#valid| .cse1)))))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (not .cse2) (or .cse2 .cse3) .cse3 (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1)))) is different from true [2024-11-18 13:09:59,803 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_#res#1.base|) 4))) (let ((.cse0 (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_#res#1.base|) 4) 0)) (.cse3 (= .cse2 |c_ULTIMATE.start_dll_create_#res#1.base|))) (and (= (select |c_#valid| |c_ULTIMATE.start_dll_create_#res#1.base|) 1) .cse0 (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_22| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_22| |c_ULTIMATE.start_dll_create_#res#1.base|) 0) (= |c_#valid| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_22| |c_#valid|))) (store |v_#valid_BEFORE_CALL_22| .cse1 (select |c_#valid| .cse1)))) (= (select |v_#valid_BEFORE_CALL_22| .cse2) 1))) (not .cse3) (= |c_ULTIMATE.start_dll_create_#res#1.offset| 0) (or .cse0 .cse3) (= (select |c_#valid| .cse2) 1)))) is different from false [2024-11-18 13:09:59,804 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_#res#1.base|) 4))) (let ((.cse0 (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_#res#1.base|) 4) 0)) (.cse3 (= .cse2 |c_ULTIMATE.start_dll_create_#res#1.base|))) (and (= (select |c_#valid| |c_ULTIMATE.start_dll_create_#res#1.base|) 1) .cse0 (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_22| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_22| |c_ULTIMATE.start_dll_create_#res#1.base|) 0) (= |c_#valid| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_22| |c_#valid|))) (store |v_#valid_BEFORE_CALL_22| .cse1 (select |c_#valid| .cse1)))) (= (select |v_#valid_BEFORE_CALL_22| .cse2) 1))) (not .cse3) (= |c_ULTIMATE.start_dll_create_#res#1.offset| 0) (or .cse0 .cse3) (= (select |c_#valid| .cse2) 1)))) is different from true [2024-11-18 13:09:59,807 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0)) (.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|))) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| .cse0) 4)) (.cse3 (select (select |c_#memory_$Pointer$#1.base| .cse2) 4))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |c_ULTIMATE.start_dll_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |c_#valid| .cse0) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 0) (= (select |c_#valid| .cse1) 1) (not (= .cse0 .cse1)) (exists ((|v_#valid_BEFORE_CALL_22| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_22| .cse2) 0) (= 1 (select |v_#valid_BEFORE_CALL_22| .cse3)) (= |c_#valid| (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_22| |c_#valid|))) (store |v_#valid_BEFORE_CALL_22| .cse4 (select |c_#valid| .cse4)))))) (= (select |c_#valid| .cse2) 1) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#1.offset| .cse0) 4) 0) (= |c_ULTIMATE.start_dll_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (or (= (select (select |c_#memory_$Pointer$#1.offset| .cse2) 4) 0) (= .cse3 .cse2)) (= |c_ULTIMATE.start_dll_append_~head#1.offset| 0)))) is different from false [2024-11-18 13:09:59,808 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0)) (.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|))) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| .cse0) 4)) (.cse3 (select (select |c_#memory_$Pointer$#1.base| .cse2) 4))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |c_ULTIMATE.start_dll_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |c_#valid| .cse0) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 0) (= (select |c_#valid| .cse1) 1) (not (= .cse0 .cse1)) (exists ((|v_#valid_BEFORE_CALL_22| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_22| .cse2) 0) (= 1 (select |v_#valid_BEFORE_CALL_22| .cse3)) (= |c_#valid| (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_22| |c_#valid|))) (store |v_#valid_BEFORE_CALL_22| .cse4 (select |c_#valid| .cse4)))))) (= (select |c_#valid| .cse2) 1) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#1.offset| .cse0) 4) 0) (= |c_ULTIMATE.start_dll_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (or (= (select (select |c_#memory_$Pointer$#1.offset| .cse2) 4) 0) (= .cse3 .cse2)) (= |c_ULTIMATE.start_dll_append_~head#1.offset| 0)))) is different from true [2024-11-18 13:09:59,812 WARN L851 $PredicateComparison]: unable to prove that (and (exists ((|v_#valid_BEFORE_CALL_23| (Array Int Int)) (|v_#valid_BEFORE_CALL_22| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8| Int) (v_arrayElimCell_116 Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8|) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8|) 0) 0) (= (select |v_#valid_BEFORE_CALL_22| v_arrayElimCell_116) 1) (= (select |v_#valid_BEFORE_CALL_23| .cse0) 1) (= |v_#valid_BEFORE_CALL_23| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_22| |v_#valid_BEFORE_CALL_23|))) (store |v_#valid_BEFORE_CALL_22| .cse1 (select |v_#valid_BEFORE_CALL_23| .cse1)))) (= (select |v_#valid_BEFORE_CALL_22| .cse0) 0)))) (not (= |c_node_create_~temp~0#1.base| 0)) (= |c_#memory_$Pointer$#1.offset| |c_old(#memory_$Pointer$#1.offset)|) (= |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 [2024-11-18 13:09:59,813 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((|v_#valid_BEFORE_CALL_23| (Array Int Int)) (|v_#valid_BEFORE_CALL_22| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8| Int) (v_arrayElimCell_116 Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8|) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8|) 0) 0) (= (select |v_#valid_BEFORE_CALL_22| v_arrayElimCell_116) 1) (= (select |v_#valid_BEFORE_CALL_23| .cse0) 1) (= |v_#valid_BEFORE_CALL_23| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_22| |v_#valid_BEFORE_CALL_23|))) (store |v_#valid_BEFORE_CALL_22| .cse1 (select |v_#valid_BEFORE_CALL_23| .cse1)))) (= (select |v_#valid_BEFORE_CALL_22| .cse0) 0)))) (not (= |c_node_create_~temp~0#1.base| 0)) (= |c_#memory_$Pointer$#1.offset| |c_old(#memory_$Pointer$#1.offset)|) (= |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 [2024-11-18 13:09:59,816 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (@diff |c_old(#memory_$Pointer$#1.offset)| |c_#memory_$Pointer$#1.offset|)) (.cse2 (@diff |c_old(#memory_$Pointer$#1.base)| |c_#memory_$Pointer$#1.base|))) (and (exists ((|v_#valid_BEFORE_CALL_23| (Array Int Int)) (|v_#valid_BEFORE_CALL_22| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8| Int) (v_arrayElimCell_116 Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8|) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8|) 0) 0) (= (select |v_#valid_BEFORE_CALL_22| v_arrayElimCell_116) 1) (= (select |v_#valid_BEFORE_CALL_23| .cse0) 1) (= |v_#valid_BEFORE_CALL_23| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_22| |v_#valid_BEFORE_CALL_23|))) (store |v_#valid_BEFORE_CALL_22| .cse1 (select |v_#valid_BEFORE_CALL_23| .cse1)))) (= (select |v_#valid_BEFORE_CALL_22| .cse0) 0)))) (= |c_node_create_#res#1.offset| 0) (= (select |c_old(#valid)| |c_node_create_#res#1.base|) 0) (= (select |c_#valid| |c_node_create_#res#1.base|) 1) (= |c_#memory_$Pointer$#1.base| (store |c_old(#memory_$Pointer$#1.base)| .cse2 (select |c_#memory_$Pointer$#1.base| .cse2))) (not (= |c_node_create_#res#1.base| 0)) (= |c_#memory_$Pointer$#1.base| (store |c_old(#memory_$Pointer$#1.base)| |c_node_create_#res#1.base| (select |c_#memory_$Pointer$#1.base| |c_node_create_#res#1.base|))) (= |c_#memory_$Pointer$#1.offset| (store |c_old(#memory_$Pointer$#1.offset)| |c_node_create_#res#1.base| (select |c_#memory_$Pointer$#1.offset| |c_node_create_#res#1.base|))) (or (= |c_#memory_$Pointer$#1.offset| |c_old(#memory_$Pointer$#1.offset)|) (= (select |c_old(#valid)| .cse3) 0)) (= |c_#memory_$Pointer$#1.offset| (store |c_old(#memory_$Pointer$#1.offset)| .cse3 (select |c_#memory_$Pointer$#1.offset| .cse3))) (or (= (select |c_old(#valid)| .cse2) 0) (= |c_#memory_$Pointer$#1.base| |c_old(#memory_$Pointer$#1.base)|)))) is different from false [2024-11-18 13:09:59,818 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse3 (@diff |c_old(#memory_$Pointer$#1.offset)| |c_#memory_$Pointer$#1.offset|)) (.cse2 (@diff |c_old(#memory_$Pointer$#1.base)| |c_#memory_$Pointer$#1.base|))) (and (exists ((|v_#valid_BEFORE_CALL_23| (Array Int Int)) (|v_#valid_BEFORE_CALL_22| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8| Int) (v_arrayElimCell_116 Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8|) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8|) 0) 0) (= (select |v_#valid_BEFORE_CALL_22| v_arrayElimCell_116) 1) (= (select |v_#valid_BEFORE_CALL_23| .cse0) 1) (= |v_#valid_BEFORE_CALL_23| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_22| |v_#valid_BEFORE_CALL_23|))) (store |v_#valid_BEFORE_CALL_22| .cse1 (select |v_#valid_BEFORE_CALL_23| .cse1)))) (= (select |v_#valid_BEFORE_CALL_22| .cse0) 0)))) (= |c_node_create_#res#1.offset| 0) (= (select |c_old(#valid)| |c_node_create_#res#1.base|) 0) (= (select |c_#valid| |c_node_create_#res#1.base|) 1) (= |c_#memory_$Pointer$#1.base| (store |c_old(#memory_$Pointer$#1.base)| .cse2 (select |c_#memory_$Pointer$#1.base| .cse2))) (not (= |c_node_create_#res#1.base| 0)) (= |c_#memory_$Pointer$#1.base| (store |c_old(#memory_$Pointer$#1.base)| |c_node_create_#res#1.base| (select |c_#memory_$Pointer$#1.base| |c_node_create_#res#1.base|))) (= |c_#memory_$Pointer$#1.offset| (store |c_old(#memory_$Pointer$#1.offset)| |c_node_create_#res#1.base| (select |c_#memory_$Pointer$#1.offset| |c_node_create_#res#1.base|))) (or (= |c_#memory_$Pointer$#1.offset| |c_old(#memory_$Pointer$#1.offset)|) (= (select |c_old(#valid)| .cse3) 0)) (= |c_#memory_$Pointer$#1.offset| (store |c_old(#memory_$Pointer$#1.offset)| .cse3 (select |c_#memory_$Pointer$#1.offset| .cse3))) (or (= (select |c_old(#valid)| .cse2) 0) (= |c_#memory_$Pointer$#1.base| |c_old(#memory_$Pointer$#1.base)|)))) is different from true [2024-11-18 13:09:59,828 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)) (.cse2 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|))) (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| .cse2) 4)) (.cse5 (select (select |c_#memory_$Pointer$#1.base| .cse4) 4))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (exists ((|v_#valid_BEFORE_CALL_23| (Array Int Int)) (|v_#valid_BEFORE_CALL_22| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8| Int) (v_arrayElimCell_116 Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8|) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8|) 0) 0) (= (select |v_#valid_BEFORE_CALL_22| v_arrayElimCell_116) 1) (= (select |v_#valid_BEFORE_CALL_23| .cse0) 1) (= |v_#valid_BEFORE_CALL_23| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_22| |v_#valid_BEFORE_CALL_23|))) (store |v_#valid_BEFORE_CALL_22| .cse1 (select |v_#valid_BEFORE_CALL_23| .cse1)))) (= (select |v_#valid_BEFORE_CALL_22| .cse0) 0)))) (= |c_ULTIMATE.start_dll_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 0) (not (= .cse2 .cse3)) (not (= |c_ULTIMATE.start_dll_append_#t~ret7#1.base| .cse3)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#1.offset| .cse2) 4) 0) (not (= |c_ULTIMATE.start_dll_append_#t~ret7#1.base| 0)) (= |c_ULTIMATE.start_dll_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= |c_ULTIMATE.start_dll_append_#t~ret7#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_25| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_27| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_27| .cse4) 1) (= (select |v_#valid_BEFORE_CALL_25| .cse4) 0) (= (select |v_#valid_BEFORE_CALL_25| .cse5) 1) (= (select |v_old(#valid)_AFTER_CALL_27| |c_ULTIMATE.start_dll_append_#t~ret7#1.base|) 0) (= |v_old(#valid)_AFTER_CALL_27| (let ((.cse6 (@diff |v_#valid_BEFORE_CALL_25| |v_old(#valid)_AFTER_CALL_27|))) (store |v_#valid_BEFORE_CALL_25| .cse6 (select |v_old(#valid)_AFTER_CALL_27| .cse6)))))) (or (= (select (select |c_#memory_$Pointer$#1.offset| .cse4) 4) 0) (= .cse5 .cse4)) (not (= |c_ULTIMATE.start_dll_append_#t~ret7#1.base| .cse2)) (= |c_ULTIMATE.start_dll_append_~head#1.offset| 0)))) is different from false [2024-11-18 13:09:59,830 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)) (.cse2 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|))) (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| .cse2) 4)) (.cse5 (select (select |c_#memory_$Pointer$#1.base| .cse4) 4))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (exists ((|v_#valid_BEFORE_CALL_23| (Array Int Int)) (|v_#valid_BEFORE_CALL_22| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8| Int) (v_arrayElimCell_116 Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8|) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8|) 0) 0) (= (select |v_#valid_BEFORE_CALL_22| v_arrayElimCell_116) 1) (= (select |v_#valid_BEFORE_CALL_23| .cse0) 1) (= |v_#valid_BEFORE_CALL_23| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_22| |v_#valid_BEFORE_CALL_23|))) (store |v_#valid_BEFORE_CALL_22| .cse1 (select |v_#valid_BEFORE_CALL_23| .cse1)))) (= (select |v_#valid_BEFORE_CALL_22| .cse0) 0)))) (= |c_ULTIMATE.start_dll_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 0) (not (= .cse2 .cse3)) (not (= |c_ULTIMATE.start_dll_append_#t~ret7#1.base| .cse3)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#1.offset| .cse2) 4) 0) (not (= |c_ULTIMATE.start_dll_append_#t~ret7#1.base| 0)) (= |c_ULTIMATE.start_dll_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= |c_ULTIMATE.start_dll_append_#t~ret7#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_25| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_27| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_27| .cse4) 1) (= (select |v_#valid_BEFORE_CALL_25| .cse4) 0) (= (select |v_#valid_BEFORE_CALL_25| .cse5) 1) (= (select |v_old(#valid)_AFTER_CALL_27| |c_ULTIMATE.start_dll_append_#t~ret7#1.base|) 0) (= |v_old(#valid)_AFTER_CALL_27| (let ((.cse6 (@diff |v_#valid_BEFORE_CALL_25| |v_old(#valid)_AFTER_CALL_27|))) (store |v_#valid_BEFORE_CALL_25| .cse6 (select |v_old(#valid)_AFTER_CALL_27| .cse6)))))) (or (= (select (select |c_#memory_$Pointer$#1.offset| .cse4) 4) 0) (= .cse5 .cse4)) (not (= |c_ULTIMATE.start_dll_append_#t~ret7#1.base| .cse2)) (= |c_ULTIMATE.start_dll_append_~head#1.offset| 0)))) is different from true [2024-11-18 13:09:59,837 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse4 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse5 (select (select |c_#memory_$Pointer$#1.base| .cse4) 4)) (.cse3 (select (select |c_#memory_$Pointer$#1.base| .cse2) 4))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (exists ((|v_#valid_BEFORE_CALL_23| (Array Int Int)) (|v_#valid_BEFORE_CALL_22| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8| Int) (v_arrayElimCell_116 Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8|) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8|) 0) 0) (= (select |v_#valid_BEFORE_CALL_22| v_arrayElimCell_116) 1) (= (select |v_#valid_BEFORE_CALL_23| .cse0) 1) (= |v_#valid_BEFORE_CALL_23| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_22| |v_#valid_BEFORE_CALL_23|))) (store |v_#valid_BEFORE_CALL_22| .cse1 (select |v_#valid_BEFORE_CALL_23| .cse1)))) (= (select |v_#valid_BEFORE_CALL_22| .cse0) 0)))) (= |c_ULTIMATE.start_dll_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_append_~new_last~0#1.offset| 0) (not (= .cse2 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 0) (not (= .cse2 .cse3)) (not (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| 0)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#1.offset| .cse2) 4) 0) (exists ((|v_#valid_BEFORE_CALL_25| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_27| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_27| .cse4) 1) (= (select |v_#valid_BEFORE_CALL_25| .cse4) 0) (= (select |v_#valid_BEFORE_CALL_25| .cse5) 1) (= (select |v_old(#valid)_AFTER_CALL_27| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) 0) (= |v_old(#valid)_AFTER_CALL_27| (let ((.cse6 (@diff |v_#valid_BEFORE_CALL_25| |v_old(#valid)_AFTER_CALL_27|))) (store |v_#valid_BEFORE_CALL_25| .cse6 (select |v_old(#valid)_AFTER_CALL_27| .cse6)))))) (= |c_ULTIMATE.start_dll_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (or (= (select (select |c_#memory_$Pointer$#1.offset| .cse4) 4) 0) (= .cse5 .cse4)) (not (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| .cse3)) (= |c_ULTIMATE.start_dll_append_~head#1.offset| 0)))) is different from false [2024-11-18 13:09:59,839 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse4 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse5 (select (select |c_#memory_$Pointer$#1.base| .cse4) 4)) (.cse3 (select (select |c_#memory_$Pointer$#1.base| .cse2) 4))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (exists ((|v_#valid_BEFORE_CALL_23| (Array Int Int)) (|v_#valid_BEFORE_CALL_22| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8| Int) (v_arrayElimCell_116 Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8|) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8|) 0) 0) (= (select |v_#valid_BEFORE_CALL_22| v_arrayElimCell_116) 1) (= (select |v_#valid_BEFORE_CALL_23| .cse0) 1) (= |v_#valid_BEFORE_CALL_23| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_22| |v_#valid_BEFORE_CALL_23|))) (store |v_#valid_BEFORE_CALL_22| .cse1 (select |v_#valid_BEFORE_CALL_23| .cse1)))) (= (select |v_#valid_BEFORE_CALL_22| .cse0) 0)))) (= |c_ULTIMATE.start_dll_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_append_~new_last~0#1.offset| 0) (not (= .cse2 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 0) (not (= .cse2 .cse3)) (not (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| 0)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#1.offset| .cse2) 4) 0) (exists ((|v_#valid_BEFORE_CALL_25| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_27| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_27| .cse4) 1) (= (select |v_#valid_BEFORE_CALL_25| .cse4) 0) (= (select |v_#valid_BEFORE_CALL_25| .cse5) 1) (= (select |v_old(#valid)_AFTER_CALL_27| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) 0) (= |v_old(#valid)_AFTER_CALL_27| (let ((.cse6 (@diff |v_#valid_BEFORE_CALL_25| |v_old(#valid)_AFTER_CALL_27|))) (store |v_#valid_BEFORE_CALL_25| .cse6 (select |v_old(#valid)_AFTER_CALL_27| .cse6)))))) (= |c_ULTIMATE.start_dll_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (or (= (select (select |c_#memory_$Pointer$#1.offset| .cse4) 4) 0) (= .cse5 .cse4)) (not (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| .cse3)) (= |c_ULTIMATE.start_dll_append_~head#1.offset| 0)))) is different from true [2024-11-18 13:09:59,851 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse3 (select .cse5 0))) (let ((.cse0 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse4 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_append_~last~0#1.base|) 4)) (.cse6 (select (select |c_#memory_$Pointer$#1.base| .cse3) 4))) (and (= (select .cse0 0) 0) (exists ((|v_#valid_BEFORE_CALL_23| (Array Int Int)) (|v_#valid_BEFORE_CALL_22| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8| Int) (v_arrayElimCell_116 Int)) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8|) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8|) 0) 0) (= (select |v_#valid_BEFORE_CALL_22| v_arrayElimCell_116) 1) (= (select |v_#valid_BEFORE_CALL_23| .cse1) 1) (= |v_#valid_BEFORE_CALL_23| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_22| |v_#valid_BEFORE_CALL_23|))) (store |v_#valid_BEFORE_CALL_22| .cse2 (select |v_#valid_BEFORE_CALL_23| .cse2)))) (= (select |v_#valid_BEFORE_CALL_22| .cse1) 0)))) (= |c_ULTIMATE.start_dll_append_~new_last~0#1.offset| 0) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse3) (= (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (not (= |c_ULTIMATE.start_dll_append_~last~0#1.base| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) (not (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse4)) (not (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| 0)) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| (select .cse5 |c_ULTIMATE.start_main_~#s~0#1.offset|)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_25| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_27| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_27| .cse3) 1) (= (select |v_#valid_BEFORE_CALL_25| .cse3) 0) (= (select |v_#valid_BEFORE_CALL_25| .cse6) 1) (= (select |v_old(#valid)_AFTER_CALL_27| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) 0) (= |v_old(#valid)_AFTER_CALL_27| (let ((.cse7 (@diff |v_#valid_BEFORE_CALL_25| |v_old(#valid)_AFTER_CALL_27|))) (store |v_#valid_BEFORE_CALL_25| .cse7 (select |v_old(#valid)_AFTER_CALL_27| .cse7)))))) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base|) 4) 0) (not (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| .cse4)) (= |c_ULTIMATE.start_dll_append_~last~0#1.offset| 0) (or (= (select (select |c_#memory_$Pointer$#1.offset| .cse3) 4) 0) (= .cse6 .cse3)))))) is different from false [2024-11-18 13:09:59,853 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse3 (select .cse5 0))) (let ((.cse0 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse4 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_append_~last~0#1.base|) 4)) (.cse6 (select (select |c_#memory_$Pointer$#1.base| .cse3) 4))) (and (= (select .cse0 0) 0) (exists ((|v_#valid_BEFORE_CALL_23| (Array Int Int)) (|v_#valid_BEFORE_CALL_22| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8| Int) (v_arrayElimCell_116 Int)) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8|) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8|) 0) 0) (= (select |v_#valid_BEFORE_CALL_22| v_arrayElimCell_116) 1) (= (select |v_#valid_BEFORE_CALL_23| .cse1) 1) (= |v_#valid_BEFORE_CALL_23| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_22| |v_#valid_BEFORE_CALL_23|))) (store |v_#valid_BEFORE_CALL_22| .cse2 (select |v_#valid_BEFORE_CALL_23| .cse2)))) (= (select |v_#valid_BEFORE_CALL_22| .cse1) 0)))) (= |c_ULTIMATE.start_dll_append_~new_last~0#1.offset| 0) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse3) (= (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (not (= |c_ULTIMATE.start_dll_append_~last~0#1.base| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) (not (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse4)) (not (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| 0)) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| (select .cse5 |c_ULTIMATE.start_main_~#s~0#1.offset|)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_25| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_27| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_27| .cse3) 1) (= (select |v_#valid_BEFORE_CALL_25| .cse3) 0) (= (select |v_#valid_BEFORE_CALL_25| .cse6) 1) (= (select |v_old(#valid)_AFTER_CALL_27| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) 0) (= |v_old(#valid)_AFTER_CALL_27| (let ((.cse7 (@diff |v_#valid_BEFORE_CALL_25| |v_old(#valid)_AFTER_CALL_27|))) (store |v_#valid_BEFORE_CALL_25| .cse7 (select |v_old(#valid)_AFTER_CALL_27| .cse7)))))) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base|) 4) 0) (not (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| .cse4)) (= |c_ULTIMATE.start_dll_append_~last~0#1.offset| 0) (or (= (select (select |c_#memory_$Pointer$#1.offset| .cse3) 4) 0) (= .cse6 .cse3)))))) is different from true [2024-11-18 13:09:59,862 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse3 (select .cse5 0))) (let ((.cse0 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse4 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_append_~last~0#1.base|) 4)) (.cse6 (select (select |c_#memory_$Pointer$#1.base| .cse3) 4))) (and (= (select .cse0 0) 0) (exists ((|v_#valid_BEFORE_CALL_23| (Array Int Int)) (|v_#valid_BEFORE_CALL_22| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8| Int) (v_arrayElimCell_116 Int)) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8|) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8|) 0) 0) (= (select |v_#valid_BEFORE_CALL_22| v_arrayElimCell_116) 1) (= (select |v_#valid_BEFORE_CALL_23| .cse1) 1) (= |v_#valid_BEFORE_CALL_23| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_22| |v_#valid_BEFORE_CALL_23|))) (store |v_#valid_BEFORE_CALL_22| .cse2 (select |v_#valid_BEFORE_CALL_23| .cse2)))) (= (select |v_#valid_BEFORE_CALL_22| .cse1) 0)))) (= |c_ULTIMATE.start_dll_append_~new_last~0#1.offset| 0) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse3) (= (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (not (= |c_ULTIMATE.start_dll_append_~last~0#1.base| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) (not (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse4)) (not (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| 0)) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| (select .cse5 |c_ULTIMATE.start_main_~#s~0#1.offset|)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_25| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_27| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_27| .cse3) 1) (= (select |v_#valid_BEFORE_CALL_25| .cse3) 0) (= (select |v_#valid_BEFORE_CALL_25| .cse6) 1) (= (select |v_old(#valid)_AFTER_CALL_27| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) 0) (= |v_old(#valid)_AFTER_CALL_27| (let ((.cse7 (@diff |v_#valid_BEFORE_CALL_25| |v_old(#valid)_AFTER_CALL_27|))) (store |v_#valid_BEFORE_CALL_25| .cse7 (select |v_old(#valid)_AFTER_CALL_27| .cse7)))))) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base|) 4) 0) (not (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| .cse4)) (= |c_ULTIMATE.start_dll_append_~last~0#1.offset| 0) (or (= (select (select |c_#memory_$Pointer$#1.offset| .cse3) 4) 0) (= .cse6 .cse3)) (= |c_ULTIMATE.start_dll_append_#t~mem10#1.offset| 0))))) is different from false [2024-11-18 13:09:59,864 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse3 (select .cse5 0))) (let ((.cse0 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse4 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_append_~last~0#1.base|) 4)) (.cse6 (select (select |c_#memory_$Pointer$#1.base| .cse3) 4))) (and (= (select .cse0 0) 0) (exists ((|v_#valid_BEFORE_CALL_23| (Array Int Int)) (|v_#valid_BEFORE_CALL_22| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8| Int) (v_arrayElimCell_116 Int)) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8|) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8|) 0) 0) (= (select |v_#valid_BEFORE_CALL_22| v_arrayElimCell_116) 1) (= (select |v_#valid_BEFORE_CALL_23| .cse1) 1) (= |v_#valid_BEFORE_CALL_23| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_22| |v_#valid_BEFORE_CALL_23|))) (store |v_#valid_BEFORE_CALL_22| .cse2 (select |v_#valid_BEFORE_CALL_23| .cse2)))) (= (select |v_#valid_BEFORE_CALL_22| .cse1) 0)))) (= |c_ULTIMATE.start_dll_append_~new_last~0#1.offset| 0) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse3) (= (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (not (= |c_ULTIMATE.start_dll_append_~last~0#1.base| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) (not (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse4)) (not (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| 0)) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| (select .cse5 |c_ULTIMATE.start_main_~#s~0#1.offset|)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_25| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_27| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_27| .cse3) 1) (= (select |v_#valid_BEFORE_CALL_25| .cse3) 0) (= (select |v_#valid_BEFORE_CALL_25| .cse6) 1) (= (select |v_old(#valid)_AFTER_CALL_27| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) 0) (= |v_old(#valid)_AFTER_CALL_27| (let ((.cse7 (@diff |v_#valid_BEFORE_CALL_25| |v_old(#valid)_AFTER_CALL_27|))) (store |v_#valid_BEFORE_CALL_25| .cse7 (select |v_old(#valid)_AFTER_CALL_27| .cse7)))))) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base|) 4) 0) (not (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| .cse4)) (= |c_ULTIMATE.start_dll_append_~last~0#1.offset| 0) (or (= (select (select |c_#memory_$Pointer$#1.offset| .cse3) 4) 0) (= .cse6 .cse3)) (= |c_ULTIMATE.start_dll_append_#t~mem10#1.offset| 0))))) is different from true [2024-11-18 13:09:59,871 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 ((.cse0 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse7 (select (select |c_#memory_$Pointer$#1.offset| .cse5) 4)) (.cse4 (select (select |c_#memory_$Pointer$#1.base| .cse5) 4)) (.cse3 (select .cse8 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (and (= (select .cse0 0) 0) (exists ((|v_#valid_BEFORE_CALL_23| (Array Int Int)) (|v_#valid_BEFORE_CALL_22| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8| Int) (v_arrayElimCell_116 Int)) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8|) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8|) 0) 0) (= (select |v_#valid_BEFORE_CALL_22| v_arrayElimCell_116) 1) (= (select |v_#valid_BEFORE_CALL_23| .cse1) 1) (= |v_#valid_BEFORE_CALL_23| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_22| |v_#valid_BEFORE_CALL_23|))) (store |v_#valid_BEFORE_CALL_22| .cse2 (select |v_#valid_BEFORE_CALL_23| .cse2)))) (= (select |v_#valid_BEFORE_CALL_22| .cse1) 0)))) (= |c_ULTIMATE.start_dll_append_~new_last~0#1.offset| 0) (= (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (not (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse3)) (not (= |c_ULTIMATE.start_dll_append_~last~0#1.base| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) (not (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| 0)) (not (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| .cse3)) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse4) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_25| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_27| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_27| .cse5) 1) (= (select |v_#valid_BEFORE_CALL_25| .cse5) 0) (= (select |v_#valid_BEFORE_CALL_25| .cse4) 1) (= (select |v_old(#valid)_AFTER_CALL_27| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) 0) (= |v_old(#valid)_AFTER_CALL_27| (let ((.cse6 (@diff |v_#valid_BEFORE_CALL_25| |v_old(#valid)_AFTER_CALL_27|))) (store |v_#valid_BEFORE_CALL_25| .cse6 (select |v_old(#valid)_AFTER_CALL_27| .cse6)))))) (= |c_ULTIMATE.start_dll_append_~last~0#1.offset| .cse7) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| (select (select |c_#memory_$Pointer$#1.base| .cse3) 4)) (= |c_ULTIMATE.start_dll_append_~last~0#1.offset| 0) (or (= .cse7 0) (= .cse4 .cse5)) (= (select (select |c_#memory_$Pointer$#1.offset| .cse3) 4) 0))))) is different from false [2024-11-18 13:09:59,873 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 ((.cse0 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse7 (select (select |c_#memory_$Pointer$#1.offset| .cse5) 4)) (.cse4 (select (select |c_#memory_$Pointer$#1.base| .cse5) 4)) (.cse3 (select .cse8 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (and (= (select .cse0 0) 0) (exists ((|v_#valid_BEFORE_CALL_23| (Array Int Int)) (|v_#valid_BEFORE_CALL_22| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8| Int) (v_arrayElimCell_116 Int)) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8|) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8|) 0) 0) (= (select |v_#valid_BEFORE_CALL_22| v_arrayElimCell_116) 1) (= (select |v_#valid_BEFORE_CALL_23| .cse1) 1) (= |v_#valid_BEFORE_CALL_23| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_22| |v_#valid_BEFORE_CALL_23|))) (store |v_#valid_BEFORE_CALL_22| .cse2 (select |v_#valid_BEFORE_CALL_23| .cse2)))) (= (select |v_#valid_BEFORE_CALL_22| .cse1) 0)))) (= |c_ULTIMATE.start_dll_append_~new_last~0#1.offset| 0) (= (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (not (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse3)) (not (= |c_ULTIMATE.start_dll_append_~last~0#1.base| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) (not (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| 0)) (not (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| .cse3)) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse4) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_25| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_27| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_27| .cse5) 1) (= (select |v_#valid_BEFORE_CALL_25| .cse5) 0) (= (select |v_#valid_BEFORE_CALL_25| .cse4) 1) (= (select |v_old(#valid)_AFTER_CALL_27| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) 0) (= |v_old(#valid)_AFTER_CALL_27| (let ((.cse6 (@diff |v_#valid_BEFORE_CALL_25| |v_old(#valid)_AFTER_CALL_27|))) (store |v_#valid_BEFORE_CALL_25| .cse6 (select |v_old(#valid)_AFTER_CALL_27| .cse6)))))) (= |c_ULTIMATE.start_dll_append_~last~0#1.offset| .cse7) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| (select (select |c_#memory_$Pointer$#1.base| .cse3) 4)) (= |c_ULTIMATE.start_dll_append_~last~0#1.offset| 0) (or (= .cse7 0) (= .cse4 .cse5)) (= (select (select |c_#memory_$Pointer$#1.offset| .cse3) 4) 0))))) is different from true [2024-11-18 13:09:59,886 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse10 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse7 (select .cse10 0))) (let ((.cse6 (select (select |c_#memory_$Pointer$#1.offset| .cse7) 4))) (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| .cse7) 4)) (.cse4 (+ .cse6 4))) (let ((.cse0 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse8 (select (select |c_#memory_$Pointer$#1.base| .cse3) .cse4)) (.cse5 (select .cse10 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (and (= (select .cse0 0) 0) (exists ((|v_#valid_BEFORE_CALL_23| (Array Int Int)) (|v_#valid_BEFORE_CALL_22| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8| Int) (v_arrayElimCell_116 Int)) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8|) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8|) 0) 0) (= (select |v_#valid_BEFORE_CALL_22| v_arrayElimCell_116) 1) (= (select |v_#valid_BEFORE_CALL_23| .cse1) 1) (= |v_#valid_BEFORE_CALL_23| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_22| |v_#valid_BEFORE_CALL_23|))) (store |v_#valid_BEFORE_CALL_22| .cse2 (select |v_#valid_BEFORE_CALL_23| .cse2)))) (= (select |v_#valid_BEFORE_CALL_22| .cse1) 0)))) (= (select (select |c_#memory_$Pointer$#1.offset| .cse3) .cse4) 0) (= (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (not (= (select (select |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| .cse5) 4)) 4) 0)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (or (= .cse6 0) (= .cse3 .cse7)) (exists ((|v_#valid_BEFORE_CALL_25| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_27| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_27| .cse8) 0) (= (select |v_old(#valid)_AFTER_CALL_27| .cse7) 1) (= (select |v_#valid_BEFORE_CALL_25| .cse7) 0) (= (select |v_#valid_BEFORE_CALL_25| .cse3) 1) (= |v_old(#valid)_AFTER_CALL_27| (let ((.cse9 (@diff |v_#valid_BEFORE_CALL_25| |v_old(#valid)_AFTER_CALL_27|))) (store |v_#valid_BEFORE_CALL_25| .cse9 (select |v_old(#valid)_AFTER_CALL_27| .cse9)))))) (not (= .cse8 0)) (= (select (select |c_#memory_$Pointer$#1.offset| .cse5) 4) 0))))))) is different from false [2024-11-18 13:09:59,888 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse10 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse7 (select .cse10 0))) (let ((.cse6 (select (select |c_#memory_$Pointer$#1.offset| .cse7) 4))) (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| .cse7) 4)) (.cse4 (+ .cse6 4))) (let ((.cse0 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse8 (select (select |c_#memory_$Pointer$#1.base| .cse3) .cse4)) (.cse5 (select .cse10 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (and (= (select .cse0 0) 0) (exists ((|v_#valid_BEFORE_CALL_23| (Array Int Int)) (|v_#valid_BEFORE_CALL_22| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8| Int) (v_arrayElimCell_116 Int)) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8|) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8|) 0) 0) (= (select |v_#valid_BEFORE_CALL_22| v_arrayElimCell_116) 1) (= (select |v_#valid_BEFORE_CALL_23| .cse1) 1) (= |v_#valid_BEFORE_CALL_23| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_22| |v_#valid_BEFORE_CALL_23|))) (store |v_#valid_BEFORE_CALL_22| .cse2 (select |v_#valid_BEFORE_CALL_23| .cse2)))) (= (select |v_#valid_BEFORE_CALL_22| .cse1) 0)))) (= (select (select |c_#memory_$Pointer$#1.offset| .cse3) .cse4) 0) (= (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (not (= (select (select |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| .cse5) 4)) 4) 0)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (or (= .cse6 0) (= .cse3 .cse7)) (exists ((|v_#valid_BEFORE_CALL_25| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_27| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_27| .cse8) 0) (= (select |v_old(#valid)_AFTER_CALL_27| .cse7) 1) (= (select |v_#valid_BEFORE_CALL_25| .cse7) 0) (= (select |v_#valid_BEFORE_CALL_25| .cse3) 1) (= |v_old(#valid)_AFTER_CALL_27| (let ((.cse9 (@diff |v_#valid_BEFORE_CALL_25| |v_old(#valid)_AFTER_CALL_27|))) (store |v_#valid_BEFORE_CALL_25| .cse9 (select |v_old(#valid)_AFTER_CALL_27| .cse9)))))) (not (= .cse8 0)) (= (select (select |c_#memory_$Pointer$#1.offset| .cse5) 4) 0))))))) is different from true [2024-11-18 13:09:59,898 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse6 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~ptr~0#1.base|) 4)) (.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~ptr~0#1.base|) 4))) (let ((.cse3 (select |c_#memory_$Pointer$#1.base| .cse1)) (.cse5 (+ .cse6 4))) (let ((.cse4 (= .cse6 0)) (.cse0 (select .cse3 .cse5))) (and (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_25| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_27| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_25| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_27| .cse0) 0) (= (select |v_#valid_BEFORE_CALL_25| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_27| |c_ULTIMATE.start_main_~ptr~0#1.base|) 1) (= |v_old(#valid)_AFTER_CALL_27| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_25| |v_old(#valid)_AFTER_CALL_27|))) (store |v_#valid_BEFORE_CALL_25| .cse2 (select |v_old(#valid)_AFTER_CALL_27| .cse2)))))) (not (= (select .cse3 4) 0)) .cse4 (or .cse4 (= .cse1 |c_ULTIMATE.start_main_~ptr~0#1.base|)) (= (select (select |c_#memory_$Pointer$#1.offset| .cse1) .cse5) 0) (not (= 0 .cse0)))))) is different from false [2024-11-18 13:09:59,900 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse6 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~ptr~0#1.base|) 4)) (.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~ptr~0#1.base|) 4))) (let ((.cse3 (select |c_#memory_$Pointer$#1.base| .cse1)) (.cse5 (+ .cse6 4))) (let ((.cse4 (= .cse6 0)) (.cse0 (select .cse3 .cse5))) (and (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_25| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_27| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_25| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_27| .cse0) 0) (= (select |v_#valid_BEFORE_CALL_25| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_27| |c_ULTIMATE.start_main_~ptr~0#1.base|) 1) (= |v_old(#valid)_AFTER_CALL_27| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_25| |v_old(#valid)_AFTER_CALL_27|))) (store |v_#valid_BEFORE_CALL_25| .cse2 (select |v_old(#valid)_AFTER_CALL_27| .cse2)))))) (not (= (select .cse3 4) 0)) .cse4 (or .cse4 (= .cse1 |c_ULTIMATE.start_main_~ptr~0#1.base|)) (= (select (select |c_#memory_$Pointer$#1.offset| .cse1) .cse5) 0) (not (= 0 .cse0)))))) is different from true [2024-11-18 13:09:59,919 WARN L851 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_25| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_27| (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.base_22| Int)) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_main_~ptr~0#1.base_22|) 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| .cse1) 4))) (and (= (select |v_old(#valid)_AFTER_CALL_27| .cse0) 0) (= (select |v_#valid_BEFORE_CALL_25| .cse1) 1) (= (select (select |c_#memory_$Pointer$#1.offset| .cse1) 4) 0) (= (select |v_old(#valid)_AFTER_CALL_27| |v_ULTIMATE.start_main_~ptr~0#1.base_22|) 1) (not (= .cse0 0)) (= .cse1 |c_ULTIMATE.start_main_~ptr~0#1.base|) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_main_~ptr~0#1.base_22|) 4) 0) (= |v_old(#valid)_AFTER_CALL_27| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_25| |v_old(#valid)_AFTER_CALL_27|))) (store |v_#valid_BEFORE_CALL_25| .cse2 (select |v_old(#valid)_AFTER_CALL_27| .cse2)))) (= (select |v_#valid_BEFORE_CALL_25| |v_ULTIMATE.start_main_~ptr~0#1.base_22|) 0))))) (not (= (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~ptr~0#1.base|) 4) 0))) is different from false [2024-11-18 13:09:59,920 WARN L873 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_25| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_27| (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.base_22| Int)) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_main_~ptr~0#1.base_22|) 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| .cse1) 4))) (and (= (select |v_old(#valid)_AFTER_CALL_27| .cse0) 0) (= (select |v_#valid_BEFORE_CALL_25| .cse1) 1) (= (select (select |c_#memory_$Pointer$#1.offset| .cse1) 4) 0) (= (select |v_old(#valid)_AFTER_CALL_27| |v_ULTIMATE.start_main_~ptr~0#1.base_22|) 1) (not (= .cse0 0)) (= .cse1 |c_ULTIMATE.start_main_~ptr~0#1.base|) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_main_~ptr~0#1.base_22|) 4) 0) (= |v_old(#valid)_AFTER_CALL_27| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_25| |v_old(#valid)_AFTER_CALL_27|))) (store |v_#valid_BEFORE_CALL_25| .cse2 (select |v_old(#valid)_AFTER_CALL_27| .cse2)))) (= (select |v_#valid_BEFORE_CALL_25| |v_ULTIMATE.start_main_~ptr~0#1.base_22|) 0))))) (not (= (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~ptr~0#1.base|) 4) 0))) is different from true [2024-11-18 13:10:00,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 13:10:00,485 INFO L93 Difference]: Finished difference Result 113 states and 130 transitions. [2024-11-18 13:10:00,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2024-11-18 13:10:00,485 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 47 states have (on average 1.4680851063829787) internal successors, (69), 40 states have internal predecessors, (69), 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 46 [2024-11-18 13:10:00,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 13:10:00,486 INFO L225 Difference]: With dead ends: 113 [2024-11-18 13:10:00,486 INFO L226 Difference]: Without dead ends: 110 [2024-11-18 13:10:00,488 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 85 ConstructedPredicates, 35 IntricatePredicates, 0 DeprecatedPredicates, 480 ImplicationChecksByTransitivity, 9.4s TimeCoverageRelationStatistics Valid=250, Invalid=2471, Unknown=71, NotChecked=4690, Total=7482 [2024-11-18 13:10:00,488 INFO L432 NwaCegarLoop]: 34 mSDtfsCounter, 30 mSDsluCounter, 472 mSDsCounter, 0 mSdLazyCounter, 828 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 506 SdHoareTripleChecker+Invalid, 3426 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 828 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2585 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-18 13:10:00,488 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 506 Invalid, 3426 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 828 Invalid, 0 Unknown, 2585 Unchecked, 0.4s Time] [2024-11-18 13:10:00,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2024-11-18 13:10:00,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 91. [2024-11-18 13:10:00,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 80 states have (on average 1.1375) internal successors, (91), 80 states have internal predecessors, (91), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-18 13:10:00,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 105 transitions. [2024-11-18 13:10:00,502 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 105 transitions. Word has length 46 [2024-11-18 13:10:00,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 13:10:00,502 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 105 transitions. [2024-11-18 13:10:00,502 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 47 states have (on average 1.4680851063829787) internal successors, (69), 40 states have internal predecessors, (69), 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) [2024-11-18 13:10:00,502 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 105 transitions. [2024-11-18 13:10:00,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-11-18 13:10:00,503 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 13:10:00,503 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 13:10:00,518 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2024-11-18 13:10:00,704 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 13:10:00,704 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 13:10:00,704 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 13:10:00,704 INFO L85 PathProgramCache]: Analyzing trace with hash -397767570, now seen corresponding path program 2 times [2024-11-18 13:10:00,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 13:10:00,705 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2009808436] [2024-11-18 13:10:00,705 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-18 13:10:00,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 13:10:00,767 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-18 13:10:00,767 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-18 13:10:02,334 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 14 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 13:10:02,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 13:10:02,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2009808436] [2024-11-18 13:10:02,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2009808436] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 13:10:02,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1622897373] [2024-11-18 13:10:02,335 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-18 13:10:02,335 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 13:10:02,335 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 13:10:02,336 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-18 13:10:02,337 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-18 13:10:02,522 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-18 13:10:02,522 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-18 13:10:02,525 INFO L255 TraceCheckSpWp]: Trace formula consists of 426 conjuncts, 144 conjuncts are in the unsatisfiable core [2024-11-18 13:10:02,531 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 13:10:02,574 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 [2024-11-18 13:10:02,660 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 13 treesize of output 9 [2024-11-18 13:10:02,667 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 13 treesize of output 9 [2024-11-18 13:10:02,862 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-18 13:10:02,863 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 18 treesize of output 17 [2024-11-18 13:10:02,864 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-18 13:10:02,874 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-18 13:10:02,874 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 18 treesize of output 17 [2024-11-18 13:10:02,876 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-18 13:10:02,894 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-18 13:10:02,894 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-11-18 13:10:02,947 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2024-11-18 13:10:02,952 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 18 treesize of output 13 [2024-11-18 13:10:02,960 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 [2024-11-18 13:10:02,964 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 18 treesize of output 13 [2024-11-18 13:10:03,028 INFO L349 Elim1Store]: treesize reduction 53, result has 11.7 percent of original size [2024-11-18 13:10:03,028 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 124 treesize of output 93 [2024-11-18 13:10:03,039 INFO L349 Elim1Store]: treesize reduction 31, result has 26.2 percent of original size [2024-11-18 13:10:03,039 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 91 treesize of output 79 [2024-11-18 13:10:03,315 INFO L349 Elim1Store]: treesize reduction 50, result has 2.0 percent of original size [2024-11-18 13:10:03,316 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 121 treesize of output 48 [2024-11-18 13:10:03,320 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2024-11-18 13:10:03,322 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 [2024-11-18 13:10:03,448 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 [2024-11-18 13:10:03,525 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-18 13:10:03,534 INFO L349 Elim1Store]: treesize reduction 29, result has 14.7 percent of original size [2024-11-18 13:10:03,534 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 129 treesize of output 96 [2024-11-18 13:10:03,545 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2024-11-18 13:10:03,545 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 [2024-11-18 13:10:03,554 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 88 treesize of output 74 [2024-11-18 13:10:04,066 INFO L349 Elim1Store]: treesize reduction 88, result has 23.5 percent of original size [2024-11-18 13:10:04,066 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 98 treesize of output 90 [2024-11-18 13:10:04,130 INFO L349 Elim1Store]: treesize reduction 192, result has 34.7 percent of original size [2024-11-18 13:10:04,131 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 9 case distinctions, treesize of input 147 treesize of output 168 [2024-11-18 13:10:04,153 INFO L349 Elim1Store]: treesize reduction 53, result has 22.1 percent of original size [2024-11-18 13:10:04,154 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 193 treesize of output 162 [2024-11-18 13:10:04,184 INFO L349 Elim1Store]: treesize reduction 100, result has 19.4 percent of original size [2024-11-18 13:10:04,184 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 311 treesize of output 261 [2024-11-18 13:10:04,215 INFO L349 Elim1Store]: treesize reduction 50, result has 35.1 percent of original size [2024-11-18 13:10:04,215 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 84 treesize of output 117 [2024-11-18 13:10:04,224 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 34 [2024-11-18 13:10:04,234 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-18 13:10:04,247 WARN L214 Elim1Store]: Array PQE input equivalent to false [2024-11-18 13:10:04,262 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-18 13:10:04,265 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 51 treesize of output 20 [2024-11-18 13:10:04,286 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 82 treesize of output 58 [2024-11-18 13:10:04,294 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 11 [2024-11-18 13:10:04,477 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 309 treesize of output 217 [2024-11-18 13:10:05,436 INFO L349 Elim1Store]: treesize reduction 90, result has 87.5 percent of original size [2024-11-18 13:10:05,437 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 10 select indices, 10 select index equivalence classes, 1 disjoint index pairs (out of 45 index pairs), introduced 13 new quantified variables, introduced 45 case distinctions, treesize of input 336 treesize of output 787 [2024-11-18 13:10:05,789 INFO L349 Elim1Store]: treesize reduction 58, result has 82.4 percent of original size [2024-11-18 13:10:05,789 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 12 new quantified variables, introduced 28 case distinctions, treesize of input 760 treesize of output 812