./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/dll2n_append_equal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/dll2n_append_equal.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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-dev-84cfde4 [2024-10-11 01:42:49,643 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 01:42:49,710 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 01:42:49,715 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 01:42:49,718 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 01:42:49,742 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 01:42:49,743 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 01:42:49,744 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 01:42:49,744 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 01:42:49,747 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 01:42:49,747 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 01:42:49,747 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 01:42:49,748 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 01:42:49,748 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 01:42:49,748 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 01:42:49,748 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 01:42:49,749 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 01:42:49,749 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 01:42:49,750 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 01:42:49,750 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 01:42:49,751 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 01:42:49,752 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 01:42:49,752 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 01:42:49,752 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 01:42:49,753 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 01:42:49,753 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 01:42:49,753 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 01:42:49,753 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 01:42:49,753 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 01:42:49,753 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 01:42:49,754 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 01:42:49,754 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 01:42:49,754 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 01:42:49,755 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 01:42:49,755 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 01:42:49,755 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 01:42:49,755 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 01:42:49,756 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 01:42:49,756 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 01:42:49,756 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 01:42:49,756 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 01:42:49,757 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 01:42:49,757 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-clean/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-clean/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-10-11 01:42:49,984 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 01:42:50,012 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 01:42:50,015 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 01:42:50,016 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 01:42:50,016 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 01:42:50,018 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/dll2n_append_equal.i [2024-10-11 01:42:51,349 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 01:42:51,558 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 01:42:51,559 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/dll2n_append_equal.i [2024-10-11 01:42:51,576 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/66d221d35/471940cca3134352b03c1c604d7637a1/FLAG570be0bda [2024-10-11 01:42:51,905 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/66d221d35/471940cca3134352b03c1c604d7637a1 [2024-10-11 01:42:51,907 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 01:42:51,908 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 01:42:51,910 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 01:42:51,910 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 01:42:51,914 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 01:42:51,915 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 01:42:51" (1/1) ... [2024-10-11 01:42:51,916 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@58400095 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:42:51, skipping insertion in model container [2024-10-11 01:42:51,917 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 01:42:51" (1/1) ... [2024-10-11 01:42:51,954 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 01:42:52,193 WARN L248 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-10-11 01:42:52,198 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 01:42:52,205 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 01:42:52,242 WARN L248 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-10-11 01:42:52,243 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 01:42:52,265 INFO L204 MainTranslator]: Completed translation [2024-10-11 01:42:52,266 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:42:52 WrapperNode [2024-10-11 01:42:52,266 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 01:42:52,267 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 01:42:52,271 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 01:42:52,271 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 01:42:52,280 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:42:52" (1/1) ... [2024-10-11 01:42:52,292 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:42:52" (1/1) ... [2024-10-11 01:42:52,316 INFO L138 Inliner]: procedures = 127, calls = 37, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 124 [2024-10-11 01:42:52,316 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 01:42:52,319 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 01:42:52,319 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 01:42:52,320 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 01:42:52,328 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:42:52" (1/1) ... [2024-10-11 01:42:52,328 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:42:52" (1/1) ... [2024-10-11 01:42:52,333 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:42:52" (1/1) ... [2024-10-11 01:42:52,356 INFO L175 MemorySlicer]: Split 21 memory accesses to 3 slices as follows [2, 6, 13]. 62 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 1, 0]. The 9 writes are split as follows [0, 1, 8]. [2024-10-11 01:42:52,357 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:42:52" (1/1) ... [2024-10-11 01:42:52,358 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:42:52" (1/1) ... [2024-10-11 01:42:52,364 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:42:52" (1/1) ... [2024-10-11 01:42:52,366 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:42:52" (1/1) ... [2024-10-11 01:42:52,367 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:42:52" (1/1) ... [2024-10-11 01:42:52,368 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:42:52" (1/1) ... [2024-10-11 01:42:52,371 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 01:42:52,375 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 01:42:52,375 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 01:42:52,375 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 01:42:52,375 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:42:52" (1/1) ... [2024-10-11 01:42:52,385 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 01:42:52,392 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 01:42:52,405 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 01:42:52,406 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 01:42:52,440 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-11 01:42:52,441 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-11 01:42:52,441 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-10-11 01:42:52,441 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-11 01:42:52,441 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-11 01:42:52,441 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-10-11 01:42:52,442 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2024-10-11 01:42:52,442 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2024-10-11 01:42:52,442 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-11 01:42:52,442 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 01:42:52,442 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-11 01:42:52,442 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-11 01:42:52,443 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-11 01:42:52,443 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-10-11 01:42:52,443 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-11 01:42:52,443 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-11 01:42:52,443 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-10-11 01:42:52,443 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-11 01:42:52,443 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-10-11 01:42:52,443 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-10-11 01:42:52,443 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-10-11 01:42:52,444 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 01:42:52,444 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-11 01:42:52,444 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-11 01:42:52,444 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 01:42:52,444 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 01:42:52,560 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 01:42:52,561 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 01:42:52,777 INFO L? ?]: Removed 45 outVars from TransFormulas that were not future-live. [2024-10-11 01:42:52,777 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 01:42:52,806 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 01:42:52,810 INFO L314 CfgBuilder]: Removed 4 assume(true) statements. [2024-10-11 01:42:52,810 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 01:42:52 BoogieIcfgContainer [2024-10-11 01:42:52,810 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 01:42:52,812 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 01:42:52,812 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 01:42:52,815 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 01:42:52,815 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 01:42:51" (1/3) ... [2024-10-11 01:42:52,816 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27b9ce05 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 01:42:52, skipping insertion in model container [2024-10-11 01:42:52,816 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:42:52" (2/3) ... [2024-10-11 01:42:52,817 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27b9ce05 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 01:42:52, skipping insertion in model container [2024-10-11 01:42:52,817 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 01:42:52" (3/3) ... [2024-10-11 01:42:52,818 INFO L112 eAbstractionObserver]: Analyzing ICFG dll2n_append_equal.i [2024-10-11 01:42:52,832 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 01:42:52,832 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 01:42:52,887 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 01:42:52,892 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;@12d4c30a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 01:42:52,893 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 01:42:52,897 INFO L276 IsEmpty]: Start isEmpty. Operand has 27 states, 22 states have (on average 1.6363636363636365) internal successors, (36), 23 states have internal predecessors, (36), 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-10-11 01:42:52,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-10-11 01:42:52,902 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 01:42:52,903 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 01:42:52,903 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 01:42:52,908 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 01:42:52,908 INFO L85 PathProgramCache]: Analyzing trace with hash -1765087503, now seen corresponding path program 1 times [2024-10-11 01:42:52,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 01:42:52,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [547662514] [2024-10-11 01:42:52,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 01:42:52,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 01:42:53,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:42:53,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 01:42:53,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:42:53,137 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 01:42:53,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 01:42:53,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [547662514] [2024-10-11 01:42:53,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [547662514] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 01:42:53,140 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 01:42:53,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 01:42:53,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1175846894] [2024-10-11 01:42:53,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 01:42:53,145 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 01:42:53,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 01:42:53,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 01:42:53,164 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 01:42:53,166 INFO L87 Difference]: Start difference. First operand has 27 states, 22 states have (on average 1.6363636363636365) internal successors, (36), 23 states have internal predecessors, (36), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 01:42:53,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 01:42:53,215 INFO L93 Difference]: Finished difference Result 48 states and 70 transitions. [2024-10-11 01:42:53,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 01:42:53,217 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2024-10-11 01:42:53,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 01:42:53,223 INFO L225 Difference]: With dead ends: 48 [2024-10-11 01:42:53,223 INFO L226 Difference]: Without dead ends: 22 [2024-10-11 01:42:53,226 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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-10-11 01:42:53,230 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 0 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 01:42:53,230 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 49 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 01:42:53,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2024-10-11 01:42:53,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2024-10-11 01:42:53,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 18 states have internal predecessors, (24), 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-10-11 01:42:53,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 28 transitions. [2024-10-11 01:42:53,256 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 28 transitions. Word has length 13 [2024-10-11 01:42:53,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 01:42:53,256 INFO L471 AbstractCegarLoop]: Abstraction has 22 states and 28 transitions. [2024-10-11 01:42:53,257 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 01:42:53,257 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 28 transitions. [2024-10-11 01:42:53,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-10-11 01:42:53,258 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 01:42:53,258 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 01:42:53,258 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 01:42:53,258 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 01:42:53,259 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 01:42:53,259 INFO L85 PathProgramCache]: Analyzing trace with hash 851795797, now seen corresponding path program 1 times [2024-10-11 01:42:53,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 01:42:53,259 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192453072] [2024-10-11 01:42:53,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 01:42:53,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 01:42:53,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:42:53,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 01:42:53,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:42:53,421 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 01:42:53,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 01:42:53,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [192453072] [2024-10-11 01:42:53,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [192453072] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 01:42:53,423 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 01:42:53,423 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 01:42:53,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [656747183] [2024-10-11 01:42:53,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 01:42:53,424 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 01:42:53,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 01:42:53,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 01:42:53,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 01:42:53,426 INFO L87 Difference]: Start difference. First operand 22 states and 28 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 01:42:53,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 01:42:53,467 INFO L93 Difference]: Finished difference Result 43 states and 55 transitions. [2024-10-11 01:42:53,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 01:42:53,467 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2024-10-11 01:42:53,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 01:42:53,468 INFO L225 Difference]: With dead ends: 43 [2024-10-11 01:42:53,469 INFO L226 Difference]: Without dead ends: 27 [2024-10-11 01:42:53,469 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 01:42:53,470 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 4 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 01:42:53,471 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 56 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 01:42:53,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2024-10-11 01:42:53,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 23. [2024-10-11 01:42:53,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 19 states have internal predecessors, (25), 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-10-11 01:42:53,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 29 transitions. [2024-10-11 01:42:53,477 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 29 transitions. Word has length 13 [2024-10-11 01:42:53,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 01:42:53,478 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 29 transitions. [2024-10-11 01:42:53,478 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 01:42:53,478 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 29 transitions. [2024-10-11 01:42:53,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-10-11 01:42:53,479 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 01:42:53,479 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 01:42:53,479 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 01:42:53,479 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 01:42:53,480 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 01:42:53,480 INFO L85 PathProgramCache]: Analyzing trace with hash -853542195, now seen corresponding path program 1 times [2024-10-11 01:42:53,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 01:42:53,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [763241116] [2024-10-11 01:42:53,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 01:42:53,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 01:42:53,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:42:53,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 01:42:53,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:42:53,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-11 01:42:53,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:42:53,613 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-11 01:42:53,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 01:42:53,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [763241116] [2024-10-11 01:42:53,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [763241116] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 01:42:53,615 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 01:42:53,615 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 01:42:53,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [472819403] [2024-10-11 01:42:53,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 01:42:53,617 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 01:42:53,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 01:42:53,618 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 01:42:53,618 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 01:42:53,618 INFO L87 Difference]: Start difference. First operand 23 states and 29 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 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-10-11 01:42:53,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 01:42:53,665 INFO L93 Difference]: Finished difference Result 47 states and 61 transitions. [2024-10-11 01:42:53,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 01:42:53,666 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 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 21 [2024-10-11 01:42:53,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 01:42:53,667 INFO L225 Difference]: With dead ends: 47 [2024-10-11 01:42:53,667 INFO L226 Difference]: Without dead ends: 26 [2024-10-11 01:42:53,668 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 01:42:53,668 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 0 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 01:42:53,669 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 56 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 01:42:53,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2024-10-11 01:42:53,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2024-10-11 01:42:53,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 21 states have internal predecessors, (27), 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-10-11 01:42:53,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 33 transitions. [2024-10-11 01:42:53,676 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 33 transitions. Word has length 21 [2024-10-11 01:42:53,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 01:42:53,676 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 33 transitions. [2024-10-11 01:42:53,676 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 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-10-11 01:42:53,677 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 33 transitions. [2024-10-11 01:42:53,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-10-11 01:42:53,677 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 01:42:53,678 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 01:42:53,678 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 01:42:53,678 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 01:42:53,679 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 01:42:53,679 INFO L85 PathProgramCache]: Analyzing trace with hash -1864659445, now seen corresponding path program 1 times [2024-10-11 01:42:53,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 01:42:53,680 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [58213778] [2024-10-11 01:42:53,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 01:42:53,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 01:42:53,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:42:53,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 01:42:53,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:42:53,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-11 01:42:53,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:42:53,796 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-11 01:42:53,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 01:42:53,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [58213778] [2024-10-11 01:42:53,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [58213778] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 01:42:53,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [673355744] [2024-10-11 01:42:53,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 01:42:53,797 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 01:42:53,797 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 01:42:53,799 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 01:42:53,800 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 01:42:53,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:42:53,906 INFO L255 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 01:42:53,910 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 01:42:53,961 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 01:42:53,961 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 01:42:53,996 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-11 01:42:53,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [673355744] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 01:42:53,996 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 01:42:53,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 6 [2024-10-11 01:42:53,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1935009056] [2024-10-11 01:42:53,999 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 01:42:54,000 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 01:42:54,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 01:42:54,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 01:42:54,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-10-11 01:42:54,000 INFO L87 Difference]: Start difference. First operand 26 states and 33 transitions. Second operand has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 states have internal predecessors, (23), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-10-11 01:42:54,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 01:42:54,062 INFO L93 Difference]: Finished difference Result 44 states and 55 transitions. [2024-10-11 01:42:54,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 01:42:54,063 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 states have internal predecessors, (23), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 21 [2024-10-11 01:42:54,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 01:42:54,063 INFO L225 Difference]: With dead ends: 44 [2024-10-11 01:42:54,063 INFO L226 Difference]: Without dead ends: 28 [2024-10-11 01:42:54,064 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 41 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-10-11 01:42:54,065 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 4 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 01:42:54,066 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 55 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 01:42:54,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2024-10-11 01:42:54,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2024-10-11 01:42:54,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 23 states have internal predecessors, (29), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 01:42:54,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 35 transitions. [2024-10-11 01:42:54,073 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 35 transitions. Word has length 21 [2024-10-11 01:42:54,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 01:42:54,074 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 35 transitions. [2024-10-11 01:42:54,074 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 states have internal predecessors, (23), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-10-11 01:42:54,075 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 35 transitions. [2024-10-11 01:42:54,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-10-11 01:42:54,075 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 01:42:54,075 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 01:42:54,091 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-11 01:42:54,276 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 01:42:54,277 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 01:42:54,277 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 01:42:54,277 INFO L85 PathProgramCache]: Analyzing trace with hash 1775178627, now seen corresponding path program 1 times [2024-10-11 01:42:54,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 01:42:54,277 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [811657312] [2024-10-11 01:42:54,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 01:42:54,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 01:42:54,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:42:54,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 01:42:54,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:42:54,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 01:42:54,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:42:54,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 01:42:54,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:42:54,617 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-10-11 01:42:54,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 01:42:54,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [811657312] [2024-10-11 01:42:54,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [811657312] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 01:42:54,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1668785901] [2024-10-11 01:42:54,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 01:42:54,620 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 01:42:54,620 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 01:42:54,623 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 01:42:54,624 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-11 01:42:54,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:42:54,766 INFO L255 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-10-11 01:42:54,769 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 01:42:54,872 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-11 01:42:54,892 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-10-11 01:42:54,906 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-11 01:42:54,907 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 01:42:54,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1668785901] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 01:42:54,910 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 01:42:54,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [10] total 15 [2024-10-11 01:42:54,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652012973] [2024-10-11 01:42:54,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 01:42:54,911 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 01:42:54,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 01:42:54,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 01:42:54,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=180, Unknown=0, NotChecked=0, Total=210 [2024-10-11 01:42:54,911 INFO L87 Difference]: Start difference. First operand 28 states and 35 transitions. Second operand has 9 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 8 states have internal predecessors, (18), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 01:42:54,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 01:42:54,975 INFO L93 Difference]: Finished difference Result 41 states and 49 transitions. [2024-10-11 01:42:54,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 01:42:54,976 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 8 states have internal predecessors, (18), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 29 [2024-10-11 01:42:54,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 01:42:54,976 INFO L225 Difference]: With dead ends: 41 [2024-10-11 01:42:54,977 INFO L226 Difference]: Without dead ends: 38 [2024-10-11 01:42:54,978 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=206, Unknown=0, NotChecked=0, Total=240 [2024-10-11 01:42:54,978 INFO L432 NwaCegarLoop]: 19 mSDtfsCounter, 14 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 01:42:54,980 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 129 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 01:42:54,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2024-10-11 01:42:54,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 30. [2024-10-11 01:42:54,983 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-10-11 01:42:54,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 37 transitions. [2024-10-11 01:42:54,983 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 37 transitions. Word has length 29 [2024-10-11 01:42:54,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 01:42:54,983 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 37 transitions. [2024-10-11 01:42:54,984 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 8 states have internal predecessors, (18), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 01:42:54,984 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 37 transitions. [2024-10-11 01:42:54,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-10-11 01:42:54,986 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 01:42:54,986 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 01:42:54,998 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-11 01:42:55,186 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 01:42:55,187 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 01:42:55,188 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 01:42:55,188 INFO L85 PathProgramCache]: Analyzing trace with hash 1775180301, now seen corresponding path program 1 times [2024-10-11 01:42:55,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 01:42:55,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359461296] [2024-10-11 01:42:55,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 01:42:55,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 01:42:55,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:42:55,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 01:42:55,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:42:55,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 01:42:55,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:42:55,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 01:42:55,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:42:55,433 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-10-11 01:42:55,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 01:42:55,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [359461296] [2024-10-11 01:42:55,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [359461296] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 01:42:55,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [17057535] [2024-10-11 01:42:55,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 01:42:55,434 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 01:42:55,434 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 01:42:55,435 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 01:42:55,437 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-11 01:42:55,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:42:55,560 INFO L255 TraceCheckSpWp]: Trace formula consists of 359 conjuncts, 43 conjuncts are in the unsatisfiable core [2024-10-11 01:42:55,563 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 01:42:55,635 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-10-11 01:42:55,721 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-10-11 01:42:55,727 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-11 01:42:55,754 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-10-11 01:42:55,798 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-11 01:42:55,799 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 01:42:55,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [17057535] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 01:42:55,800 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 01:42:55,800 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [10] total 19 [2024-10-11 01:42:55,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1263551037] [2024-10-11 01:42:55,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 01:42:55,800 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-11 01:42:55,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 01:42:55,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-11 01:42:55,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=301, Unknown=0, NotChecked=0, Total=342 [2024-10-11 01:42:55,801 INFO L87 Difference]: Start difference. First operand 30 states and 37 transitions. Second operand has 11 states, 9 states have (on average 2.0) internal successors, (18), 10 states have internal predecessors, (18), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 01:42:55,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 01:42:55,965 INFO L93 Difference]: Finished difference Result 40 states and 47 transitions. [2024-10-11 01:42:55,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-11 01:42:55,966 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 2.0) internal successors, (18), 10 states have internal predecessors, (18), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 29 [2024-10-11 01:42:55,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 01:42:55,967 INFO L225 Difference]: With dead ends: 40 [2024-10-11 01:42:55,967 INFO L226 Difference]: Without dead ends: 38 [2024-10-11 01:42:55,967 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=63, Invalid=443, Unknown=0, NotChecked=0, Total=506 [2024-10-11 01:42:55,968 INFO L432 NwaCegarLoop]: 16 mSDtfsCounter, 21 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 01:42:55,968 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 112 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 01:42:55,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2024-10-11 01:42:55,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 31. [2024-10-11 01:42:55,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 26 states have internal predecessors, (32), 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-10-11 01:42:55,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 38 transitions. [2024-10-11 01:42:55,979 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 38 transitions. Word has length 29 [2024-10-11 01:42:55,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 01:42:55,979 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 38 transitions. [2024-10-11 01:42:55,979 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 2.0) internal successors, (18), 10 states have internal predecessors, (18), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 01:42:55,979 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 38 transitions. [2024-10-11 01:42:55,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-10-11 01:42:55,980 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 01:42:55,980 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 01:42:55,999 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-11 01:42:56,180 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 01:42:56,181 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 01:42:56,182 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 01:42:56,182 INFO L85 PathProgramCache]: Analyzing trace with hash 846285726, now seen corresponding path program 1 times [2024-10-11 01:42:56,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 01:42:56,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1868362017] [2024-10-11 01:42:56,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 01:42:56,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 01:42:56,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:42:56,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 01:42:56,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:42:56,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 01:42:56,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:42:56,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 01:42:56,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:42:56,409 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-11 01:42:56,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 01:42:56,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1868362017] [2024-10-11 01:42:56,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1868362017] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 01:42:56,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2015282993] [2024-10-11 01:42:56,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 01:42:56,411 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 01:42:56,411 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 01:42:56,412 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 01:42:56,413 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-11 01:42:56,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:42:56,551 INFO L255 TraceCheckSpWp]: Trace formula consists of 371 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-10-11 01:42:56,553 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 01:42:56,634 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-10-11 01:42:56,645 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 01:42:56,646 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 01:42:56,671 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-11 01:42:56,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2015282993] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 01:42:56,672 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 01:42:56,672 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 9] total 13 [2024-10-11 01:42:56,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [435935294] [2024-10-11 01:42:56,672 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 01:42:56,673 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-11 01:42:56,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 01:42:56,673 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-11 01:42:56,673 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2024-10-11 01:42:56,674 INFO L87 Difference]: Start difference. First operand 31 states and 38 transitions. Second operand has 13 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 11 states have internal predecessors, (29), 3 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2024-10-11 01:43:00,690 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-10-11 01:43:04,702 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-10-11 01:43:08,724 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-10-11 01:43:12,737 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-10-11 01:43:16,763 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-10-11 01:43:20,783 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-10-11 01:43:20,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 01:43:20,890 INFO L93 Difference]: Finished difference Result 55 states and 67 transitions. [2024-10-11 01:43:20,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-11 01:43:20,894 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 11 states have internal predecessors, (29), 3 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) Word has length 31 [2024-10-11 01:43:20,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 01:43:20,896 INFO L225 Difference]: With dead ends: 55 [2024-10-11 01:43:20,896 INFO L226 Difference]: Without dead ends: 31 [2024-10-11 01:43:20,897 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 62 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=54, Invalid=288, Unknown=0, NotChecked=0, Total=342 [2024-10-11 01:43:20,897 INFO L432 NwaCegarLoop]: 19 mSDtfsCounter, 17 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 1 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 24.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 24.1s IncrementalHoareTripleChecker+Time [2024-10-11 01:43:20,898 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 181 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 135 Invalid, 6 Unknown, 0 Unchecked, 24.1s Time] [2024-10-11 01:43:20,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2024-10-11 01:43:20,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2024-10-11 01:43:20,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 25 states have (on average 1.16) internal successors, (29), 25 states have internal predecessors, (29), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 01:43:20,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 35 transitions. [2024-10-11 01:43:20,903 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 35 transitions. Word has length 31 [2024-10-11 01:43:20,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 01:43:20,904 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 35 transitions. [2024-10-11 01:43:20,904 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 11 states have internal predecessors, (29), 3 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2024-10-11 01:43:20,904 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2024-10-11 01:43:20,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-10-11 01:43:20,904 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 01:43:20,904 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 01:43:20,919 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-11 01:43:21,106 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2024-10-11 01:43:21,106 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 01:43:21,106 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 01:43:21,106 INFO L85 PathProgramCache]: Analyzing trace with hash -2018592169, now seen corresponding path program 1 times [2024-10-11 01:43:21,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 01:43:21,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1551225103] [2024-10-11 01:43:21,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 01:43:21,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 01:43:21,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:43:21,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 01:43:21,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:43:21,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 01:43:21,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:43:21,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 01:43:21,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:43:21,300 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-10-11 01:43:21,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 01:43:21,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1551225103] [2024-10-11 01:43:21,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1551225103] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 01:43:21,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1094786992] [2024-10-11 01:43:21,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 01:43:21,301 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 01:43:21,301 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 01:43:21,302 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 01:43:21,303 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-11 01:43:21,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:43:21,438 INFO L255 TraceCheckSpWp]: Trace formula consists of 379 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-10-11 01:43:21,440 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 01:43:21,489 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-10-11 01:43:21,490 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-11 01:43:21,491 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 01:43:21,520 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-10-11 01:43:21,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1094786992] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 01:43:21,520 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 01:43:21,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 9] total 11 [2024-10-11 01:43:21,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [615985874] [2024-10-11 01:43:21,521 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 01:43:21,521 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-11 01:43:21,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 01:43:21,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-11 01:43:21,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2024-10-11 01:43:21,522 INFO L87 Difference]: Start difference. First operand 31 states and 35 transitions. Second operand has 11 states, 10 states have (on average 2.7) internal successors, (27), 9 states have internal predecessors, (27), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-11 01:43:25,529 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-10-11 01:43:29,535 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-10-11 01:43:33,547 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-10-11 01:43:37,556 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-10-11 01:43:41,585 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-10-11 01:43:45,600 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-10-11 01:43:45,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 01:43:45,688 INFO L93 Difference]: Finished difference Result 38 states and 42 transitions. [2024-10-11 01:43:45,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-11 01:43:45,689 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.7) internal successors, (27), 9 states have internal predecessors, (27), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 32 [2024-10-11 01:43:45,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 01:43:45,690 INFO L225 Difference]: With dead ends: 38 [2024-10-11 01:43:45,691 INFO L226 Difference]: Without dead ends: 35 [2024-10-11 01:43:45,691 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 66 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2024-10-11 01:43:45,691 INFO L432 NwaCegarLoop]: 17 mSDtfsCounter, 18 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 0 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 24.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 24.1s IncrementalHoareTripleChecker+Time [2024-10-11 01:43:45,692 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 138 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 134 Invalid, 6 Unknown, 0 Unchecked, 24.1s Time] [2024-10-11 01:43:45,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2024-10-11 01:43:45,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 32. [2024-10-11 01:43:45,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 26 states have (on average 1.1538461538461537) internal successors, (30), 26 states have internal predecessors, (30), 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-10-11 01:43:45,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2024-10-11 01:43:45,698 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 32 [2024-10-11 01:43:45,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 01:43:45,699 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2024-10-11 01:43:45,699 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.7) internal successors, (27), 9 states have internal predecessors, (27), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-11 01:43:45,699 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2024-10-11 01:43:45,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-10-11 01:43:45,699 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 01:43:45,701 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 01:43:45,728 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-10-11 01:43:45,901 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 01:43:45,902 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 01:43:45,902 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 01:43:45,902 INFO L85 PathProgramCache]: Analyzing trace with hash -2018590495, now seen corresponding path program 1 times [2024-10-11 01:43:45,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 01:43:45,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [229650130] [2024-10-11 01:43:45,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 01:43:45,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 01:43:45,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:43:46,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 01:43:46,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:43:46,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 01:43:46,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:43:46,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 01:43:46,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:43:47,002 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-11 01:43:47,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 01:43:47,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [229650130] [2024-10-11 01:43:47,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [229650130] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 01:43:47,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [400082706] [2024-10-11 01:43:47,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 01:43:47,003 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 01:43:47,003 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 01:43:47,004 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 01:43:47,005 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-10-11 01:43:47,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:43:47,185 INFO L255 TraceCheckSpWp]: Trace formula consists of 378 conjuncts, 100 conjuncts are in the unsatisfiable core [2024-10-11 01:43:47,190 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 01:43:47,223 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-10-11 01:43:47,445 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-10-11 01:43:47,445 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-10-11 01:43:47,503 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-10-11 01:43:47,554 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-10-11 01:43:47,769 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-10-11 01:43:47,773 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-10-11 01:43:47,930 INFO L349 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2024-10-11 01:43:47,931 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-10-11 01:43:47,939 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-10-11 01:43:48,161 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-10-11 01:43:48,175 INFO L349 Elim1Store]: treesize reduction 49, result has 2.0 percent of original size [2024-10-11 01:43:48,176 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-10-11 01:43:48,221 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-10-11 01:43:48,288 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 01:43:48,288 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 01:43:48,308 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1427 (Array Int Int)) (|ULTIMATE.start_dll_append_~last~0#1.base| Int) (v_ArrVal_1429 (Array Int Int))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#2| |ULTIMATE.start_dll_append_~last~0#1.base| v_ArrVal_1429) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1427) (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (not (= (let ((.cse0 (+ |c_ULTIMATE.start_dll_append_~last~0#1.offset| 4))) (store (select |c_#memory_int#2| |ULTIMATE.start_dll_append_~last~0#1.base|) .cse0 (select v_ArrVal_1429 .cse0))) v_ArrVal_1429)))) is different from false [2024-10-11 01:43:48,334 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1427 (Array Int Int)) (|ULTIMATE.start_dll_append_~last~0#1.base| Int) (v_ArrVal_1429 (Array Int Int))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#2| |ULTIMATE.start_dll_append_~last~0#1.base| v_ArrVal_1429) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1427) (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (not (= v_ArrVal_1429 (let ((.cse0 (+ (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 4))) (store (select |c_#memory_int#2| |ULTIMATE.start_dll_append_~last~0#1.base|) .cse0 (select v_ArrVal_1429 .cse0))))))) is different from false [2024-10-11 01:43:48,361 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1427 (Array Int Int)) (|ULTIMATE.start_dll_append_~last~0#1.base| Int) (v_ArrVal_1429 (Array Int Int))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#2| |ULTIMATE.start_dll_append_~last~0#1.base| v_ArrVal_1429) |c_ULTIMATE.start_dll_append_#t~ret7#1.base| v_ArrVal_1427) (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (not (= v_ArrVal_1429 (let ((.cse0 (+ (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 4))) (store (select |c_#memory_int#2| |ULTIMATE.start_dll_append_~last~0#1.base|) .cse0 (select v_ArrVal_1429 .cse0))))))) is different from false [2024-10-11 01:43:48,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [400082706] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 01:43:48,469 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 01:43:48,469 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 25] total 45 [2024-10-11 01:43:48,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [8021477] [2024-10-11 01:43:48,470 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 01:43:48,470 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2024-10-11 01:43:48,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 01:43:48,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2024-10-11 01:43:48,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=1926, Unknown=3, NotChecked=270, Total=2352 [2024-10-11 01:43:48,472 INFO L87 Difference]: Start difference. First operand 32 states and 36 transitions. Second operand has 45 states, 38 states have (on average 1.3157894736842106) internal successors, (50), 35 states have internal predecessors, (50), 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-10-11 01:43:49,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 01:43:49,310 INFO L93 Difference]: Finished difference Result 48 states and 55 transitions. [2024-10-11 01:43:49,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-10-11 01:43:49,311 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 38 states have (on average 1.3157894736842106) internal successors, (50), 35 states have internal predecessors, (50), 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 32 [2024-10-11 01:43:49,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 01:43:49,311 INFO L225 Difference]: With dead ends: 48 [2024-10-11 01:43:49,312 INFO L226 Difference]: Without dead ends: 46 [2024-10-11 01:43:49,312 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 920 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=284, Invalid=3385, Unknown=3, NotChecked=360, Total=4032 [2024-10-11 01:43:49,313 INFO L432 NwaCegarLoop]: 14 mSDtfsCounter, 35 mSDsluCounter, 263 mSDsCounter, 0 mSdLazyCounter, 734 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 277 SdHoareTripleChecker+Invalid, 739 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 734 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 01:43:49,313 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 277 Invalid, 739 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 734 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 01:43:49,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2024-10-11 01:43:49,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 38. [2024-10-11 01:43:49,317 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-10-11 01:43:49,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 43 transitions. [2024-10-11 01:43:49,318 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 43 transitions. Word has length 32 [2024-10-11 01:43:49,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 01:43:49,318 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 43 transitions. [2024-10-11 01:43:49,318 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 38 states have (on average 1.3157894736842106) internal successors, (50), 35 states have internal predecessors, (50), 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-10-11 01:43:49,318 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 43 transitions. [2024-10-11 01:43:49,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-10-11 01:43:49,319 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 01:43:49,319 INFO L215 NwaCegarLoop]: trace histogram [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-10-11 01:43:49,332 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-10-11 01:43:49,519 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2024-10-11 01:43:49,520 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 01:43:49,520 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 01:43:49,520 INFO L85 PathProgramCache]: Analyzing trace with hash 1459785074, now seen corresponding path program 1 times [2024-10-11 01:43:49,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 01:43:49,520 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [496164202] [2024-10-11 01:43:49,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 01:43:49,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 01:43:49,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:43:50,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 01:43:50,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:43:50,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 01:43:50,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:43:50,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 01:43:50,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:43:50,402 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 3 proven. 10 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 01:43:50,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 01:43:50,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [496164202] [2024-10-11 01:43:50,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [496164202] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 01:43:50,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [952350606] [2024-10-11 01:43:50,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 01:43:50,403 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 01:43:50,403 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 01:43:50,405 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 01:43:50,406 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-10-11 01:43:50,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:43:50,572 INFO L255 TraceCheckSpWp]: Trace formula consists of 390 conjuncts, 75 conjuncts are in the unsatisfiable core [2024-10-11 01:43:50,576 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 01:43:50,582 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-10-11 01:43:50,754 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-10-11 01:43:50,754 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-10-11 01:43:50,790 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-10-11 01:43:50,834 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-10-11 01:43:50,834 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-10-11 01:43:50,951 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-10-11 01:43:50,954 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-10-11 01:43:51,033 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 01:43:51,034 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-10-11 01:43:51,046 INFO L349 Elim1Store]: treesize reduction 8, result has 77.1 percent of original size [2024-10-11 01:43:51,046 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-10-11 01:43:51,234 INFO L349 Elim1Store]: treesize reduction 71, result has 19.3 percent of original size [2024-10-11 01:43:51,235 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-10-11 01:43:51,250 INFO L349 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2024-10-11 01:43:51,250 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-10-11 01:43:51,260 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-10-11 01:43:51,290 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-10-11 01:43:51,293 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-10-11 01:43:51,323 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-10-11 01:43:51,345 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 01:43:51,345 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 01:43:51,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [952350606] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 01:43:51,747 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 01:43:51,747 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 25] total 42 [2024-10-11 01:43:51,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1280268236] [2024-10-11 01:43:51,747 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 01:43:51,748 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2024-10-11 01:43:51,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 01:43:51,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2024-10-11 01:43:51,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=2209, Unknown=4, NotChecked=0, Total=2352 [2024-10-11 01:43:51,749 INFO L87 Difference]: Start difference. First operand 38 states and 43 transitions. Second operand has 42 states, 34 states have (on average 1.5294117647058822) internal successors, (52), 34 states have internal predecessors, (52), 5 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2024-10-11 01:43:52,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 01:43:52,846 INFO L93 Difference]: Finished difference Result 53 states and 61 transitions. [2024-10-11 01:43:52,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-10-11 01:43:52,846 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 34 states have (on average 1.5294117647058822) internal successors, (52), 34 states have internal predecessors, (52), 5 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 34 [2024-10-11 01:43:52,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 01:43:52,847 INFO L225 Difference]: With dead ends: 53 [2024-10-11 01:43:52,847 INFO L226 Difference]: Without dead ends: 44 [2024-10-11 01:43:52,848 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 683 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=337, Invalid=4489, Unknown=4, NotChecked=0, Total=4830 [2024-10-11 01:43:52,848 INFO L432 NwaCegarLoop]: 16 mSDtfsCounter, 36 mSDsluCounter, 336 mSDsCounter, 0 mSdLazyCounter, 811 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 352 SdHoareTripleChecker+Invalid, 820 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 811 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 01:43:52,849 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 352 Invalid, 820 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 811 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 01:43:52,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2024-10-11 01:43:52,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 36. [2024-10-11 01:43:52,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 30 states have (on average 1.1666666666666667) internal successors, (35), 30 states have internal predecessors, (35), 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-10-11 01:43:52,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 41 transitions. [2024-10-11 01:43:52,853 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 41 transitions. Word has length 34 [2024-10-11 01:43:52,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 01:43:52,853 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 41 transitions. [2024-10-11 01:43:52,854 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 34 states have (on average 1.5294117647058822) internal successors, (52), 34 states have internal predecessors, (52), 5 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2024-10-11 01:43:52,854 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 41 transitions. [2024-10-11 01:43:52,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-10-11 01:43:52,854 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 01:43:52,854 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 01:43:52,867 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-10-11 01:43:53,055 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 01:43:53,055 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 01:43:53,056 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 01:43:53,056 INFO L85 PathProgramCache]: Analyzing trace with hash 1013232572, now seen corresponding path program 1 times [2024-10-11 01:43:53,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 01:43:53,056 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1664945254] [2024-10-11 01:43:53,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 01:43:53,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 01:43:53,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:43:53,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 01:43:53,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:43:53,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 01:43:53,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:43:54,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 01:43:54,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:43:54,230 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-11 01:43:54,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 01:43:54,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1664945254] [2024-10-11 01:43:54,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1664945254] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 01:43:54,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [658675467] [2024-10-11 01:43:54,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 01:43:54,231 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 01:43:54,231 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 01:43:54,232 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 01:43:54,233 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-10-11 01:43:54,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:43:54,468 INFO L255 TraceCheckSpWp]: Trace formula consists of 387 conjuncts, 97 conjuncts are in the unsatisfiable core [2024-10-11 01:43:54,471 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 01:43:54,504 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-10-11 01:43:54,714 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-10-11 01:43:54,714 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-10-11 01:43:54,770 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-10-11 01:43:54,776 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-10-11 01:43:54,833 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-10-11 01:43:54,834 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-10-11 01:43:54,846 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-10-11 01:43:55,009 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-10-11 01:43:55,015 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-10-11 01:43:55,020 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-10-11 01:43:55,175 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2024-10-11 01:43:55,176 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-10-11 01:43:55,189 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 01:43:55,190 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-10-11 01:43:55,205 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2024-10-11 01:43:55,206 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-10-11 01:43:55,461 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-10-11 01:43:55,554 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-10-11 01:43:55,603 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-10-11 01:43:55,669 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 8 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 01:43:55,669 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 01:43:55,677 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1922 (Array Int Int)) (v_ArrVal_1924 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#2| |c_ULTIMATE.start_dll_append_~last~0#1.base| v_ArrVal_1922) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1924) (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) is different from false [2024-10-11 01:44:04,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [658675467] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 01:44:04,044 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 01:44:04,044 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 26] total 47 [2024-10-11 01:44:04,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1851831396] [2024-10-11 01:44:04,045 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 01:44:04,045 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2024-10-11 01:44:04,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 01:44:04,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2024-10-11 01:44:04,046 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=167, Invalid=2330, Unknown=57, NotChecked=98, Total=2652 [2024-10-11 01:44:04,046 INFO L87 Difference]: Start difference. First operand 36 states and 41 transitions. Second operand has 47 states, 40 states have (on average 1.35) internal successors, (54), 37 states have internal predecessors, (54), 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-10-11 01:44:05,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 01:44:05,172 INFO L93 Difference]: Finished difference Result 53 states and 61 transitions. [2024-10-11 01:44:05,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-10-11 01:44:05,173 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 40 states have (on average 1.35) internal successors, (54), 37 states have internal predecessors, (54), 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 34 [2024-10-11 01:44:05,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 01:44:05,174 INFO L225 Difference]: With dead ends: 53 [2024-10-11 01:44:05,174 INFO L226 Difference]: Without dead ends: 51 [2024-10-11 01:44:05,175 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1031 ImplicationChecksByTransitivity, 9.9s TimeCoverageRelationStatistics Valid=305, Invalid=3932, Unknown=57, NotChecked=128, Total=4422 [2024-10-11 01:44:05,175 INFO L432 NwaCegarLoop]: 14 mSDtfsCounter, 22 mSDsluCounter, 311 mSDsCounter, 0 mSdLazyCounter, 831 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 325 SdHoareTripleChecker+Invalid, 837 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 831 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-11 01:44:05,175 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 325 Invalid, 837 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 831 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-11 01:44:05,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2024-10-11 01:44:05,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 42. [2024-10-11 01:44:05,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 36 states have (on average 1.1666666666666667) internal successors, (42), 36 states have internal predecessors, (42), 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-10-11 01:44:05,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 48 transitions. [2024-10-11 01:44:05,181 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 48 transitions. Word has length 34 [2024-10-11 01:44:05,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 01:44:05,181 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 48 transitions. [2024-10-11 01:44:05,181 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 40 states have (on average 1.35) internal successors, (54), 37 states have internal predecessors, (54), 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-10-11 01:44:05,181 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 48 transitions. [2024-10-11 01:44:05,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-10-11 01:44:05,182 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 01:44:05,182 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-11 01:44:05,197 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-10-11 01:44:05,382 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-10-11 01:44:05,382 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 01:44:05,383 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 01:44:05,383 INFO L85 PathProgramCache]: Analyzing trace with hash -1241039849, now seen corresponding path program 1 times [2024-10-11 01:44:05,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 01:44:05,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147227635] [2024-10-11 01:44:05,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 01:44:05,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 01:44:05,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:44:06,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 01:44:06,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:44:06,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 01:44:06,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:44:07,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 01:44:07,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:44:07,279 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-11 01:44:07,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 01:44:07,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [147227635] [2024-10-11 01:44:07,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [147227635] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 01:44:07,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [753392307] [2024-10-11 01:44:07,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 01:44:07,279 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 01:44:07,280 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 01:44:07,281 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 01:44:07,282 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-10-11 01:44:07,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:44:07,614 INFO L255 TraceCheckSpWp]: Trace formula consists of 398 conjuncts, 151 conjuncts are in the unsatisfiable core [2024-10-11 01:44:07,618 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 01:44:07,656 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-10-11 01:44:07,756 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 18 treesize of output 7 [2024-10-11 01:44:11,924 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_14| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_14| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_14| |c_ULTIMATE.start_dll_create_#t~ret4#1.base|) 0) (= |c_#valid| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_14| |c_#valid|))) (store |v_#valid_BEFORE_CALL_14| .cse0 (select |c_#valid| .cse0)))))) (= |c_ULTIMATE.start_dll_create_#t~ret4#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (or (= (select (select |c_#memory_int#2| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 0) 1) (exists ((|v_#memory_int#2_BEFORE_CALL_6| (Array Int (Array Int Int)))) (let ((.cse1 (@diff |v_#memory_int#2_BEFORE_CALL_6| |c_#memory_int#2|))) (and (= (select (select |v_#memory_int#2_BEFORE_CALL_6| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 0) 1) (= (store |v_#memory_int#2_BEFORE_CALL_6| .cse1 (select |c_#memory_int#2| .cse1)) |c_#memory_int#2|) (= |c_ULTIMATE.start_dll_create_#t~ret4#1.base| .cse1)))))) is different from false [2024-10-11 01:44:11,927 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_14| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_14| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_14| |c_ULTIMATE.start_dll_create_#t~ret4#1.base|) 0) (= |c_#valid| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_14| |c_#valid|))) (store |v_#valid_BEFORE_CALL_14| .cse0 (select |c_#valid| .cse0)))))) (= |c_ULTIMATE.start_dll_create_#t~ret4#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (or (= (select (select |c_#memory_int#2| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 0) 1) (exists ((|v_#memory_int#2_BEFORE_CALL_6| (Array Int (Array Int Int)))) (let ((.cse1 (@diff |v_#memory_int#2_BEFORE_CALL_6| |c_#memory_int#2|))) (and (= (select (select |v_#memory_int#2_BEFORE_CALL_6| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 0) 1) (= (store |v_#memory_int#2_BEFORE_CALL_6| .cse1 (select |c_#memory_int#2| .cse1)) |c_#memory_int#2|) (= |c_ULTIMATE.start_dll_create_#t~ret4#1.base| .cse1)))))) is different from true [2024-10-11 01:44:11,966 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-10-11 01:44:11,988 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-10-11 01:44:11,988 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-10-11 01:44:11,995 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-10-11 01:44:12,003 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#2| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 0) 1) (exists ((|v_#memory_int#2_305| (Array Int (Array Int Int)))) (and (= (store |v_#memory_int#2_305| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (select |c_#memory_int#2| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) |c_#memory_int#2|) (exists ((|v_#memory_int#2_BEFORE_CALL_6| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_#memory_int#2_BEFORE_CALL_6| |v_#memory_int#2_305|))) (and (= (select (select |v_#memory_int#2_BEFORE_CALL_6| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 0) 1) (= |v_#memory_int#2_305| (store |v_#memory_int#2_BEFORE_CALL_6| .cse0 (select |v_#memory_int#2_305| .cse0))) (= .cse0 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))))))) (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#2.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) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4) |c_ULTIMATE.start_dll_create_~head~0#1.base|) (exists ((|v_#valid_BEFORE_CALL_14| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_14| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1) (= 0 (select |v_#valid_BEFORE_CALL_14| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (= |c_#valid| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_14| |c_#valid|))) (store |v_#valid_BEFORE_CALL_14| .cse1 (select |c_#valid| .cse1))))))) is different from false [2024-10-11 01:44:12,005 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#2| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 0) 1) (exists ((|v_#memory_int#2_305| (Array Int (Array Int Int)))) (and (= (store |v_#memory_int#2_305| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (select |c_#memory_int#2| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) |c_#memory_int#2|) (exists ((|v_#memory_int#2_BEFORE_CALL_6| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_#memory_int#2_BEFORE_CALL_6| |v_#memory_int#2_305|))) (and (= (select (select |v_#memory_int#2_BEFORE_CALL_6| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 0) 1) (= |v_#memory_int#2_305| (store |v_#memory_int#2_BEFORE_CALL_6| .cse0 (select |v_#memory_int#2_305| .cse0))) (= .cse0 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))))))) (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#2.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) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4) |c_ULTIMATE.start_dll_create_~head~0#1.base|) (exists ((|v_#valid_BEFORE_CALL_14| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_14| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1) (= 0 (select |v_#valid_BEFORE_CALL_14| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (= |c_#valid| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_14| |c_#valid|))) (store |v_#valid_BEFORE_CALL_14| .cse1 (select |c_#valid| .cse1))))))) is different from true [2024-10-11 01:44:12,037 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-10-11 01:44:12,038 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 125 treesize of output 110 [2024-10-11 01:44:12,050 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 47 treesize of output 23 [2024-10-11 01:44:12,068 INFO L349 Elim1Store]: treesize reduction 21, result has 38.2 percent of original size [2024-10-11 01:44:12,068 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-10-11 01:44:12,075 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4))) (let ((.cse1 (= .cse0 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))) (and (or (= (select (select |c_#memory_int#2| .cse0) 0) 1) .cse1) (exists ((|v_#valid_BEFORE_CALL_14| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_14| .cse0) 1) (= 0 (select |v_#valid_BEFORE_CALL_14| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (= |c_#valid| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_14| |c_#valid|))) (store |v_#valid_BEFORE_CALL_14| .cse2 (select |c_#valid| .cse2)))))) (= |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) (or (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4) 0) .cse1)))) is different from false [2024-10-11 01:44:12,076 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4))) (let ((.cse1 (= .cse0 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))) (and (or (= (select (select |c_#memory_int#2| .cse0) 0) 1) .cse1) (exists ((|v_#valid_BEFORE_CALL_14| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_14| .cse0) 1) (= 0 (select |v_#valid_BEFORE_CALL_14| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (= |c_#valid| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_14| |c_#valid|))) (store |v_#valid_BEFORE_CALL_14| .cse2 (select |c_#valid| .cse2)))))) (= |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) (or (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4) 0) .cse1)))) is different from true [2024-10-11 01:44:12,098 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4))) (let ((.cse1 (= .cse0 |c_ULTIMATE.start_dll_create_~head~0#1.base|))) (and (or (= (select (select |c_#memory_int#2| .cse0) 0) 1) .cse1) (or (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4) 0) .cse1) (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1) (exists ((|v_#valid_BEFORE_CALL_14| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_14| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_14| .cse0) 1) (= |c_#valid| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_14| |c_#valid|))) (store |v_#valid_BEFORE_CALL_14| .cse2 (select |c_#valid| .cse2))))))))) is different from false [2024-10-11 01:44:12,100 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4))) (let ((.cse1 (= .cse0 |c_ULTIMATE.start_dll_create_~head~0#1.base|))) (and (or (= (select (select |c_#memory_int#2| .cse0) 0) 1) .cse1) (or (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4) 0) .cse1) (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1) (exists ((|v_#valid_BEFORE_CALL_14| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_14| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_14| .cse0) 1) (= |c_#valid| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_14| |c_#valid|))) (store |v_#valid_BEFORE_CALL_14| .cse2 (select |c_#valid| .cse2))))))))) is different from true [2024-10-11 01:44:12,149 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| .cse0) 4))) (let ((.cse1 (= .cse2 .cse0))) (and (= |c_ULTIMATE.start_dll_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |c_#valid| .cse0) 1) (or .cse1 (= (select (select |c_#memory_int#2| .cse2) 0) 1)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (or .cse1 (= (select (select |c_#memory_$Pointer$#2.offset| .cse0) 4) 0)) (exists ((|v_#valid_BEFORE_CALL_14| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_14| .cse0) 0) (= (select |v_#valid_BEFORE_CALL_14| .cse2) 1) (= |c_#valid| (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_14| |c_#valid|))) (store |v_#valid_BEFORE_CALL_14| .cse3 (select |c_#valid| .cse3)))))) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |c_ULTIMATE.start_dll_append_~head#1.offset| 0))))) is different from false [2024-10-11 01:44:12,151 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| .cse0) 4))) (let ((.cse1 (= .cse2 .cse0))) (and (= |c_ULTIMATE.start_dll_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |c_#valid| .cse0) 1) (or .cse1 (= (select (select |c_#memory_int#2| .cse2) 0) 1)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (or .cse1 (= (select (select |c_#memory_$Pointer$#2.offset| .cse0) 4) 0)) (exists ((|v_#valid_BEFORE_CALL_14| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_14| .cse0) 0) (= (select |v_#valid_BEFORE_CALL_14| .cse2) 1) (= |c_#valid| (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_14| |c_#valid|))) (store |v_#valid_BEFORE_CALL_14| .cse3 (select |c_#valid| .cse3)))))) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |c_ULTIMATE.start_dll_append_~head#1.offset| 0))))) is different from true [2024-10-11 01:44:12,166 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 72 treesize of output 40 [2024-10-11 01:44:12,172 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2024-10-11 01:44:12,176 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-10-11 01:44:12,195 WARN L851 $PredicateComparison]: unable to prove that (and (= |c_#valid| |c_old(#valid)|) (= |c_#memory_$Pointer$#2.offset| |c_old(#memory_$Pointer$#2.offset)|) (exists ((|v_#valid_BEFORE_CALL_14| (Array Int Int)) (v_arrayElimCell_58 Int) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7| Int) (|v_#valid_BEFORE_CALL_15| (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0) 0) (= (select |v_#valid_BEFORE_CALL_15| .cse0) 1) (= (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_14| |v_#valid_BEFORE_CALL_15|))) (store |v_#valid_BEFORE_CALL_14| .cse1 (select |v_#valid_BEFORE_CALL_15| .cse1))) |v_#valid_BEFORE_CALL_15|) (= (select |v_#valid_BEFORE_CALL_14| .cse0) 0) (= (select |v_#valid_BEFORE_CALL_14| v_arrayElimCell_58) 1)))) (= |c_old(#memory_int#2)| |c_#memory_int#2|) (= |c_old(#memory_$Pointer$#2.base)| |c_#memory_$Pointer$#2.base|)) is different from false [2024-10-11 01:44:12,196 WARN L873 $PredicateComparison]: unable to prove that (and (= |c_#valid| |c_old(#valid)|) (= |c_#memory_$Pointer$#2.offset| |c_old(#memory_$Pointer$#2.offset)|) (exists ((|v_#valid_BEFORE_CALL_14| (Array Int Int)) (v_arrayElimCell_58 Int) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7| Int) (|v_#valid_BEFORE_CALL_15| (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0) 0) (= (select |v_#valid_BEFORE_CALL_15| .cse0) 1) (= (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_14| |v_#valid_BEFORE_CALL_15|))) (store |v_#valid_BEFORE_CALL_14| .cse1 (select |v_#valid_BEFORE_CALL_15| .cse1))) |v_#valid_BEFORE_CALL_15|) (= (select |v_#valid_BEFORE_CALL_14| .cse0) 0) (= (select |v_#valid_BEFORE_CALL_14| v_arrayElimCell_58) 1)))) (= |c_old(#memory_int#2)| |c_#memory_int#2|) (= |c_old(#memory_$Pointer$#2.base)| |c_#memory_$Pointer$#2.base|)) is different from true [2024-10-11 01:44:12,217 WARN L851 $PredicateComparison]: unable to prove that (and (= |c_node_create_~temp~0#1.offset| 0) (= |c_#memory_$Pointer$#2.offset| |c_old(#memory_$Pointer$#2.offset)|) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (exists ((|v_#valid_BEFORE_CALL_14| (Array Int Int)) (v_arrayElimCell_58 Int) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7| Int) (|v_#valid_BEFORE_CALL_15| (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0) 0) (= (select |v_#valid_BEFORE_CALL_15| .cse0) 1) (= (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_14| |v_#valid_BEFORE_CALL_15|))) (store |v_#valid_BEFORE_CALL_14| .cse1 (select |v_#valid_BEFORE_CALL_15| .cse1))) |v_#valid_BEFORE_CALL_15|) (= (select |v_#valid_BEFORE_CALL_14| .cse0) 0) (= (select |v_#valid_BEFORE_CALL_14| v_arrayElimCell_58) 1)))) (= |c_old(#memory_int#2)| |c_#memory_int#2|) (= |c_old(#memory_$Pointer$#2.base)| |c_#memory_$Pointer$#2.base|)) is different from false [2024-10-11 01:44:12,219 WARN L873 $PredicateComparison]: unable to prove that (and (= |c_node_create_~temp~0#1.offset| 0) (= |c_#memory_$Pointer$#2.offset| |c_old(#memory_$Pointer$#2.offset)|) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (exists ((|v_#valid_BEFORE_CALL_14| (Array Int Int)) (v_arrayElimCell_58 Int) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7| Int) (|v_#valid_BEFORE_CALL_15| (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0) 0) (= (select |v_#valid_BEFORE_CALL_15| .cse0) 1) (= (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_14| |v_#valid_BEFORE_CALL_15|))) (store |v_#valid_BEFORE_CALL_14| .cse1 (select |v_#valid_BEFORE_CALL_15| .cse1))) |v_#valid_BEFORE_CALL_15|) (= (select |v_#valid_BEFORE_CALL_14| .cse0) 0) (= (select |v_#valid_BEFORE_CALL_14| v_arrayElimCell_58) 1)))) (= |c_old(#memory_int#2)| |c_#memory_int#2|) (= |c_old(#memory_$Pointer$#2.base)| |c_#memory_$Pointer$#2.base|)) is different from true [2024-10-11 01:44:12,242 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) (= (store |c_old(#memory_$Pointer$#2.offset)| |c_node_create_#res#1.base| (select |c_#memory_$Pointer$#2.offset| |c_node_create_#res#1.base|)) |c_#memory_$Pointer$#2.offset|) (= (store |c_old(#memory_$Pointer$#2.base)| |c_node_create_#res#1.base| (select |c_#memory_$Pointer$#2.base| |c_node_create_#res#1.base|)) |c_#memory_$Pointer$#2.base|) (= (store |c_old(#memory_int#2)| |c_node_create_#res#1.base| (select |c_#memory_int#2| |c_node_create_#res#1.base|)) |c_#memory_int#2|) (exists ((|v_#valid_BEFORE_CALL_14| (Array Int Int)) (v_arrayElimCell_58 Int) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7| Int) (|v_#valid_BEFORE_CALL_15| (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0) 0) (= (select |v_#valid_BEFORE_CALL_15| .cse0) 1) (= (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_14| |v_#valid_BEFORE_CALL_15|))) (store |v_#valid_BEFORE_CALL_14| .cse1 (select |v_#valid_BEFORE_CALL_15| .cse1))) |v_#valid_BEFORE_CALL_15|) (= (select |v_#valid_BEFORE_CALL_14| .cse0) 0) (= (select |v_#valid_BEFORE_CALL_14| v_arrayElimCell_58) 1))))) is different from false [2024-10-11 01:44:12,244 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) (= (store |c_old(#memory_$Pointer$#2.offset)| |c_node_create_#res#1.base| (select |c_#memory_$Pointer$#2.offset| |c_node_create_#res#1.base|)) |c_#memory_$Pointer$#2.offset|) (= (store |c_old(#memory_$Pointer$#2.base)| |c_node_create_#res#1.base| (select |c_#memory_$Pointer$#2.base| |c_node_create_#res#1.base|)) |c_#memory_$Pointer$#2.base|) (= (store |c_old(#memory_int#2)| |c_node_create_#res#1.base| (select |c_#memory_int#2| |c_node_create_#res#1.base|)) |c_#memory_int#2|) (exists ((|v_#valid_BEFORE_CALL_14| (Array Int Int)) (v_arrayElimCell_58 Int) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7| Int) (|v_#valid_BEFORE_CALL_15| (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0) 0) (= (select |v_#valid_BEFORE_CALL_15| .cse0) 1) (= (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_14| |v_#valid_BEFORE_CALL_15|))) (store |v_#valid_BEFORE_CALL_14| .cse1 (select |v_#valid_BEFORE_CALL_15| .cse1))) |v_#valid_BEFORE_CALL_15|) (= (select |v_#valid_BEFORE_CALL_14| .cse0) 0) (= (select |v_#valid_BEFORE_CALL_14| v_arrayElimCell_58) 1))))) is different from true [2024-10-11 01:44:12,268 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 01:44:12,269 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 80 treesize of output 57 [2024-10-11 01:44:12,293 INFO L349 Elim1Store]: treesize reduction 29, result has 46.3 percent of original size [2024-10-11 01:44:12,294 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 40 treesize of output 47 [2024-10-11 01:44:12,313 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2024-10-11 01:44:12,314 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 39 [2024-10-11 01:44:12,353 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| .cse0) 4))) (let ((.cse1 (= .cse2 .cse0))) (and (= |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) (= |c_ULTIMATE.start_dll_append_#t~ret7#1.offset| 0) (or (= |c_ULTIMATE.start_dll_append_#t~ret7#1.base| .cse0) .cse1 (= (select (select |c_#memory_$Pointer$#2.offset| .cse0) 4) 0)) (exists ((|v_#valid_BEFORE_CALL_16| (Array Int Int)) (|v_#valid_BEFORE_CALL_17| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_16| |c_ULTIMATE.start_dll_append_#t~ret7#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_17| .cse0) 0) (= (select |v_#valid_BEFORE_CALL_17| .cse2) 1) (= (select |v_#valid_BEFORE_CALL_16| .cse0) 1) (= |v_#valid_BEFORE_CALL_16| (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_17| |v_#valid_BEFORE_CALL_16|))) (store |v_#valid_BEFORE_CALL_17| .cse3 (select |v_#valid_BEFORE_CALL_16| .cse3)))))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (or .cse1 (= |c_ULTIMATE.start_dll_append_#t~ret7#1.base| .cse2) (= (select (select |c_#memory_int#2| .cse2) 0) 1)) (exists ((|v_#valid_BEFORE_CALL_14| (Array Int Int)) (v_arrayElimCell_58 Int) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7| Int) (|v_#valid_BEFORE_CALL_15| (Array Int Int))) (let ((.cse4 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0) 0) (= (select |v_#valid_BEFORE_CALL_15| .cse4) 1) (= (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_14| |v_#valid_BEFORE_CALL_15|))) (store |v_#valid_BEFORE_CALL_14| .cse5 (select |v_#valid_BEFORE_CALL_15| .cse5))) |v_#valid_BEFORE_CALL_15|) (= (select |v_#valid_BEFORE_CALL_14| .cse4) 0) (= (select |v_#valid_BEFORE_CALL_14| v_arrayElimCell_58) 1)))) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |c_ULTIMATE.start_dll_append_~head#1.offset| 0))))) is different from false [2024-10-11 01:44:12,356 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| .cse0) 4))) (let ((.cse1 (= .cse2 .cse0))) (and (= |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) (= |c_ULTIMATE.start_dll_append_#t~ret7#1.offset| 0) (or (= |c_ULTIMATE.start_dll_append_#t~ret7#1.base| .cse0) .cse1 (= (select (select |c_#memory_$Pointer$#2.offset| .cse0) 4) 0)) (exists ((|v_#valid_BEFORE_CALL_16| (Array Int Int)) (|v_#valid_BEFORE_CALL_17| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_16| |c_ULTIMATE.start_dll_append_#t~ret7#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_17| .cse0) 0) (= (select |v_#valid_BEFORE_CALL_17| .cse2) 1) (= (select |v_#valid_BEFORE_CALL_16| .cse0) 1) (= |v_#valid_BEFORE_CALL_16| (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_17| |v_#valid_BEFORE_CALL_16|))) (store |v_#valid_BEFORE_CALL_17| .cse3 (select |v_#valid_BEFORE_CALL_16| .cse3)))))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (or .cse1 (= |c_ULTIMATE.start_dll_append_#t~ret7#1.base| .cse2) (= (select (select |c_#memory_int#2| .cse2) 0) 1)) (exists ((|v_#valid_BEFORE_CALL_14| (Array Int Int)) (v_arrayElimCell_58 Int) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7| Int) (|v_#valid_BEFORE_CALL_15| (Array Int Int))) (let ((.cse4 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0) 0) (= (select |v_#valid_BEFORE_CALL_15| .cse4) 1) (= (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_14| |v_#valid_BEFORE_CALL_15|))) (store |v_#valid_BEFORE_CALL_14| .cse5 (select |v_#valid_BEFORE_CALL_15| .cse5))) |v_#valid_BEFORE_CALL_15|) (= (select |v_#valid_BEFORE_CALL_14| .cse4) 0) (= (select |v_#valid_BEFORE_CALL_14| v_arrayElimCell_58) 1)))) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |c_ULTIMATE.start_dll_append_~head#1.offset| 0))))) is different from true [2024-10-11 01:44:12,434 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| .cse2) 4))) (let ((.cse0 (= .cse1 .cse2))) (and (= |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) (or .cse0 (= .cse1 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) (= (select (select |c_#memory_int#2| .cse1) 0) 1)) (exists ((|v_#valid_BEFORE_CALL_16| (Array Int Int)) (|v_#valid_BEFORE_CALL_17| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_17| .cse2) 0) (= (select |v_#valid_BEFORE_CALL_17| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_16| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_16| .cse2) 1) (= |v_#valid_BEFORE_CALL_16| (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_17| |v_#valid_BEFORE_CALL_16|))) (store |v_#valid_BEFORE_CALL_17| .cse3 (select |v_#valid_BEFORE_CALL_16| .cse3)))))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_#valid_BEFORE_CALL_14| (Array Int Int)) (v_arrayElimCell_58 Int) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7| Int) (|v_#valid_BEFORE_CALL_15| (Array Int Int))) (let ((.cse4 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0) 0) (= (select |v_#valid_BEFORE_CALL_15| .cse4) 1) (= (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_14| |v_#valid_BEFORE_CALL_15|))) (store |v_#valid_BEFORE_CALL_14| .cse5 (select |v_#valid_BEFORE_CALL_15| .cse5))) |v_#valid_BEFORE_CALL_15|) (= (select |v_#valid_BEFORE_CALL_14| .cse4) 0) (= (select |v_#valid_BEFORE_CALL_14| v_arrayElimCell_58) 1)))) (or .cse0 (= (select (select |c_#memory_$Pointer$#2.offset| .cse2) 4) 0) (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| .cse2)) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |c_ULTIMATE.start_dll_append_~head#1.offset| 0))))) is different from false [2024-10-11 01:44:12,437 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| .cse2) 4))) (let ((.cse0 (= .cse1 .cse2))) (and (= |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) (or .cse0 (= .cse1 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) (= (select (select |c_#memory_int#2| .cse1) 0) 1)) (exists ((|v_#valid_BEFORE_CALL_16| (Array Int Int)) (|v_#valid_BEFORE_CALL_17| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_17| .cse2) 0) (= (select |v_#valid_BEFORE_CALL_17| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_16| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_16| .cse2) 1) (= |v_#valid_BEFORE_CALL_16| (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_17| |v_#valid_BEFORE_CALL_16|))) (store |v_#valid_BEFORE_CALL_17| .cse3 (select |v_#valid_BEFORE_CALL_16| .cse3)))))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_#valid_BEFORE_CALL_14| (Array Int Int)) (v_arrayElimCell_58 Int) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7| Int) (|v_#valid_BEFORE_CALL_15| (Array Int Int))) (let ((.cse4 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0) 0) (= (select |v_#valid_BEFORE_CALL_15| .cse4) 1) (= (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_14| |v_#valid_BEFORE_CALL_15|))) (store |v_#valid_BEFORE_CALL_14| .cse5 (select |v_#valid_BEFORE_CALL_15| .cse5))) |v_#valid_BEFORE_CALL_15|) (= (select |v_#valid_BEFORE_CALL_14| .cse4) 0) (= (select |v_#valid_BEFORE_CALL_14| v_arrayElimCell_58) 1)))) (or .cse0 (= (select (select |c_#memory_$Pointer$#2.offset| .cse2) 4) 0) (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| .cse2)) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |c_ULTIMATE.start_dll_append_~head#1.offset| 0))))) is different from true [2024-10-11 01:44:12,494 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| .cse2) 4))) (let ((.cse0 (= .cse1 .cse2))) (and (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (or .cse0 (= .cse1 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) (= (select (select |c_#memory_int#2| .cse1) 0) 1)) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse2) (exists ((|v_#valid_BEFORE_CALL_16| (Array Int Int)) (|v_#valid_BEFORE_CALL_17| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_17| .cse2) 0) (= (select |v_#valid_BEFORE_CALL_17| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_16| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_16| .cse2) 1) (= |v_#valid_BEFORE_CALL_16| (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_17| |v_#valid_BEFORE_CALL_16|))) (store |v_#valid_BEFORE_CALL_17| .cse3 (select |v_#valid_BEFORE_CALL_16| .cse3)))))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_dll_append_~last~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_14| (Array Int Int)) (v_arrayElimCell_58 Int) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7| Int) (|v_#valid_BEFORE_CALL_15| (Array Int Int))) (let ((.cse4 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0) 0) (= (select |v_#valid_BEFORE_CALL_15| .cse4) 1) (= (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_14| |v_#valid_BEFORE_CALL_15|))) (store |v_#valid_BEFORE_CALL_14| .cse5 (select |v_#valid_BEFORE_CALL_15| .cse5))) |v_#valid_BEFORE_CALL_15|) (= (select |v_#valid_BEFORE_CALL_14| .cse4) 0) (= (select |v_#valid_BEFORE_CALL_14| v_arrayElimCell_58) 1)))) (or .cse0 (= (select (select |c_#memory_$Pointer$#2.offset| .cse2) 4) 0) (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| .cse2)) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0))))) is different from false [2024-10-11 01:44:12,497 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| .cse2) 4))) (let ((.cse0 (= .cse1 .cse2))) (and (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (or .cse0 (= .cse1 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) (= (select (select |c_#memory_int#2| .cse1) 0) 1)) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse2) (exists ((|v_#valid_BEFORE_CALL_16| (Array Int Int)) (|v_#valid_BEFORE_CALL_17| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_17| .cse2) 0) (= (select |v_#valid_BEFORE_CALL_17| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_16| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_16| .cse2) 1) (= |v_#valid_BEFORE_CALL_16| (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_17| |v_#valid_BEFORE_CALL_16|))) (store |v_#valid_BEFORE_CALL_17| .cse3 (select |v_#valid_BEFORE_CALL_16| .cse3)))))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_dll_append_~last~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_14| (Array Int Int)) (v_arrayElimCell_58 Int) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7| Int) (|v_#valid_BEFORE_CALL_15| (Array Int Int))) (let ((.cse4 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0) 0) (= (select |v_#valid_BEFORE_CALL_15| .cse4) 1) (= (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_14| |v_#valid_BEFORE_CALL_15|))) (store |v_#valid_BEFORE_CALL_14| .cse5 (select |v_#valid_BEFORE_CALL_15| .cse5))) |v_#valid_BEFORE_CALL_15|) (= (select |v_#valid_BEFORE_CALL_14| .cse4) 0) (= (select |v_#valid_BEFORE_CALL_14| v_arrayElimCell_58) 1)))) (or .cse0 (= (select (select |c_#memory_$Pointer$#2.offset| .cse2) 4) 0) (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| .cse2)) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0))))) is different from true [2024-10-11 01:44:12,623 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| .cse2) 4))) (let ((.cse0 (= .cse1 .cse2)) (.cse6 (select (select |c_#memory_$Pointer$#2.offset| .cse2) 4))) (and (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (or .cse0 (= .cse1 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) (= (select (select |c_#memory_int#2| .cse1) 0) 1)) (exists ((|v_#valid_BEFORE_CALL_16| (Array Int Int)) (|v_#valid_BEFORE_CALL_17| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_17| .cse2) 0) (= (select |v_#valid_BEFORE_CALL_17| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_16| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_16| .cse2) 1) (= |v_#valid_BEFORE_CALL_16| (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_17| |v_#valid_BEFORE_CALL_16|))) (store |v_#valid_BEFORE_CALL_17| .cse3 (select |v_#valid_BEFORE_CALL_16| .cse3)))))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_#valid_BEFORE_CALL_14| (Array Int Int)) (v_arrayElimCell_58 Int) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7| Int) (|v_#valid_BEFORE_CALL_15| (Array Int Int))) (let ((.cse4 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0) 0) (= (select |v_#valid_BEFORE_CALL_15| .cse4) 1) (= (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_14| |v_#valid_BEFORE_CALL_15|))) (store |v_#valid_BEFORE_CALL_14| .cse5 (select |v_#valid_BEFORE_CALL_15| .cse5))) |v_#valid_BEFORE_CALL_15|) (= (select |v_#valid_BEFORE_CALL_14| .cse4) 0) (= (select |v_#valid_BEFORE_CALL_14| v_arrayElimCell_58) 1)))) (= .cse6 |c_ULTIMATE.start_dll_append_~last~0#1.offset|) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse1) (or .cse0 (= .cse6 0) (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| .cse2)) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0))))) is different from false [2024-10-11 01:44:12,625 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| .cse2) 4))) (let ((.cse0 (= .cse1 .cse2)) (.cse6 (select (select |c_#memory_$Pointer$#2.offset| .cse2) 4))) (and (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (or .cse0 (= .cse1 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) (= (select (select |c_#memory_int#2| .cse1) 0) 1)) (exists ((|v_#valid_BEFORE_CALL_16| (Array Int Int)) (|v_#valid_BEFORE_CALL_17| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_17| .cse2) 0) (= (select |v_#valid_BEFORE_CALL_17| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_16| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_16| .cse2) 1) (= |v_#valid_BEFORE_CALL_16| (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_17| |v_#valid_BEFORE_CALL_16|))) (store |v_#valid_BEFORE_CALL_17| .cse3 (select |v_#valid_BEFORE_CALL_16| .cse3)))))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_#valid_BEFORE_CALL_14| (Array Int Int)) (v_arrayElimCell_58 Int) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7| Int) (|v_#valid_BEFORE_CALL_15| (Array Int Int))) (let ((.cse4 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0) 0) (= (select |v_#valid_BEFORE_CALL_15| .cse4) 1) (= (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_14| |v_#valid_BEFORE_CALL_15|))) (store |v_#valid_BEFORE_CALL_14| .cse5 (select |v_#valid_BEFORE_CALL_15| .cse5))) |v_#valid_BEFORE_CALL_15|) (= (select |v_#valid_BEFORE_CALL_14| .cse4) 0) (= (select |v_#valid_BEFORE_CALL_14| v_arrayElimCell_58) 1)))) (= .cse6 |c_ULTIMATE.start_dll_append_~last~0#1.offset|) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse1) (or .cse0 (= .cse6 0) (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| .cse2)) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0))))) is different from true [2024-10-11 01:44:12,701 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| .cse2) 4))) (let ((.cse0 (= .cse1 .cse2)) (.cse6 (select (select |c_#memory_$Pointer$#2.offset| .cse2) 4))) (and (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (or .cse0 (= .cse1 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) (= (select (select |c_#memory_int#2| .cse1) 0) 1)) (exists ((|v_#valid_BEFORE_CALL_16| (Array Int Int)) (|v_#valid_BEFORE_CALL_17| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_17| .cse2) 0) (= (select |v_#valid_BEFORE_CALL_17| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_16| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_16| .cse2) 1) (= |v_#valid_BEFORE_CALL_16| (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_17| |v_#valid_BEFORE_CALL_16|))) (store |v_#valid_BEFORE_CALL_17| .cse3 (select |v_#valid_BEFORE_CALL_16| .cse3)))))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_#valid_BEFORE_CALL_14| (Array Int Int)) (v_arrayElimCell_58 Int) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7| Int) (|v_#valid_BEFORE_CALL_15| (Array Int Int))) (let ((.cse4 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0) 0) (= (select |v_#valid_BEFORE_CALL_15| .cse4) 1) (= (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_14| |v_#valid_BEFORE_CALL_15|))) (store |v_#valid_BEFORE_CALL_14| .cse5 (select |v_#valid_BEFORE_CALL_15| .cse5))) |v_#valid_BEFORE_CALL_15|) (= (select |v_#valid_BEFORE_CALL_14| .cse4) 0) (= (select |v_#valid_BEFORE_CALL_14| v_arrayElimCell_58) 1)))) (= .cse6 |c_ULTIMATE.start_dll_append_~last~0#1.offset|) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse1) (or .cse0 (= .cse6 0) (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| .cse2)) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base|) (+ |c_ULTIMATE.start_dll_append_~last~0#1.offset| 4)) |c_ULTIMATE.start_dll_append_#t~mem10#1.offset|))))) is different from false [2024-10-11 01:44:12,704 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| .cse2) 4))) (let ((.cse0 (= .cse1 .cse2)) (.cse6 (select (select |c_#memory_$Pointer$#2.offset| .cse2) 4))) (and (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (or .cse0 (= .cse1 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) (= (select (select |c_#memory_int#2| .cse1) 0) 1)) (exists ((|v_#valid_BEFORE_CALL_16| (Array Int Int)) (|v_#valid_BEFORE_CALL_17| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_17| .cse2) 0) (= (select |v_#valid_BEFORE_CALL_17| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_16| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_16| .cse2) 1) (= |v_#valid_BEFORE_CALL_16| (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_17| |v_#valid_BEFORE_CALL_16|))) (store |v_#valid_BEFORE_CALL_17| .cse3 (select |v_#valid_BEFORE_CALL_16| .cse3)))))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_#valid_BEFORE_CALL_14| (Array Int Int)) (v_arrayElimCell_58 Int) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7| Int) (|v_#valid_BEFORE_CALL_15| (Array Int Int))) (let ((.cse4 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0) 0) (= (select |v_#valid_BEFORE_CALL_15| .cse4) 1) (= (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_14| |v_#valid_BEFORE_CALL_15|))) (store |v_#valid_BEFORE_CALL_14| .cse5 (select |v_#valid_BEFORE_CALL_15| .cse5))) |v_#valid_BEFORE_CALL_15|) (= (select |v_#valid_BEFORE_CALL_14| .cse4) 0) (= (select |v_#valid_BEFORE_CALL_14| v_arrayElimCell_58) 1)))) (= .cse6 |c_ULTIMATE.start_dll_append_~last~0#1.offset|) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse1) (or .cse0 (= .cse6 0) (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| .cse2)) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base|) (+ |c_ULTIMATE.start_dll_append_~last~0#1.offset| 4)) |c_ULTIMATE.start_dll_append_#t~mem10#1.offset|))))) is different from true [2024-10-11 01:44:12,774 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| .cse2) 4))) (let ((.cse0 (= .cse1 .cse2)) (.cse6 (select (select |c_#memory_$Pointer$#2.offset| .cse2) 4))) (and (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (or .cse0 (= .cse1 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) (= (select (select |c_#memory_int#2| .cse1) 0) 1)) (exists ((|v_#valid_BEFORE_CALL_16| (Array Int Int)) (|v_#valid_BEFORE_CALL_17| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_17| .cse2) 0) (= (select |v_#valid_BEFORE_CALL_17| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_16| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_16| .cse2) 1) (= |v_#valid_BEFORE_CALL_16| (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_17| |v_#valid_BEFORE_CALL_16|))) (store |v_#valid_BEFORE_CALL_17| .cse3 (select |v_#valid_BEFORE_CALL_16| .cse3)))))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base|) (+ |c_ULTIMATE.start_dll_append_~last~0#1.offset| 4)) 0) (exists ((|v_#valid_BEFORE_CALL_14| (Array Int Int)) (v_arrayElimCell_58 Int) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7| Int) (|v_#valid_BEFORE_CALL_15| (Array Int Int))) (let ((.cse4 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0) 0) (= (select |v_#valid_BEFORE_CALL_15| .cse4) 1) (= (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_14| |v_#valid_BEFORE_CALL_15|))) (store |v_#valid_BEFORE_CALL_14| .cse5 (select |v_#valid_BEFORE_CALL_15| .cse5))) |v_#valid_BEFORE_CALL_15|) (= (select |v_#valid_BEFORE_CALL_14| .cse4) 0) (= (select |v_#valid_BEFORE_CALL_14| v_arrayElimCell_58) 1)))) (= .cse6 |c_ULTIMATE.start_dll_append_~last~0#1.offset|) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse1) (or .cse0 (= .cse6 0) (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| .cse2)) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0))))) is different from false [2024-10-11 01:44:12,777 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| .cse2) 4))) (let ((.cse0 (= .cse1 .cse2)) (.cse6 (select (select |c_#memory_$Pointer$#2.offset| .cse2) 4))) (and (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (or .cse0 (= .cse1 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) (= (select (select |c_#memory_int#2| .cse1) 0) 1)) (exists ((|v_#valid_BEFORE_CALL_16| (Array Int Int)) (|v_#valid_BEFORE_CALL_17| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_17| .cse2) 0) (= (select |v_#valid_BEFORE_CALL_17| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_16| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_16| .cse2) 1) (= |v_#valid_BEFORE_CALL_16| (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_17| |v_#valid_BEFORE_CALL_16|))) (store |v_#valid_BEFORE_CALL_17| .cse3 (select |v_#valid_BEFORE_CALL_16| .cse3)))))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base|) (+ |c_ULTIMATE.start_dll_append_~last~0#1.offset| 4)) 0) (exists ((|v_#valid_BEFORE_CALL_14| (Array Int Int)) (v_arrayElimCell_58 Int) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7| Int) (|v_#valid_BEFORE_CALL_15| (Array Int Int))) (let ((.cse4 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0) 0) (= (select |v_#valid_BEFORE_CALL_15| .cse4) 1) (= (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_14| |v_#valid_BEFORE_CALL_15|))) (store |v_#valid_BEFORE_CALL_14| .cse5 (select |v_#valid_BEFORE_CALL_15| .cse5))) |v_#valid_BEFORE_CALL_15|) (= (select |v_#valid_BEFORE_CALL_14| .cse4) 0) (= (select |v_#valid_BEFORE_CALL_14| v_arrayElimCell_58) 1)))) (= .cse6 |c_ULTIMATE.start_dll_append_~last~0#1.offset|) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse1) (or .cse0 (= .cse6 0) (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| .cse2)) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0))))) is different from true [2024-10-11 01:44:12,815 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 01:44:12,825 INFO L349 Elim1Store]: treesize reduction 56, result has 13.8 percent of original size [2024-10-11 01:44:12,826 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 216 treesize of output 141 [2024-10-11 01:44:12,840 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 01:44:12,841 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 74 treesize of output 68 [2024-10-11 01:44:12,846 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 01:44:12,846 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 01:44:12,847 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 89 treesize of output 47 [2024-10-11 01:44:12,849 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 15 treesize of output 3 [2024-10-11 01:44:12,853 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 35 [2024-10-11 01:44:12,882 INFO L349 Elim1Store]: treesize reduction 39, result has 2.5 percent of original size [2024-10-11 01:44:12,883 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 151 treesize of output 93 [2024-10-11 01:44:12,888 WARN L214 Elim1Store]: Array PQE input equivalent to false [2024-10-11 01:44:12,911 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| .cse1) 4))) (and (or (= .cse0 .cse1) (= (select (select |c_#memory_int#2| .cse0) 0) 1)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse1) 4) 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_ULTIMATE.start_dll_append_~new_last~0#1.base_28| Int) (|v_#valid_BEFORE_CALL_16| (Array Int Int)) (|v_#valid_BEFORE_CALL_17| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_17| .cse1) 0) (= (select |v_#valid_BEFORE_CALL_17| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_16| .cse1) 1) (= 0 (select |v_#valid_BEFORE_CALL_16| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_28|)) (= |v_#valid_BEFORE_CALL_16| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_17| |v_#valid_BEFORE_CALL_16|))) (store |v_#valid_BEFORE_CALL_17| .cse2 (select |v_#valid_BEFORE_CALL_16| .cse2)))))) (exists ((|v_#valid_BEFORE_CALL_14| (Array Int Int)) (v_arrayElimCell_58 Int) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7| Int) (|v_#valid_BEFORE_CALL_15| (Array Int Int))) (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0) 0) (= (select |v_#valid_BEFORE_CALL_15| .cse3) 1) (= (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_14| |v_#valid_BEFORE_CALL_15|))) (store |v_#valid_BEFORE_CALL_14| .cse4 (select |v_#valid_BEFORE_CALL_15| .cse4))) |v_#valid_BEFORE_CALL_15|) (= (select |v_#valid_BEFORE_CALL_14| .cse3) 0) (= (select |v_#valid_BEFORE_CALL_14| v_arrayElimCell_58) 1)))) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0)))) is different from false [2024-10-11 01:44:12,913 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| .cse1) 4))) (and (or (= .cse0 .cse1) (= (select (select |c_#memory_int#2| .cse0) 0) 1)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse1) 4) 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_ULTIMATE.start_dll_append_~new_last~0#1.base_28| Int) (|v_#valid_BEFORE_CALL_16| (Array Int Int)) (|v_#valid_BEFORE_CALL_17| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_17| .cse1) 0) (= (select |v_#valid_BEFORE_CALL_17| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_16| .cse1) 1) (= 0 (select |v_#valid_BEFORE_CALL_16| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_28|)) (= |v_#valid_BEFORE_CALL_16| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_17| |v_#valid_BEFORE_CALL_16|))) (store |v_#valid_BEFORE_CALL_17| .cse2 (select |v_#valid_BEFORE_CALL_16| .cse2)))))) (exists ((|v_#valid_BEFORE_CALL_14| (Array Int Int)) (v_arrayElimCell_58 Int) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7| Int) (|v_#valid_BEFORE_CALL_15| (Array Int Int))) (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0) 0) (= (select |v_#valid_BEFORE_CALL_15| .cse3) 1) (= (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_14| |v_#valid_BEFORE_CALL_15|))) (store |v_#valid_BEFORE_CALL_14| .cse4 (select |v_#valid_BEFORE_CALL_15| .cse4))) |v_#valid_BEFORE_CALL_15|) (= (select |v_#valid_BEFORE_CALL_14| .cse3) 0) (= (select |v_#valid_BEFORE_CALL_14| v_arrayElimCell_58) 1)))) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0)))) is different from true [2024-10-11 01:44:12,933 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 01:44:12,933 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 99 treesize of output 67 [2024-10-11 01:44:12,961 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-10-11 01:44:12,961 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-10-11 01:44:12,966 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~ptr~0#1.base|) 4))) (and (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (exists ((|v_ULTIMATE.start_dll_append_~new_last~0#1.base_28| Int) (|v_#valid_BEFORE_CALL_16| (Array Int Int)) (|v_#valid_BEFORE_CALL_17| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_16| |c_ULTIMATE.start_main_~ptr~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_17| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= 0 (select |v_#valid_BEFORE_CALL_16| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_28|)) (= (select |v_#valid_BEFORE_CALL_17| .cse0) 1) (= |v_#valid_BEFORE_CALL_16| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_17| |v_#valid_BEFORE_CALL_16|))) (store |v_#valid_BEFORE_CALL_17| .cse1 (select |v_#valid_BEFORE_CALL_16| .cse1)))))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (or (= (select (select |c_#memory_int#2| .cse0) 0) 1) (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse0)) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~ptr~0#1.base|) 4) 0))) is different from false [2024-10-11 01:44:12,968 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~ptr~0#1.base|) 4))) (and (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (exists ((|v_ULTIMATE.start_dll_append_~new_last~0#1.base_28| Int) (|v_#valid_BEFORE_CALL_16| (Array Int Int)) (|v_#valid_BEFORE_CALL_17| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_16| |c_ULTIMATE.start_main_~ptr~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_17| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= 0 (select |v_#valid_BEFORE_CALL_16| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_28|)) (= (select |v_#valid_BEFORE_CALL_17| .cse0) 1) (= |v_#valid_BEFORE_CALL_16| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_17| |v_#valid_BEFORE_CALL_16|))) (store |v_#valid_BEFORE_CALL_17| .cse1 (select |v_#valid_BEFORE_CALL_16| .cse1)))))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (or (= (select (select |c_#memory_int#2| .cse0) 0) 1) (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse0)) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~ptr~0#1.base|) 4) 0))) is different from true [2024-10-11 01:44:12,995 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 20 [2024-10-11 01:44:13,000 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-10-11 01:44:13,023 WARN L851 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (exists ((|v_ULTIMATE.start_dll_append_~new_last~0#1.base_28| Int) (|v_#valid_BEFORE_CALL_16| (Array Int Int)) (|v_#valid_BEFORE_CALL_17| (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.base_24| Int)) (and (= (select |v_#valid_BEFORE_CALL_17| |c_ULTIMATE.start_main_~ptr~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_16| |v_ULTIMATE.start_main_~ptr~0#1.base_24|) 1) (= (select |v_#valid_BEFORE_CALL_17| |v_ULTIMATE.start_main_~ptr~0#1.base_24|) 0) (= 0 (select |v_#valid_BEFORE_CALL_16| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_28|)) (= |v_#valid_BEFORE_CALL_16| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_17| |v_#valid_BEFORE_CALL_16|))) (store |v_#valid_BEFORE_CALL_17| .cse0 (select |v_#valid_BEFORE_CALL_16| .cse0)))))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= (select (select |c_#memory_int#2| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) 1)) is different from false [2024-10-11 01:44:13,025 WARN L873 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (exists ((|v_ULTIMATE.start_dll_append_~new_last~0#1.base_28| Int) (|v_#valid_BEFORE_CALL_16| (Array Int Int)) (|v_#valid_BEFORE_CALL_17| (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.base_24| Int)) (and (= (select |v_#valid_BEFORE_CALL_17| |c_ULTIMATE.start_main_~ptr~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_16| |v_ULTIMATE.start_main_~ptr~0#1.base_24|) 1) (= (select |v_#valid_BEFORE_CALL_17| |v_ULTIMATE.start_main_~ptr~0#1.base_24|) 0) (= 0 (select |v_#valid_BEFORE_CALL_16| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_28|)) (= |v_#valid_BEFORE_CALL_16| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_17| |v_#valid_BEFORE_CALL_16|))) (store |v_#valid_BEFORE_CALL_17| .cse0 (select |v_#valid_BEFORE_CALL_16| .cse0)))))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= (select (select |c_#memory_int#2| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) 1)) is different from true [2024-10-11 01:44:13,058 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 14 not checked. [2024-10-11 01:44:13,058 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 01:44:13,778 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_append_#t~ret7#1.base_38| Int) (v_ArrVal_2183 Int) (v_ArrVal_2191 (Array Int Int)) (v_ArrVal_2190 (Array Int Int)) (v_ArrVal_2203 (Array Int Int)) (v_ArrVal_2202 (Array Int Int)) (v_ArrVal_2201 (Array Int Int)) (v_ArrVal_2189 (Array Int Int)) (v_ArrVal_2186 (Array Int Int)) (v_ArrVal_2185 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_38| v_ArrVal_2201)) (.cse5 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse6 (+ (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 4))) (let ((.cse2 (+ (select (select .cse0 .cse5) .cse6) 4)) (.cse1 (select (select (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_38| v_ArrVal_2202) .cse5) .cse6))) (or (not (= (select (select .cse0 .cse1) .cse2) 0)) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_38|) 0)) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse4 (+ (select (select |c_#memory_$Pointer$#1.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#2| .cse1 (store (select (store |c_#memory_int#2| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_38| v_ArrVal_2203) .cse1) .cse2 v_ArrVal_2183)) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_38| v_ArrVal_2186) (select (select (store (store |c_#memory_$Pointer$#2.base| .cse1 v_ArrVal_2189) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_38| v_ArrVal_2191) .cse3) .cse4)) (select (select (store (store |c_#memory_$Pointer$#2.offset| .cse1 v_ArrVal_2185) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_38| v_ArrVal_2190) .cse3) .cse4)))))))) is different from false [2024-10-11 01:44:13,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [753392307] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 01:44:13,780 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 01:44:13,780 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 29] total 52 [2024-10-11 01:44:13,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [888788739] [2024-10-11 01:44:13,780 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 01:44:13,781 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2024-10-11 01:44:13,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 01:44:13,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2024-10-11 01:44:13,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=1659, Unknown=62, NotChecked=1782, Total=3660 [2024-10-11 01:44:13,783 INFO L87 Difference]: Start difference. First operand 42 states and 48 transitions. Second operand has 52 states, 45 states have (on average 1.288888888888889) internal successors, (58), 42 states have internal predecessors, (58), 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-10-11 01:44:18,131 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int#2| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 0))) (let ((.cse1 (= .cse0 1)) (.cse4 (select (select |c_#memory_int#2| |c_ULTIMATE.start_dll_create_#t~ret4#1.base|) 0))) (and (= .cse0 |c_ULTIMATE.start_main_~data~0#1|) (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| 0) .cse1 (= |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_14| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_14| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_14| |c_ULTIMATE.start_dll_create_#t~ret4#1.base|) 0) (= |c_#valid| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_14| |c_#valid|))) (store |v_#valid_BEFORE_CALL_14| .cse2 (select |c_#valid| .cse2)))))) (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) (or .cse1 (exists ((|v_#memory_int#2_BEFORE_CALL_6| (Array Int (Array Int Int)))) (let ((.cse3 (@diff |v_#memory_int#2_BEFORE_CALL_6| |c_#memory_int#2|))) (and (= (select (select |v_#memory_int#2_BEFORE_CALL_6| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 0) 1) (= (store |v_#memory_int#2_BEFORE_CALL_6| .cse3 (select |c_#memory_int#2| .cse3)) |c_#memory_int#2|) (= |c_ULTIMATE.start_dll_create_#t~ret4#1.base| .cse3))))) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1) (= |c_ULTIMATE.start_main_~data~0#1| .cse4) (= .cse4 |c_ULTIMATE.start_dll_create_~data#1|)))) is different from false [2024-10-11 01:44:18,134 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int#2| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 0))) (let ((.cse1 (= .cse0 1)) (.cse4 (select (select |c_#memory_int#2| |c_ULTIMATE.start_dll_create_#t~ret4#1.base|) 0))) (and (= .cse0 |c_ULTIMATE.start_main_~data~0#1|) (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| 0) .cse1 (= |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_14| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_14| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_14| |c_ULTIMATE.start_dll_create_#t~ret4#1.base|) 0) (= |c_#valid| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_14| |c_#valid|))) (store |v_#valid_BEFORE_CALL_14| .cse2 (select |c_#valid| .cse2)))))) (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) (or .cse1 (exists ((|v_#memory_int#2_BEFORE_CALL_6| (Array Int (Array Int Int)))) (let ((.cse3 (@diff |v_#memory_int#2_BEFORE_CALL_6| |c_#memory_int#2|))) (and (= (select (select |v_#memory_int#2_BEFORE_CALL_6| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 0) 1) (= (store |v_#memory_int#2_BEFORE_CALL_6| .cse3 (select |c_#memory_int#2| .cse3)) |c_#memory_int#2|) (= |c_ULTIMATE.start_dll_create_#t~ret4#1.base| .cse3))))) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1) (= |c_ULTIMATE.start_main_~data~0#1| .cse4) (= .cse4 |c_ULTIMATE.start_dll_create_~data#1|)))) is different from true [2024-10-11 01:44:18,138 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int#2| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 0)) (.cse1 (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (.cse4 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4)) (.cse2 (select |c_#memory_int#2| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))) (and (= .cse0 |c_ULTIMATE.start_main_~data~0#1|) (or .cse1 (= .cse0 1) (exists ((|v_#memory_int#2_305| (Array Int (Array Int Int)))) (and (= (store |v_#memory_int#2_305| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse2) |c_#memory_int#2|) (exists ((|v_#memory_int#2_BEFORE_CALL_6| (Array Int (Array Int Int)))) (let ((.cse3 (@diff |v_#memory_int#2_BEFORE_CALL_6| |v_#memory_int#2_305|))) (and (= (select (select |v_#memory_int#2_BEFORE_CALL_6| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 0) 1) (= |v_#memory_int#2_305| (store |v_#memory_int#2_BEFORE_CALL_6| .cse3 (select |v_#memory_int#2_305| .cse3))) (= .cse3 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))))))) (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#2.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) (not .cse1) (= |c_ULTIMATE.start_main_~data~0#1| 1) (not (= (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 8) 0)) (= .cse4 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (= (select |c_#valid| .cse4) 1) (exists ((|v_#valid_BEFORE_CALL_14| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_14| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1) (= 0 (select |v_#valid_BEFORE_CALL_14| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (= |c_#valid| (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_14| |c_#valid|))) (store |v_#valid_BEFORE_CALL_14| .cse5 (select |c_#valid| .cse5)))))) (= (select .cse2 0) 1))) is different from false [2024-10-11 01:44:18,140 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int#2| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 0)) (.cse1 (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (.cse4 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4)) (.cse2 (select |c_#memory_int#2| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))) (and (= .cse0 |c_ULTIMATE.start_main_~data~0#1|) (or .cse1 (= .cse0 1) (exists ((|v_#memory_int#2_305| (Array Int (Array Int Int)))) (and (= (store |v_#memory_int#2_305| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse2) |c_#memory_int#2|) (exists ((|v_#memory_int#2_BEFORE_CALL_6| (Array Int (Array Int Int)))) (let ((.cse3 (@diff |v_#memory_int#2_BEFORE_CALL_6| |v_#memory_int#2_305|))) (and (= (select (select |v_#memory_int#2_BEFORE_CALL_6| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 0) 1) (= |v_#memory_int#2_305| (store |v_#memory_int#2_BEFORE_CALL_6| .cse3 (select |v_#memory_int#2_305| .cse3))) (= .cse3 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))))))) (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#2.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) (not .cse1) (= |c_ULTIMATE.start_main_~data~0#1| 1) (not (= (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 8) 0)) (= .cse4 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (= (select |c_#valid| .cse4) 1) (exists ((|v_#valid_BEFORE_CALL_14| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_14| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1) (= 0 (select |v_#valid_BEFORE_CALL_14| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (= |c_#valid| (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_14| |c_#valid|))) (store |v_#valid_BEFORE_CALL_14| .cse5 (select |c_#valid| .cse5)))))) (= (select .cse2 0) 1))) is different from true [2024-10-11 01:44:18,143 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4))) (let ((.cse0 (select (select |c_#memory_int#2| .cse2) 0)) (.cse4 (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4) 0)) (.cse1 (= .cse2 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))) (and (or (= .cse0 1) .cse1) (exists ((|v_#valid_BEFORE_CALL_14| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_14| .cse2) 1) (= 0 (select |v_#valid_BEFORE_CALL_14| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (= |c_#valid| (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_14| |c_#valid|))) (store |v_#valid_BEFORE_CALL_14| .cse3 (select |c_#valid| .cse3)))))) .cse4 (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| .cse0) (= |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 .cse4 .cse1) (not .cse1) (= (select |c_#valid| .cse2) 1)))) is different from false [2024-10-11 01:44:18,144 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4))) (let ((.cse0 (select (select |c_#memory_int#2| .cse2) 0)) (.cse4 (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4) 0)) (.cse1 (= .cse2 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))) (and (or (= .cse0 1) .cse1) (exists ((|v_#valid_BEFORE_CALL_14| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_14| .cse2) 1) (= 0 (select |v_#valid_BEFORE_CALL_14| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (= |c_#valid| (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_14| |c_#valid|))) (store |v_#valid_BEFORE_CALL_14| .cse3 (select |c_#valid| .cse3)))))) .cse4 (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| .cse0) (= |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 .cse4 .cse1) (not .cse1) (= (select |c_#valid| .cse2) 1)))) is different from true [2024-10-11 01:44:18,147 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4))) (let ((.cse2 (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4) 0)) (.cse1 (= .cse3 |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (.cse0 (select (select |c_#memory_int#2| .cse3) 0))) (and (or (= .cse0 1) .cse1) (or .cse2 .cse1) (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| .cse3) 1) .cse2 (= |c_ULTIMATE.start_main_~data~0#1| 1) (not .cse1) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1) (= |c_ULTIMATE.start_main_~data~0#1| .cse0) (exists ((|v_#valid_BEFORE_CALL_14| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_14| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_14| .cse3) 1) (= |c_#valid| (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_14| |c_#valid|))) (store |v_#valid_BEFORE_CALL_14| .cse4 (select |c_#valid| .cse4))))))))) is different from false [2024-10-11 01:44:18,148 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4))) (let ((.cse2 (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4) 0)) (.cse1 (= .cse3 |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (.cse0 (select (select |c_#memory_int#2| .cse3) 0))) (and (or (= .cse0 1) .cse1) (or .cse2 .cse1) (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| .cse3) 1) .cse2 (= |c_ULTIMATE.start_main_~data~0#1| 1) (not .cse1) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1) (= |c_ULTIMATE.start_main_~data~0#1| .cse0) (exists ((|v_#valid_BEFORE_CALL_14| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_14| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_14| .cse3) 1) (= |c_#valid| (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_14| |c_#valid|))) (store |v_#valid_BEFORE_CALL_14| .cse4 (select |c_#valid| .cse4))))))))) is different from true [2024-10-11 01:44:18,151 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse6 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse2 (select .cse6 0)) (.cse9 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_append_~head#1.base|))) (let ((.cse3 (select .cse9 |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse5 (select (select |c_#memory_$Pointer$#2.base| .cse2) 4))) (let ((.cse0 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_append_~head#1.base|)) (.cse4 (= .cse5 .cse2)) (.cse7 (select (select |c_#memory_$Pointer$#2.base| .cse3) 4)) (.cse1 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|))) (and (= |c_ULTIMATE.start_dll_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= .cse0 .cse1) (= (select |c_#valid| .cse2) 1) (= (select |c_#valid| .cse3) 1) (or .cse4 (= (select (select |c_#memory_int#2| .cse5) 0) 1)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select .cse0 |c_ULTIMATE.start_dll_append_~head#1.offset|) 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse3) 4) 0) (= (select .cse6 |c_ULTIMATE.start_main_~#s~0#1.offset|) .cse3) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= (select |c_#valid| .cse7) 1) (not (= .cse3 .cse7)) (or .cse4 (= (select (select |c_#memory_$Pointer$#2.offset| .cse2) 4) 0)) (exists ((|v_#valid_BEFORE_CALL_14| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_14| .cse2) 0) (= (select |v_#valid_BEFORE_CALL_14| .cse5) 1) (= |c_#valid| (let ((.cse8 (@diff |v_#valid_BEFORE_CALL_14| |c_#valid|))) (store |v_#valid_BEFORE_CALL_14| .cse8 (select |c_#valid| .cse8)))))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int#2| .cse7) 0)) (= .cse9 .cse6) (= (select .cse1 0) 0) (= |c_ULTIMATE.start_dll_append_~head#1.offset| 0) (= (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)))))) is different from false [2024-10-11 01:44:18,153 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse6 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse2 (select .cse6 0)) (.cse9 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_append_~head#1.base|))) (let ((.cse3 (select .cse9 |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse5 (select (select |c_#memory_$Pointer$#2.base| .cse2) 4))) (let ((.cse0 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_append_~head#1.base|)) (.cse4 (= .cse5 .cse2)) (.cse7 (select (select |c_#memory_$Pointer$#2.base| .cse3) 4)) (.cse1 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|))) (and (= |c_ULTIMATE.start_dll_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= .cse0 .cse1) (= (select |c_#valid| .cse2) 1) (= (select |c_#valid| .cse3) 1) (or .cse4 (= (select (select |c_#memory_int#2| .cse5) 0) 1)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select .cse0 |c_ULTIMATE.start_dll_append_~head#1.offset|) 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse3) 4) 0) (= (select .cse6 |c_ULTIMATE.start_main_~#s~0#1.offset|) .cse3) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= (select |c_#valid| .cse7) 1) (not (= .cse3 .cse7)) (or .cse4 (= (select (select |c_#memory_$Pointer$#2.offset| .cse2) 4) 0)) (exists ((|v_#valid_BEFORE_CALL_14| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_14| .cse2) 0) (= (select |v_#valid_BEFORE_CALL_14| .cse5) 1) (= |c_#valid| (let ((.cse8 (@diff |v_#valid_BEFORE_CALL_14| |c_#valid|))) (store |v_#valid_BEFORE_CALL_14| .cse8 (select |c_#valid| .cse8)))))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int#2| .cse7) 0)) (= .cse9 .cse6) (= (select .cse1 0) 0) (= |c_ULTIMATE.start_dll_append_~head#1.offset| 0) (= (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)))))) is different from true [2024-10-11 01:44:18,156 WARN L851 $PredicateComparison]: unable to prove that (and (= |c_#valid| |c_old(#valid)|) (= |c_#memory_$Pointer$#2.offset| |c_old(#memory_$Pointer$#2.offset)|) (exists ((|v_#valid_BEFORE_CALL_14| (Array Int Int)) (v_arrayElimCell_58 Int) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7| Int) (|v_#valid_BEFORE_CALL_15| (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0) 0) (= (select |v_#valid_BEFORE_CALL_15| .cse0) 1) (= (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_14| |v_#valid_BEFORE_CALL_15|))) (store |v_#valid_BEFORE_CALL_14| .cse1 (select |v_#valid_BEFORE_CALL_15| .cse1))) |v_#valid_BEFORE_CALL_15|) (= (select |v_#valid_BEFORE_CALL_14| .cse0) 0) (= (select |v_#valid_BEFORE_CALL_14| v_arrayElimCell_58) 1)))) (= |c_old(#length)| |c_#length|) (= |c_old(#memory_int#2)| |c_#memory_int#2|) (= |c_old(#memory_$Pointer$#2.base)| |c_#memory_$Pointer$#2.base|)) is different from false [2024-10-11 01:44:18,157 WARN L873 $PredicateComparison]: unable to prove that (and (= |c_#valid| |c_old(#valid)|) (= |c_#memory_$Pointer$#2.offset| |c_old(#memory_$Pointer$#2.offset)|) (exists ((|v_#valid_BEFORE_CALL_14| (Array Int Int)) (v_arrayElimCell_58 Int) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7| Int) (|v_#valid_BEFORE_CALL_15| (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0) 0) (= (select |v_#valid_BEFORE_CALL_15| .cse0) 1) (= (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_14| |v_#valid_BEFORE_CALL_15|))) (store |v_#valid_BEFORE_CALL_14| .cse1 (select |v_#valid_BEFORE_CALL_15| .cse1))) |v_#valid_BEFORE_CALL_15|) (= (select |v_#valid_BEFORE_CALL_14| .cse0) 0) (= (select |v_#valid_BEFORE_CALL_14| v_arrayElimCell_58) 1)))) (= |c_old(#length)| |c_#length|) (= |c_old(#memory_int#2)| |c_#memory_int#2|) (= |c_old(#memory_$Pointer$#2.base)| |c_#memory_$Pointer$#2.base|)) is different from true [2024-10-11 01:44:18,160 WARN L851 $PredicateComparison]: unable to prove that (and (= |c_node_create_#in~data#1| |c_node_create_~data#1|) (= |c_#valid| (store |c_old(#valid)| |c_node_create_~temp~0#1.base| 1)) (= |c_node_create_~temp~0#1.offset| 0) (= |c_#memory_$Pointer$#2.offset| |c_old(#memory_$Pointer$#2.offset)|) (= (select |c_#valid| |c_node_create_~temp~0#1.base|) 1) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (exists ((|v_#valid_BEFORE_CALL_14| (Array Int Int)) (v_arrayElimCell_58 Int) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7| Int) (|v_#valid_BEFORE_CALL_15| (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0) 0) (= (select |v_#valid_BEFORE_CALL_15| .cse0) 1) (= (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_14| |v_#valid_BEFORE_CALL_15|))) (store |v_#valid_BEFORE_CALL_14| .cse1 (select |v_#valid_BEFORE_CALL_15| .cse1))) |v_#valid_BEFORE_CALL_15|) (= (select |v_#valid_BEFORE_CALL_14| .cse0) 0) (= (select |v_#valid_BEFORE_CALL_14| v_arrayElimCell_58) 1)))) (= |c_old(#memory_int#2)| |c_#memory_int#2|) (= |c_old(#memory_$Pointer$#2.base)| |c_#memory_$Pointer$#2.base|)) is different from false [2024-10-11 01:44:18,161 WARN L873 $PredicateComparison]: unable to prove that (and (= |c_node_create_#in~data#1| |c_node_create_~data#1|) (= |c_#valid| (store |c_old(#valid)| |c_node_create_~temp~0#1.base| 1)) (= |c_node_create_~temp~0#1.offset| 0) (= |c_#memory_$Pointer$#2.offset| |c_old(#memory_$Pointer$#2.offset)|) (= (select |c_#valid| |c_node_create_~temp~0#1.base|) 1) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (exists ((|v_#valid_BEFORE_CALL_14| (Array Int Int)) (v_arrayElimCell_58 Int) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7| Int) (|v_#valid_BEFORE_CALL_15| (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0) 0) (= (select |v_#valid_BEFORE_CALL_15| .cse0) 1) (= (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_14| |v_#valid_BEFORE_CALL_15|))) (store |v_#valid_BEFORE_CALL_14| .cse1 (select |v_#valid_BEFORE_CALL_15| .cse1))) |v_#valid_BEFORE_CALL_15|) (= (select |v_#valid_BEFORE_CALL_14| .cse0) 0) (= (select |v_#valid_BEFORE_CALL_14| v_arrayElimCell_58) 1)))) (= |c_old(#memory_int#2)| |c_#memory_int#2|) (= |c_old(#memory_$Pointer$#2.base)| |c_#memory_$Pointer$#2.base|)) is different from true [2024-10-11 01:44:18,173 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (@diff |c_old(#memory_int#2)| |c_#memory_int#2|))) (let ((.cse12 (store |c_old(#memory_int#2)| .cse4 (select |c_#memory_int#2| .cse4)))) (let ((.cse7 (@diff .cse12 |c_#memory_int#2|))) (let ((.cse10 (store .cse12 .cse7 (select |c_#memory_int#2| .cse7)))) (let ((.cse3 (@diff |c_old(#memory_$Pointer$#2.offset)| |c_#memory_$Pointer$#2.offset|)) (.cse0 (select |c_#memory_int#2| |c_node_create_#res#1.base|)) (.cse2 (= .cse12 |c_#memory_int#2|)) (.cse11 (@diff .cse10 |c_#memory_int#2|)) (.cse1 (@diff |c_old(#memory_$Pointer$#2.base)| |c_#memory_$Pointer$#2.base|)) (.cse5 (= |c_old(#memory_int#2)| |c_#memory_int#2|))) (and (= |c_node_create_#res#1.offset| 0) (= |c_node_create_#in~data#1| (select .cse0 0)) (= (select |c_old(#valid)| |c_node_create_#res#1.base|) 0) (= (store |c_old(#memory_$Pointer$#2.offset)| |c_node_create_#res#1.base| (select |c_#memory_$Pointer$#2.offset| |c_node_create_#res#1.base|)) |c_#memory_$Pointer$#2.offset|) (or (= .cse1 |c_node_create_#res#1.base|) (= |c_old(#memory_$Pointer$#2.base)| |c_#memory_$Pointer$#2.base|)) .cse2 (= (select |c_#valid| |c_node_create_#res#1.base|) 1) (= (store |c_old(#memory_$Pointer$#2.offset)| .cse3 (select |c_#memory_$Pointer$#2.offset| .cse3)) |c_#memory_$Pointer$#2.offset|) (or (= .cse4 |c_node_create_#res#1.base|) .cse5) (= (store |c_old(#memory_$Pointer$#2.base)| |c_node_create_#res#1.base| (select |c_#memory_$Pointer$#2.base| |c_node_create_#res#1.base|)) |c_#memory_$Pointer$#2.base|) (or (= |c_#memory_$Pointer$#2.offset| |c_old(#memory_$Pointer$#2.offset)|) (= .cse3 |c_node_create_#res#1.base|)) (= (store |c_old(#memory_int#2)| |c_node_create_#res#1.base| .cse0) |c_#memory_int#2|) (= |c_#valid| (let ((.cse6 (@diff |c_old(#valid)| |c_#valid|))) (store |c_old(#valid)| .cse6 (select |c_#valid| .cse6)))) (or .cse2 (= (select |c_old(#valid)| .cse7) 0)) (exists ((|v_#valid_BEFORE_CALL_14| (Array Int Int)) (v_arrayElimCell_58 Int) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7| Int) (|v_#valid_BEFORE_CALL_15| (Array Int Int))) (let ((.cse8 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0) 0) (= (select |v_#valid_BEFORE_CALL_15| .cse8) 1) (= (let ((.cse9 (@diff |v_#valid_BEFORE_CALL_14| |v_#valid_BEFORE_CALL_15|))) (store |v_#valid_BEFORE_CALL_14| .cse9 (select |v_#valid_BEFORE_CALL_15| .cse9))) |v_#valid_BEFORE_CALL_15|) (= (select |v_#valid_BEFORE_CALL_14| .cse8) 0) (= (select |v_#valid_BEFORE_CALL_14| v_arrayElimCell_58) 1)))) (or (= |c_#memory_int#2| .cse10) (= (select |c_old(#valid)| .cse11) 0)) (= (store .cse10 .cse11 (select |c_#memory_int#2| .cse11)) |c_#memory_int#2|) (= (store |c_old(#memory_$Pointer$#2.base)| .cse1 (select |c_#memory_$Pointer$#2.base| .cse1)) |c_#memory_$Pointer$#2.base|) (or (= (select |c_old(#valid)| .cse4) 0) .cse5))))))) is different from false [2024-10-11 01:44:18,180 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse4 (@diff |c_old(#memory_int#2)| |c_#memory_int#2|))) (let ((.cse12 (store |c_old(#memory_int#2)| .cse4 (select |c_#memory_int#2| .cse4)))) (let ((.cse7 (@diff .cse12 |c_#memory_int#2|))) (let ((.cse10 (store .cse12 .cse7 (select |c_#memory_int#2| .cse7)))) (let ((.cse3 (@diff |c_old(#memory_$Pointer$#2.offset)| |c_#memory_$Pointer$#2.offset|)) (.cse0 (select |c_#memory_int#2| |c_node_create_#res#1.base|)) (.cse2 (= .cse12 |c_#memory_int#2|)) (.cse11 (@diff .cse10 |c_#memory_int#2|)) (.cse1 (@diff |c_old(#memory_$Pointer$#2.base)| |c_#memory_$Pointer$#2.base|)) (.cse5 (= |c_old(#memory_int#2)| |c_#memory_int#2|))) (and (= |c_node_create_#res#1.offset| 0) (= |c_node_create_#in~data#1| (select .cse0 0)) (= (select |c_old(#valid)| |c_node_create_#res#1.base|) 0) (= (store |c_old(#memory_$Pointer$#2.offset)| |c_node_create_#res#1.base| (select |c_#memory_$Pointer$#2.offset| |c_node_create_#res#1.base|)) |c_#memory_$Pointer$#2.offset|) (or (= .cse1 |c_node_create_#res#1.base|) (= |c_old(#memory_$Pointer$#2.base)| |c_#memory_$Pointer$#2.base|)) .cse2 (= (select |c_#valid| |c_node_create_#res#1.base|) 1) (= (store |c_old(#memory_$Pointer$#2.offset)| .cse3 (select |c_#memory_$Pointer$#2.offset| .cse3)) |c_#memory_$Pointer$#2.offset|) (or (= .cse4 |c_node_create_#res#1.base|) .cse5) (= (store |c_old(#memory_$Pointer$#2.base)| |c_node_create_#res#1.base| (select |c_#memory_$Pointer$#2.base| |c_node_create_#res#1.base|)) |c_#memory_$Pointer$#2.base|) (or (= |c_#memory_$Pointer$#2.offset| |c_old(#memory_$Pointer$#2.offset)|) (= .cse3 |c_node_create_#res#1.base|)) (= (store |c_old(#memory_int#2)| |c_node_create_#res#1.base| .cse0) |c_#memory_int#2|) (= |c_#valid| (let ((.cse6 (@diff |c_old(#valid)| |c_#valid|))) (store |c_old(#valid)| .cse6 (select |c_#valid| .cse6)))) (or .cse2 (= (select |c_old(#valid)| .cse7) 0)) (exists ((|v_#valid_BEFORE_CALL_14| (Array Int Int)) (v_arrayElimCell_58 Int) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7| Int) (|v_#valid_BEFORE_CALL_15| (Array Int Int))) (let ((.cse8 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0) 0) (= (select |v_#valid_BEFORE_CALL_15| .cse8) 1) (= (let ((.cse9 (@diff |v_#valid_BEFORE_CALL_14| |v_#valid_BEFORE_CALL_15|))) (store |v_#valid_BEFORE_CALL_14| .cse9 (select |v_#valid_BEFORE_CALL_15| .cse9))) |v_#valid_BEFORE_CALL_15|) (= (select |v_#valid_BEFORE_CALL_14| .cse8) 0) (= (select |v_#valid_BEFORE_CALL_14| v_arrayElimCell_58) 1)))) (or (= |c_#memory_int#2| .cse10) (= (select |c_old(#valid)| .cse11) 0)) (= (store .cse10 .cse11 (select |c_#memory_int#2| .cse11)) |c_#memory_int#2|) (= (store |c_old(#memory_$Pointer$#2.base)| .cse1 (select |c_#memory_$Pointer$#2.base| .cse1)) |c_#memory_$Pointer$#2.base|) (or (= (select |c_old(#valid)| .cse4) 0) .cse5))))))) is different from true [2024-10-11 01:44:18,188 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse7 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse3 (select .cse7 0)) (.cse9 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_append_~head#1.base|))) (let ((.cse2 (select .cse9 |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse5 (select (select |c_#memory_$Pointer$#2.base| .cse3) 4))) (let ((.cse0 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_append_~head#1.base|)) (.cse4 (= .cse5 .cse3)) (.cse8 (select (select |c_#memory_$Pointer$#2.base| .cse2) 4)) (.cse1 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|))) (and (= |c_ULTIMATE.start_dll_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= .cse0 .cse1) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select .cse0 |c_ULTIMATE.start_dll_append_~head#1.offset|) 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse2) 4) 0) (= |c_ULTIMATE.start_dll_append_#t~ret7#1.offset| 0) (or (= |c_ULTIMATE.start_dll_append_#t~ret7#1.base| .cse3) .cse4 (= (select (select |c_#memory_$Pointer$#2.offset| .cse3) 4) 0)) (exists ((|v_#valid_BEFORE_CALL_16| (Array Int Int)) (|v_#valid_BEFORE_CALL_17| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_16| |c_ULTIMATE.start_dll_append_#t~ret7#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_17| .cse3) 0) (= (select |v_#valid_BEFORE_CALL_17| .cse5) 1) (= (select |v_#valid_BEFORE_CALL_16| .cse3) 1) (= |v_#valid_BEFORE_CALL_16| (let ((.cse6 (@diff |v_#valid_BEFORE_CALL_17| |v_#valid_BEFORE_CALL_16|))) (store |v_#valid_BEFORE_CALL_17| .cse6 (select |v_#valid_BEFORE_CALL_16| .cse6)))))) (= (select .cse7 |c_ULTIMATE.start_main_~#s~0#1.offset|) .cse2) (= |c_ULTIMATE.start_main_~data~0#1| 1) (not (= |c_ULTIMATE.start_dll_append_#t~ret7#1.base| .cse8)) (or .cse4 (= |c_ULTIMATE.start_dll_append_#t~ret7#1.base| .cse5) (= (select (select |c_#memory_int#2| .cse5) 0) 1)) (not (= .cse2 .cse8)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int#2| .cse8) 0)) (= .cse9 .cse7) (exists ((|v_#valid_BEFORE_CALL_14| (Array Int Int)) (v_arrayElimCell_58 Int) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7| Int) (|v_#valid_BEFORE_CALL_15| (Array Int Int))) (let ((.cse10 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0) 0) (= (select |v_#valid_BEFORE_CALL_15| .cse10) 1) (= (let ((.cse11 (@diff |v_#valid_BEFORE_CALL_14| |v_#valid_BEFORE_CALL_15|))) (store |v_#valid_BEFORE_CALL_14| .cse11 (select |v_#valid_BEFORE_CALL_15| .cse11))) |v_#valid_BEFORE_CALL_15|) (= (select |v_#valid_BEFORE_CALL_14| .cse10) 0) (= (select |v_#valid_BEFORE_CALL_14| v_arrayElimCell_58) 1)))) (= (select .cse1 0) 0) (= |c_ULTIMATE.start_dll_append_~head#1.offset| 0) (not (= |c_ULTIMATE.start_dll_append_#t~ret7#1.base| .cse2)) (= (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)))))) is different from false [2024-10-11 01:44:18,190 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse7 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse3 (select .cse7 0)) (.cse9 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_append_~head#1.base|))) (let ((.cse2 (select .cse9 |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse5 (select (select |c_#memory_$Pointer$#2.base| .cse3) 4))) (let ((.cse0 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_append_~head#1.base|)) (.cse4 (= .cse5 .cse3)) (.cse8 (select (select |c_#memory_$Pointer$#2.base| .cse2) 4)) (.cse1 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|))) (and (= |c_ULTIMATE.start_dll_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= .cse0 .cse1) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select .cse0 |c_ULTIMATE.start_dll_append_~head#1.offset|) 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse2) 4) 0) (= |c_ULTIMATE.start_dll_append_#t~ret7#1.offset| 0) (or (= |c_ULTIMATE.start_dll_append_#t~ret7#1.base| .cse3) .cse4 (= (select (select |c_#memory_$Pointer$#2.offset| .cse3) 4) 0)) (exists ((|v_#valid_BEFORE_CALL_16| (Array Int Int)) (|v_#valid_BEFORE_CALL_17| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_16| |c_ULTIMATE.start_dll_append_#t~ret7#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_17| .cse3) 0) (= (select |v_#valid_BEFORE_CALL_17| .cse5) 1) (= (select |v_#valid_BEFORE_CALL_16| .cse3) 1) (= |v_#valid_BEFORE_CALL_16| (let ((.cse6 (@diff |v_#valid_BEFORE_CALL_17| |v_#valid_BEFORE_CALL_16|))) (store |v_#valid_BEFORE_CALL_17| .cse6 (select |v_#valid_BEFORE_CALL_16| .cse6)))))) (= (select .cse7 |c_ULTIMATE.start_main_~#s~0#1.offset|) .cse2) (= |c_ULTIMATE.start_main_~data~0#1| 1) (not (= |c_ULTIMATE.start_dll_append_#t~ret7#1.base| .cse8)) (or .cse4 (= |c_ULTIMATE.start_dll_append_#t~ret7#1.base| .cse5) (= (select (select |c_#memory_int#2| .cse5) 0) 1)) (not (= .cse2 .cse8)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int#2| .cse8) 0)) (= .cse9 .cse7) (exists ((|v_#valid_BEFORE_CALL_14| (Array Int Int)) (v_arrayElimCell_58 Int) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7| Int) (|v_#valid_BEFORE_CALL_15| (Array Int Int))) (let ((.cse10 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0) 0) (= (select |v_#valid_BEFORE_CALL_15| .cse10) 1) (= (let ((.cse11 (@diff |v_#valid_BEFORE_CALL_14| |v_#valid_BEFORE_CALL_15|))) (store |v_#valid_BEFORE_CALL_14| .cse11 (select |v_#valid_BEFORE_CALL_15| .cse11))) |v_#valid_BEFORE_CALL_15|) (= (select |v_#valid_BEFORE_CALL_14| .cse10) 0) (= (select |v_#valid_BEFORE_CALL_14| v_arrayElimCell_58) 1)))) (= (select .cse1 0) 0) (= |c_ULTIMATE.start_dll_append_~head#1.offset| 0) (not (= |c_ULTIMATE.start_dll_append_#t~ret7#1.base| .cse2)) (= (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)))))) is different from true [2024-10-11 01:44:18,199 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse7 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse9 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_append_~head#1.base|)) (.cse5 (select .cse7 0))) (let ((.cse4 (select (select |c_#memory_$Pointer$#2.base| .cse5) 4)) (.cse2 (select .cse9 |c_ULTIMATE.start_dll_append_~head#1.offset|))) (let ((.cse0 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_append_~head#1.base|)) (.cse8 (select (select |c_#memory_$Pointer$#2.base| .cse2) 4)) (.cse3 (= .cse4 .cse5)) (.cse1 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|))) (and (= |c_ULTIMATE.start_dll_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= .cse0 .cse1) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select .cse0 |c_ULTIMATE.start_dll_append_~head#1.offset|) 0) (not (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| .cse2)) (or .cse3 (= .cse4 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) (= (select (select |c_#memory_int#2| .cse4) 0) 1)) (= (select (select |c_#memory_$Pointer$#2.offset| .cse2) 4) 0) (exists ((|v_#valid_BEFORE_CALL_16| (Array Int Int)) (|v_#valid_BEFORE_CALL_17| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_17| .cse5) 0) (= (select |v_#valid_BEFORE_CALL_17| .cse4) 1) (= (select |v_#valid_BEFORE_CALL_16| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_16| .cse5) 1) (= |v_#valid_BEFORE_CALL_16| (let ((.cse6 (@diff |v_#valid_BEFORE_CALL_17| |v_#valid_BEFORE_CALL_16|))) (store |v_#valid_BEFORE_CALL_17| .cse6 (select |v_#valid_BEFORE_CALL_16| .cse6)))))) (= (select .cse7 |c_ULTIMATE.start_main_~#s~0#1.offset|) .cse2) (= |c_ULTIMATE.start_main_~data~0#1| 1) (not (= .cse2 .cse8)) (not (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| .cse8)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int#2| .cse8) 0)) (= .cse9 .cse7) (exists ((|v_#valid_BEFORE_CALL_14| (Array Int Int)) (v_arrayElimCell_58 Int) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7| Int) (|v_#valid_BEFORE_CALL_15| (Array Int Int))) (let ((.cse10 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0) 0) (= (select |v_#valid_BEFORE_CALL_15| .cse10) 1) (= (let ((.cse11 (@diff |v_#valid_BEFORE_CALL_14| |v_#valid_BEFORE_CALL_15|))) (store |v_#valid_BEFORE_CALL_14| .cse11 (select |v_#valid_BEFORE_CALL_15| .cse11))) |v_#valid_BEFORE_CALL_15|) (= (select |v_#valid_BEFORE_CALL_14| .cse10) 0) (= (select |v_#valid_BEFORE_CALL_14| v_arrayElimCell_58) 1)))) (or .cse3 (= (select (select |c_#memory_$Pointer$#2.offset| .cse5) 4) 0) (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| .cse5)) (= (select .cse1 0) 0) (= |c_ULTIMATE.start_dll_append_~head#1.offset| 0) (= (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)))))) is different from false [2024-10-11 01:44:18,202 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse7 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse9 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_append_~head#1.base|)) (.cse5 (select .cse7 0))) (let ((.cse4 (select (select |c_#memory_$Pointer$#2.base| .cse5) 4)) (.cse2 (select .cse9 |c_ULTIMATE.start_dll_append_~head#1.offset|))) (let ((.cse0 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_append_~head#1.base|)) (.cse8 (select (select |c_#memory_$Pointer$#2.base| .cse2) 4)) (.cse3 (= .cse4 .cse5)) (.cse1 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|))) (and (= |c_ULTIMATE.start_dll_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= .cse0 .cse1) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select .cse0 |c_ULTIMATE.start_dll_append_~head#1.offset|) 0) (not (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| .cse2)) (or .cse3 (= .cse4 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) (= (select (select |c_#memory_int#2| .cse4) 0) 1)) (= (select (select |c_#memory_$Pointer$#2.offset| .cse2) 4) 0) (exists ((|v_#valid_BEFORE_CALL_16| (Array Int Int)) (|v_#valid_BEFORE_CALL_17| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_17| .cse5) 0) (= (select |v_#valid_BEFORE_CALL_17| .cse4) 1) (= (select |v_#valid_BEFORE_CALL_16| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_16| .cse5) 1) (= |v_#valid_BEFORE_CALL_16| (let ((.cse6 (@diff |v_#valid_BEFORE_CALL_17| |v_#valid_BEFORE_CALL_16|))) (store |v_#valid_BEFORE_CALL_17| .cse6 (select |v_#valid_BEFORE_CALL_16| .cse6)))))) (= (select .cse7 |c_ULTIMATE.start_main_~#s~0#1.offset|) .cse2) (= |c_ULTIMATE.start_main_~data~0#1| 1) (not (= .cse2 .cse8)) (not (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| .cse8)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int#2| .cse8) 0)) (= .cse9 .cse7) (exists ((|v_#valid_BEFORE_CALL_14| (Array Int Int)) (v_arrayElimCell_58 Int) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7| Int) (|v_#valid_BEFORE_CALL_15| (Array Int Int))) (let ((.cse10 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0) 0) (= (select |v_#valid_BEFORE_CALL_15| .cse10) 1) (= (let ((.cse11 (@diff |v_#valid_BEFORE_CALL_14| |v_#valid_BEFORE_CALL_15|))) (store |v_#valid_BEFORE_CALL_14| .cse11 (select |v_#valid_BEFORE_CALL_15| .cse11))) |v_#valid_BEFORE_CALL_15|) (= (select |v_#valid_BEFORE_CALL_14| .cse10) 0) (= (select |v_#valid_BEFORE_CALL_14| v_arrayElimCell_58) 1)))) (or .cse3 (= (select (select |c_#memory_$Pointer$#2.offset| .cse5) 4) 0) (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| .cse5)) (= (select .cse1 0) 0) (= |c_ULTIMATE.start_dll_append_~head#1.offset| 0) (= (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)))))) is different from true [2024-10-11 01:44:18,210 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse3 (select .cse5 0))) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| .cse3) 4))) (let ((.cse1 (= .cse2 .cse3)) (.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_append_~last~0#1.base|) 4)) (.cse8 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|))) (and (not (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| .cse0)) (not (= |c_ULTIMATE.start_dll_append_~last~0#1.base| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (or .cse1 (= .cse2 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) (= (select (select |c_#memory_int#2| .cse2) 0) 1)) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse3) (exists ((|v_#valid_BEFORE_CALL_16| (Array Int Int)) (|v_#valid_BEFORE_CALL_17| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_17| .cse3) 0) (= (select |v_#valid_BEFORE_CALL_17| .cse2) 1) (= (select |v_#valid_BEFORE_CALL_16| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_16| .cse3) 1) (= |v_#valid_BEFORE_CALL_16| (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_17| |v_#valid_BEFORE_CALL_16|))) (store |v_#valid_BEFORE_CALL_17| .cse4 (select |v_#valid_BEFORE_CALL_16| .cse4)))))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int#2| .cse0) 0)) (= |c_ULTIMATE.start_dll_append_~last~0#1.offset| 0) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| (select .cse5 |c_ULTIMATE.start_main_~#s~0#1.offset|)) (exists ((|v_#valid_BEFORE_CALL_14| (Array Int Int)) (v_arrayElimCell_58 Int) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7| Int) (|v_#valid_BEFORE_CALL_15| (Array Int Int))) (let ((.cse6 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0) 0) (= (select |v_#valid_BEFORE_CALL_15| .cse6) 1) (= (let ((.cse7 (@diff |v_#valid_BEFORE_CALL_14| |v_#valid_BEFORE_CALL_15|))) (store |v_#valid_BEFORE_CALL_14| .cse7 (select |v_#valid_BEFORE_CALL_15| .cse7))) |v_#valid_BEFORE_CALL_15|) (= (select |v_#valid_BEFORE_CALL_14| .cse6) 0) (= (select |v_#valid_BEFORE_CALL_14| v_arrayElimCell_58) 1)))) (or .cse1 (= (select (select |c_#memory_$Pointer$#2.offset| .cse3) 4) 0) (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| .cse3)) (not (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse0)) (= (select .cse8 0) 0) (= 0 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base|) 4)) (= (select .cse8 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)))))) is different from false [2024-10-11 01:44:18,213 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse3 (select .cse5 0))) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| .cse3) 4))) (let ((.cse1 (= .cse2 .cse3)) (.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_append_~last~0#1.base|) 4)) (.cse8 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|))) (and (not (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| .cse0)) (not (= |c_ULTIMATE.start_dll_append_~last~0#1.base| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (or .cse1 (= .cse2 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) (= (select (select |c_#memory_int#2| .cse2) 0) 1)) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse3) (exists ((|v_#valid_BEFORE_CALL_16| (Array Int Int)) (|v_#valid_BEFORE_CALL_17| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_17| .cse3) 0) (= (select |v_#valid_BEFORE_CALL_17| .cse2) 1) (= (select |v_#valid_BEFORE_CALL_16| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_16| .cse3) 1) (= |v_#valid_BEFORE_CALL_16| (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_17| |v_#valid_BEFORE_CALL_16|))) (store |v_#valid_BEFORE_CALL_17| .cse4 (select |v_#valid_BEFORE_CALL_16| .cse4)))))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int#2| .cse0) 0)) (= |c_ULTIMATE.start_dll_append_~last~0#1.offset| 0) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| (select .cse5 |c_ULTIMATE.start_main_~#s~0#1.offset|)) (exists ((|v_#valid_BEFORE_CALL_14| (Array Int Int)) (v_arrayElimCell_58 Int) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7| Int) (|v_#valid_BEFORE_CALL_15| (Array Int Int))) (let ((.cse6 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0) 0) (= (select |v_#valid_BEFORE_CALL_15| .cse6) 1) (= (let ((.cse7 (@diff |v_#valid_BEFORE_CALL_14| |v_#valid_BEFORE_CALL_15|))) (store |v_#valid_BEFORE_CALL_14| .cse7 (select |v_#valid_BEFORE_CALL_15| .cse7))) |v_#valid_BEFORE_CALL_15|) (= (select |v_#valid_BEFORE_CALL_14| .cse6) 0) (= (select |v_#valid_BEFORE_CALL_14| v_arrayElimCell_58) 1)))) (or .cse1 (= (select (select |c_#memory_$Pointer$#2.offset| .cse3) 4) 0) (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| .cse3)) (not (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse0)) (= (select .cse8 0) 0) (= 0 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base|) 4)) (= (select .cse8 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)))))) is different from true [2024-10-11 01:44:18,222 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse3 (select .cse5 0))) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| .cse3) 4))) (let ((.cse1 (= .cse2 .cse3)) (.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_append_~last~0#1.base|) 4)) (.cse8 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|))) (and (not (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| .cse0)) (not (= |c_ULTIMATE.start_dll_append_~last~0#1.base| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (or .cse1 (= .cse2 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) (= (select (select |c_#memory_int#2| .cse2) 0) 1)) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse3) (exists ((|v_#valid_BEFORE_CALL_16| (Array Int Int)) (|v_#valid_BEFORE_CALL_17| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_17| .cse3) 0) (= (select |v_#valid_BEFORE_CALL_17| .cse2) 1) (= (select |v_#valid_BEFORE_CALL_16| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_16| .cse3) 1) (= |v_#valid_BEFORE_CALL_16| (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_17| |v_#valid_BEFORE_CALL_16|))) (store |v_#valid_BEFORE_CALL_17| .cse4 (select |v_#valid_BEFORE_CALL_16| .cse4)))))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int#2| .cse0) 0)) (= |c_ULTIMATE.start_dll_append_~last~0#1.offset| 0) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| (select .cse5 |c_ULTIMATE.start_main_~#s~0#1.offset|)) (exists ((|v_#valid_BEFORE_CALL_14| (Array Int Int)) (v_arrayElimCell_58 Int) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7| Int) (|v_#valid_BEFORE_CALL_15| (Array Int Int))) (let ((.cse6 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0) 0) (= (select |v_#valid_BEFORE_CALL_15| .cse6) 1) (= (let ((.cse7 (@diff |v_#valid_BEFORE_CALL_14| |v_#valid_BEFORE_CALL_15|))) (store |v_#valid_BEFORE_CALL_14| .cse7 (select |v_#valid_BEFORE_CALL_15| .cse7))) |v_#valid_BEFORE_CALL_15|) (= (select |v_#valid_BEFORE_CALL_14| .cse6) 0) (= (select |v_#valid_BEFORE_CALL_14| v_arrayElimCell_58) 1)))) (or .cse1 (= (select (select |c_#memory_$Pointer$#2.offset| .cse3) 4) 0) (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| .cse3)) (not (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse0)) (= (select .cse8 0) 0) (= |c_ULTIMATE.start_dll_append_#t~mem10#1.offset| 0) (= 0 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base|) 4)) (= (select .cse8 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)))))) is different from false [2024-10-11 01:44:18,224 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse3 (select .cse5 0))) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| .cse3) 4))) (let ((.cse1 (= .cse2 .cse3)) (.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_append_~last~0#1.base|) 4)) (.cse8 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|))) (and (not (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| .cse0)) (not (= |c_ULTIMATE.start_dll_append_~last~0#1.base| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (or .cse1 (= .cse2 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) (= (select (select |c_#memory_int#2| .cse2) 0) 1)) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse3) (exists ((|v_#valid_BEFORE_CALL_16| (Array Int Int)) (|v_#valid_BEFORE_CALL_17| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_17| .cse3) 0) (= (select |v_#valid_BEFORE_CALL_17| .cse2) 1) (= (select |v_#valid_BEFORE_CALL_16| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_16| .cse3) 1) (= |v_#valid_BEFORE_CALL_16| (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_17| |v_#valid_BEFORE_CALL_16|))) (store |v_#valid_BEFORE_CALL_17| .cse4 (select |v_#valid_BEFORE_CALL_16| .cse4)))))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int#2| .cse0) 0)) (= |c_ULTIMATE.start_dll_append_~last~0#1.offset| 0) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| (select .cse5 |c_ULTIMATE.start_main_~#s~0#1.offset|)) (exists ((|v_#valid_BEFORE_CALL_14| (Array Int Int)) (v_arrayElimCell_58 Int) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7| Int) (|v_#valid_BEFORE_CALL_15| (Array Int Int))) (let ((.cse6 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0) 0) (= (select |v_#valid_BEFORE_CALL_15| .cse6) 1) (= (let ((.cse7 (@diff |v_#valid_BEFORE_CALL_14| |v_#valid_BEFORE_CALL_15|))) (store |v_#valid_BEFORE_CALL_14| .cse7 (select |v_#valid_BEFORE_CALL_15| .cse7))) |v_#valid_BEFORE_CALL_15|) (= (select |v_#valid_BEFORE_CALL_14| .cse6) 0) (= (select |v_#valid_BEFORE_CALL_14| v_arrayElimCell_58) 1)))) (or .cse1 (= (select (select |c_#memory_$Pointer$#2.offset| .cse3) 4) 0) (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| .cse3)) (not (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse0)) (= (select .cse8 0) 0) (= |c_ULTIMATE.start_dll_append_#t~mem10#1.offset| 0) (= 0 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base|) 4)) (= (select .cse8 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)))))) is different from true [2024-10-11 01:44:18,231 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse10 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse3 (select .cse10 0))) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| .cse3) 4)) (.cse5 (select .cse10 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.offset| .cse5) 4)) (.cse1 (= .cse2 .cse3)) (.cse8 (select (select |c_#memory_$Pointer$#2.offset| .cse3) 4)) (.cse9 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|))) (and (not (= |c_ULTIMATE.start_dll_append_~last~0#1.base| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int#2| |c_ULTIMATE.start_dll_append_~last~0#1.base|) .cse0)) (or .cse1 (= .cse2 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) (= (select (select |c_#memory_int#2| .cse2) 0) 1)) (exists ((|v_#valid_BEFORE_CALL_16| (Array Int Int)) (|v_#valid_BEFORE_CALL_17| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_17| .cse3) 0) (= (select |v_#valid_BEFORE_CALL_17| .cse2) 1) (= (select |v_#valid_BEFORE_CALL_16| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_16| .cse3) 1) (= |v_#valid_BEFORE_CALL_16| (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_17| |v_#valid_BEFORE_CALL_16|))) (store |v_#valid_BEFORE_CALL_17| .cse4 (select |v_#valid_BEFORE_CALL_16| .cse4)))))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (not (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse5)) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| (select (select |c_#memory_$Pointer$#2.base| .cse5) 4)) (exists ((|v_#valid_BEFORE_CALL_14| (Array Int Int)) (v_arrayElimCell_58 Int) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7| Int) (|v_#valid_BEFORE_CALL_15| (Array Int Int))) (let ((.cse6 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0) 0) (= (select |v_#valid_BEFORE_CALL_15| .cse6) 1) (= (let ((.cse7 (@diff |v_#valid_BEFORE_CALL_14| |v_#valid_BEFORE_CALL_15|))) (store |v_#valid_BEFORE_CALL_14| .cse7 (select |v_#valid_BEFORE_CALL_15| .cse7))) |v_#valid_BEFORE_CALL_15|) (= (select |v_#valid_BEFORE_CALL_14| .cse6) 0) (= (select |v_#valid_BEFORE_CALL_14| v_arrayElimCell_58) 1)))) (not (= .cse0 (+ |c_ULTIMATE.start_dll_append_~last~0#1.offset| 4))) (= .cse8 |c_ULTIMATE.start_dll_append_~last~0#1.offset|) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse2) (or .cse1 (= .cse8 0) (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| .cse3)) (not (= .cse5 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) (= (select .cse9 0) 0) (= (select .cse9 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)))))) is different from false [2024-10-11 01:44:18,234 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse10 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse3 (select .cse10 0))) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| .cse3) 4)) (.cse5 (select .cse10 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.offset| .cse5) 4)) (.cse1 (= .cse2 .cse3)) (.cse8 (select (select |c_#memory_$Pointer$#2.offset| .cse3) 4)) (.cse9 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|))) (and (not (= |c_ULTIMATE.start_dll_append_~last~0#1.base| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int#2| |c_ULTIMATE.start_dll_append_~last~0#1.base|) .cse0)) (or .cse1 (= .cse2 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) (= (select (select |c_#memory_int#2| .cse2) 0) 1)) (exists ((|v_#valid_BEFORE_CALL_16| (Array Int Int)) (|v_#valid_BEFORE_CALL_17| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_17| .cse3) 0) (= (select |v_#valid_BEFORE_CALL_17| .cse2) 1) (= (select |v_#valid_BEFORE_CALL_16| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_16| .cse3) 1) (= |v_#valid_BEFORE_CALL_16| (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_17| |v_#valid_BEFORE_CALL_16|))) (store |v_#valid_BEFORE_CALL_17| .cse4 (select |v_#valid_BEFORE_CALL_16| .cse4)))))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (not (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse5)) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| (select (select |c_#memory_$Pointer$#2.base| .cse5) 4)) (exists ((|v_#valid_BEFORE_CALL_14| (Array Int Int)) (v_arrayElimCell_58 Int) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7| Int) (|v_#valid_BEFORE_CALL_15| (Array Int Int))) (let ((.cse6 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0) 0) (= (select |v_#valid_BEFORE_CALL_15| .cse6) 1) (= (let ((.cse7 (@diff |v_#valid_BEFORE_CALL_14| |v_#valid_BEFORE_CALL_15|))) (store |v_#valid_BEFORE_CALL_14| .cse7 (select |v_#valid_BEFORE_CALL_15| .cse7))) |v_#valid_BEFORE_CALL_15|) (= (select |v_#valid_BEFORE_CALL_14| .cse6) 0) (= (select |v_#valid_BEFORE_CALL_14| v_arrayElimCell_58) 1)))) (not (= .cse0 (+ |c_ULTIMATE.start_dll_append_~last~0#1.offset| 4))) (= .cse8 |c_ULTIMATE.start_dll_append_~last~0#1.offset|) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse2) (or .cse1 (= .cse8 0) (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| .cse3)) (not (= .cse5 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) (= (select .cse9 0) 0) (= (select .cse9 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)))))) is different from true [2024-10-11 01:44:18,242 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse11 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse3 (select .cse11 0))) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| .cse3) 4)) (.cse5 (select .cse11 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.offset| .cse5) 4)) (.cse1 (= .cse2 .cse3)) (.cse9 (select (select |c_#memory_$Pointer$#2.offset| .cse3) 4)) (.cse8 (+ |c_ULTIMATE.start_dll_append_~last~0#1.offset| 4)) (.cse10 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|))) (and (not (= |c_ULTIMATE.start_dll_append_~last~0#1.base| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int#2| |c_ULTIMATE.start_dll_append_~last~0#1.base|) .cse0)) (or .cse1 (= .cse2 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) (= (select (select |c_#memory_int#2| .cse2) 0) 1)) (exists ((|v_#valid_BEFORE_CALL_16| (Array Int Int)) (|v_#valid_BEFORE_CALL_17| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_17| .cse3) 0) (= (select |v_#valid_BEFORE_CALL_17| .cse2) 1) (= (select |v_#valid_BEFORE_CALL_16| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_16| .cse3) 1) (= |v_#valid_BEFORE_CALL_16| (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_17| |v_#valid_BEFORE_CALL_16|))) (store |v_#valid_BEFORE_CALL_17| .cse4 (select |v_#valid_BEFORE_CALL_16| .cse4)))))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (not (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse5)) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| (select (select |c_#memory_$Pointer$#2.base| .cse5) 4)) (exists ((|v_#valid_BEFORE_CALL_14| (Array Int Int)) (v_arrayElimCell_58 Int) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7| Int) (|v_#valid_BEFORE_CALL_15| (Array Int Int))) (let ((.cse6 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0) 0) (= (select |v_#valid_BEFORE_CALL_15| .cse6) 1) (= (let ((.cse7 (@diff |v_#valid_BEFORE_CALL_14| |v_#valid_BEFORE_CALL_15|))) (store |v_#valid_BEFORE_CALL_14| .cse7 (select |v_#valid_BEFORE_CALL_15| .cse7))) |v_#valid_BEFORE_CALL_15|) (= (select |v_#valid_BEFORE_CALL_14| .cse6) 0) (= (select |v_#valid_BEFORE_CALL_14| v_arrayElimCell_58) 1)))) (not (= .cse0 .cse8)) (= .cse9 |c_ULTIMATE.start_dll_append_~last~0#1.offset|) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse2) (or .cse1 (= .cse9 0) (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| .cse3)) (not (= .cse5 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) (= (select .cse10 0) 0) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base|) .cse8) |c_ULTIMATE.start_dll_append_#t~mem10#1.offset|) (= (select .cse10 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)))))) is different from false [2024-10-11 01:44:18,244 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse11 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse3 (select .cse11 0))) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| .cse3) 4)) (.cse5 (select .cse11 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.offset| .cse5) 4)) (.cse1 (= .cse2 .cse3)) (.cse9 (select (select |c_#memory_$Pointer$#2.offset| .cse3) 4)) (.cse8 (+ |c_ULTIMATE.start_dll_append_~last~0#1.offset| 4)) (.cse10 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|))) (and (not (= |c_ULTIMATE.start_dll_append_~last~0#1.base| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int#2| |c_ULTIMATE.start_dll_append_~last~0#1.base|) .cse0)) (or .cse1 (= .cse2 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) (= (select (select |c_#memory_int#2| .cse2) 0) 1)) (exists ((|v_#valid_BEFORE_CALL_16| (Array Int Int)) (|v_#valid_BEFORE_CALL_17| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_17| .cse3) 0) (= (select |v_#valid_BEFORE_CALL_17| .cse2) 1) (= (select |v_#valid_BEFORE_CALL_16| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_16| .cse3) 1) (= |v_#valid_BEFORE_CALL_16| (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_17| |v_#valid_BEFORE_CALL_16|))) (store |v_#valid_BEFORE_CALL_17| .cse4 (select |v_#valid_BEFORE_CALL_16| .cse4)))))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (not (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse5)) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| (select (select |c_#memory_$Pointer$#2.base| .cse5) 4)) (exists ((|v_#valid_BEFORE_CALL_14| (Array Int Int)) (v_arrayElimCell_58 Int) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7| Int) (|v_#valid_BEFORE_CALL_15| (Array Int Int))) (let ((.cse6 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0) 0) (= (select |v_#valid_BEFORE_CALL_15| .cse6) 1) (= (let ((.cse7 (@diff |v_#valid_BEFORE_CALL_14| |v_#valid_BEFORE_CALL_15|))) (store |v_#valid_BEFORE_CALL_14| .cse7 (select |v_#valid_BEFORE_CALL_15| .cse7))) |v_#valid_BEFORE_CALL_15|) (= (select |v_#valid_BEFORE_CALL_14| .cse6) 0) (= (select |v_#valid_BEFORE_CALL_14| v_arrayElimCell_58) 1)))) (not (= .cse0 .cse8)) (= .cse9 |c_ULTIMATE.start_dll_append_~last~0#1.offset|) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse2) (or .cse1 (= .cse9 0) (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| .cse3)) (not (= .cse5 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) (= (select .cse10 0) 0) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base|) .cse8) |c_ULTIMATE.start_dll_append_#t~mem10#1.offset|) (= (select .cse10 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)))))) is different from true [2024-10-11 01:44:18,253 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse11 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse3 (select .cse11 0))) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| .cse3) 4)) (.cse6 (select .cse11 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.offset| .cse6) 4)) (.cse5 (+ |c_ULTIMATE.start_dll_append_~last~0#1.offset| 4)) (.cse1 (= .cse2 .cse3)) (.cse9 (select (select |c_#memory_$Pointer$#2.offset| .cse3) 4)) (.cse10 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|))) (and (not (= |c_ULTIMATE.start_dll_append_~last~0#1.base| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int#2| |c_ULTIMATE.start_dll_append_~last~0#1.base|) .cse0)) (or .cse1 (= .cse2 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) (= (select (select |c_#memory_int#2| .cse2) 0) 1)) (exists ((|v_#valid_BEFORE_CALL_16| (Array Int Int)) (|v_#valid_BEFORE_CALL_17| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_17| .cse3) 0) (= (select |v_#valid_BEFORE_CALL_17| .cse2) 1) (= (select |v_#valid_BEFORE_CALL_16| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_16| .cse3) 1) (= |v_#valid_BEFORE_CALL_16| (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_17| |v_#valid_BEFORE_CALL_16|))) (store |v_#valid_BEFORE_CALL_17| .cse4 (select |v_#valid_BEFORE_CALL_16| .cse4)))))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base|) .cse5) 0) (not (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse6)) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| (select (select |c_#memory_$Pointer$#2.base| .cse6) 4)) (exists ((|v_#valid_BEFORE_CALL_14| (Array Int Int)) (v_arrayElimCell_58 Int) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7| Int) (|v_#valid_BEFORE_CALL_15| (Array Int Int))) (let ((.cse7 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0) 0) (= (select |v_#valid_BEFORE_CALL_15| .cse7) 1) (= (let ((.cse8 (@diff |v_#valid_BEFORE_CALL_14| |v_#valid_BEFORE_CALL_15|))) (store |v_#valid_BEFORE_CALL_14| .cse8 (select |v_#valid_BEFORE_CALL_15| .cse8))) |v_#valid_BEFORE_CALL_15|) (= (select |v_#valid_BEFORE_CALL_14| .cse7) 0) (= (select |v_#valid_BEFORE_CALL_14| v_arrayElimCell_58) 1)))) (not (= .cse0 .cse5)) (= .cse9 |c_ULTIMATE.start_dll_append_~last~0#1.offset|) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse2) (or .cse1 (= .cse9 0) (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| .cse3)) (not (= .cse6 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) (= (select .cse10 0) 0) (= (select .cse10 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)))))) is different from false [2024-10-11 01:44:18,256 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse11 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse3 (select .cse11 0))) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| .cse3) 4)) (.cse6 (select .cse11 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.offset| .cse6) 4)) (.cse5 (+ |c_ULTIMATE.start_dll_append_~last~0#1.offset| 4)) (.cse1 (= .cse2 .cse3)) (.cse9 (select (select |c_#memory_$Pointer$#2.offset| .cse3) 4)) (.cse10 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|))) (and (not (= |c_ULTIMATE.start_dll_append_~last~0#1.base| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int#2| |c_ULTIMATE.start_dll_append_~last~0#1.base|) .cse0)) (or .cse1 (= .cse2 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) (= (select (select |c_#memory_int#2| .cse2) 0) 1)) (exists ((|v_#valid_BEFORE_CALL_16| (Array Int Int)) (|v_#valid_BEFORE_CALL_17| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_17| .cse3) 0) (= (select |v_#valid_BEFORE_CALL_17| .cse2) 1) (= (select |v_#valid_BEFORE_CALL_16| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_16| .cse3) 1) (= |v_#valid_BEFORE_CALL_16| (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_17| |v_#valid_BEFORE_CALL_16|))) (store |v_#valid_BEFORE_CALL_17| .cse4 (select |v_#valid_BEFORE_CALL_16| .cse4)))))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base|) .cse5) 0) (not (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse6)) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| (select (select |c_#memory_$Pointer$#2.base| .cse6) 4)) (exists ((|v_#valid_BEFORE_CALL_14| (Array Int Int)) (v_arrayElimCell_58 Int) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7| Int) (|v_#valid_BEFORE_CALL_15| (Array Int Int))) (let ((.cse7 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0) 0) (= (select |v_#valid_BEFORE_CALL_15| .cse7) 1) (= (let ((.cse8 (@diff |v_#valid_BEFORE_CALL_14| |v_#valid_BEFORE_CALL_15|))) (store |v_#valid_BEFORE_CALL_14| .cse8 (select |v_#valid_BEFORE_CALL_15| .cse8))) |v_#valid_BEFORE_CALL_15|) (= (select |v_#valid_BEFORE_CALL_14| .cse7) 0) (= (select |v_#valid_BEFORE_CALL_14| v_arrayElimCell_58) 1)))) (not (= .cse0 .cse5)) (= .cse9 |c_ULTIMATE.start_dll_append_~last~0#1.offset|) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse2) (or .cse1 (= .cse9 0) (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| .cse3)) (not (= .cse6 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) (= (select .cse10 0) 0) (= (select .cse10 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)))))) is different from true [2024-10-11 01:44:18,263 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse3 (select .cse1 0))) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| .cse3) 4)) (.cse7 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|))) (and (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse0 (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select |c_#memory_int#2| (select (select |c_#memory_$Pointer$#2.base| .cse0) 4)) (select (select |c_#memory_$Pointer$#2.offset| .cse0) 4)))) (or (= .cse2 .cse3) (= (select (select |c_#memory_int#2| .cse2) 0) 1)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse3) 4) 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_ULTIMATE.start_dll_append_~new_last~0#1.base_28| Int) (|v_#valid_BEFORE_CALL_16| (Array Int Int)) (|v_#valid_BEFORE_CALL_17| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_17| .cse3) 0) (= (select |v_#valid_BEFORE_CALL_17| .cse2) 1) (= (select |v_#valid_BEFORE_CALL_16| .cse3) 1) (= 0 (select |v_#valid_BEFORE_CALL_16| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_28|)) (= |v_#valid_BEFORE_CALL_16| (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_17| |v_#valid_BEFORE_CALL_16|))) (store |v_#valid_BEFORE_CALL_17| .cse4 (select |v_#valid_BEFORE_CALL_16| .cse4)))))) (exists ((|v_#valid_BEFORE_CALL_14| (Array Int Int)) (v_arrayElimCell_58 Int) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7| Int) (|v_#valid_BEFORE_CALL_15| (Array Int Int))) (let ((.cse5 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0) 0) (= (select |v_#valid_BEFORE_CALL_15| .cse5) 1) (= (let ((.cse6 (@diff |v_#valid_BEFORE_CALL_14| |v_#valid_BEFORE_CALL_15|))) (store |v_#valid_BEFORE_CALL_14| .cse6 (select |v_#valid_BEFORE_CALL_15| .cse6))) |v_#valid_BEFORE_CALL_15|) (= (select |v_#valid_BEFORE_CALL_14| .cse5) 0) (= (select |v_#valid_BEFORE_CALL_14| v_arrayElimCell_58) 1)))) (= (select .cse7 0) 0) (= (select .cse7 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0))))) is different from false [2024-10-11 01:44:18,265 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse3 (select .cse1 0))) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| .cse3) 4)) (.cse7 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|))) (and (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse0 (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select |c_#memory_int#2| (select (select |c_#memory_$Pointer$#2.base| .cse0) 4)) (select (select |c_#memory_$Pointer$#2.offset| .cse0) 4)))) (or (= .cse2 .cse3) (= (select (select |c_#memory_int#2| .cse2) 0) 1)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse3) 4) 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_ULTIMATE.start_dll_append_~new_last~0#1.base_28| Int) (|v_#valid_BEFORE_CALL_16| (Array Int Int)) (|v_#valid_BEFORE_CALL_17| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_17| .cse3) 0) (= (select |v_#valid_BEFORE_CALL_17| .cse2) 1) (= (select |v_#valid_BEFORE_CALL_16| .cse3) 1) (= 0 (select |v_#valid_BEFORE_CALL_16| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_28|)) (= |v_#valid_BEFORE_CALL_16| (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_17| |v_#valid_BEFORE_CALL_16|))) (store |v_#valid_BEFORE_CALL_17| .cse4 (select |v_#valid_BEFORE_CALL_16| .cse4)))))) (exists ((|v_#valid_BEFORE_CALL_14| (Array Int Int)) (v_arrayElimCell_58 Int) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7| Int) (|v_#valid_BEFORE_CALL_15| (Array Int Int))) (let ((.cse5 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0) 0) (= (select |v_#valid_BEFORE_CALL_15| .cse5) 1) (= (let ((.cse6 (@diff |v_#valid_BEFORE_CALL_14| |v_#valid_BEFORE_CALL_15|))) (store |v_#valid_BEFORE_CALL_14| .cse6 (select |v_#valid_BEFORE_CALL_15| .cse6))) |v_#valid_BEFORE_CALL_15|) (= (select |v_#valid_BEFORE_CALL_14| .cse5) 0) (= (select |v_#valid_BEFORE_CALL_14| v_arrayElimCell_58) 1)))) (= (select .cse7 0) 0) (= (select .cse7 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0))))) is different from true [2024-10-11 01:44:18,273 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~ptr~0#1.base|) 4))) (let ((.cse0 (select |c_#memory_int#2| .cse2)) (.cse1 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~ptr~0#1.base|) 4))) (and (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse0 .cse1)) (exists ((|v_ULTIMATE.start_dll_append_~new_last~0#1.base_28| Int) (|v_#valid_BEFORE_CALL_16| (Array Int Int)) (|v_#valid_BEFORE_CALL_17| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_16| |c_ULTIMATE.start_main_~ptr~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_17| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= 0 (select |v_#valid_BEFORE_CALL_16| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_28|)) (= (select |v_#valid_BEFORE_CALL_17| .cse2) 1) (= |v_#valid_BEFORE_CALL_16| (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_17| |v_#valid_BEFORE_CALL_16|))) (store |v_#valid_BEFORE_CALL_17| .cse3 (select |v_#valid_BEFORE_CALL_16| .cse3)))))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (or (= (select .cse0 0) 1) (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse2)) (= .cse1 0)))) is different from false [2024-10-11 01:44:18,274 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~ptr~0#1.base|) 4))) (let ((.cse0 (select |c_#memory_int#2| .cse2)) (.cse1 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~ptr~0#1.base|) 4))) (and (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse0 .cse1)) (exists ((|v_ULTIMATE.start_dll_append_~new_last~0#1.base_28| Int) (|v_#valid_BEFORE_CALL_16| (Array Int Int)) (|v_#valid_BEFORE_CALL_17| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_16| |c_ULTIMATE.start_main_~ptr~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_17| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= 0 (select |v_#valid_BEFORE_CALL_16| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_28|)) (= (select |v_#valid_BEFORE_CALL_17| .cse2) 1) (= |v_#valid_BEFORE_CALL_16| (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_17| |v_#valid_BEFORE_CALL_16|))) (store |v_#valid_BEFORE_CALL_17| .cse3 (select |v_#valid_BEFORE_CALL_16| .cse3)))))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (or (= (select .cse0 0) 1) (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse2)) (= .cse1 0)))) is different from true [2024-10-11 01:44:18,296 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int#2| |c_ULTIMATE.start_main_~ptr~0#1.base|))) (and (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse0 |c_ULTIMATE.start_main_~ptr~0#1.offset|)) (exists ((|v_ULTIMATE.start_dll_append_~new_last~0#1.base_28| Int) (|v_#valid_BEFORE_CALL_16| (Array Int Int)) (|v_#valid_BEFORE_CALL_17| (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.base_24| Int)) (and (= (select |v_#valid_BEFORE_CALL_17| |c_ULTIMATE.start_main_~ptr~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_16| |v_ULTIMATE.start_main_~ptr~0#1.base_24|) 1) (= (select |v_#valid_BEFORE_CALL_17| |v_ULTIMATE.start_main_~ptr~0#1.base_24|) 0) (= 0 (select |v_#valid_BEFORE_CALL_16| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_28|)) (= |v_#valid_BEFORE_CALL_16| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_17| |v_#valid_BEFORE_CALL_16|))) (store |v_#valid_BEFORE_CALL_17| .cse1 (select |v_#valid_BEFORE_CALL_16| .cse1)))))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= (select .cse0 0) 1))) is different from false [2024-10-11 01:44:18,297 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int#2| |c_ULTIMATE.start_main_~ptr~0#1.base|))) (and (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse0 |c_ULTIMATE.start_main_~ptr~0#1.offset|)) (exists ((|v_ULTIMATE.start_dll_append_~new_last~0#1.base_28| Int) (|v_#valid_BEFORE_CALL_16| (Array Int Int)) (|v_#valid_BEFORE_CALL_17| (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.base_24| Int)) (and (= (select |v_#valid_BEFORE_CALL_17| |c_ULTIMATE.start_main_~ptr~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_16| |v_ULTIMATE.start_main_~ptr~0#1.base_24|) 1) (= (select |v_#valid_BEFORE_CALL_17| |v_ULTIMATE.start_main_~ptr~0#1.base_24|) 0) (= 0 (select |v_#valid_BEFORE_CALL_16| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_28|)) (= |v_#valid_BEFORE_CALL_16| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_17| |v_#valid_BEFORE_CALL_16|))) (store |v_#valid_BEFORE_CALL_17| .cse1 (select |v_#valid_BEFORE_CALL_16| .cse1)))))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= (select .cse0 0) 1))) is different from true [2024-10-11 01:44:18,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 01:44:18,367 INFO L93 Difference]: Finished difference Result 66 states and 75 transitions. [2024-10-11 01:44:18,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-10-11 01:44:18,367 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 45 states have (on average 1.288888888888889) internal successors, (58), 42 states have internal predecessors, (58), 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 36 [2024-10-11 01:44:18,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 01:44:18,368 INFO L225 Difference]: With dead ends: 66 [2024-10-11 01:44:18,368 INFO L226 Difference]: Without dead ends: 64 [2024-10-11 01:44:18,369 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 82 ConstructedPredicates, 36 IntricatePredicates, 0 DeprecatedPredicates, 325 ImplicationChecksByTransitivity, 9.9s TimeCoverageRelationStatistics Valid=223, Invalid=2077, Unknown=100, NotChecked=4572, Total=6972 [2024-10-11 01:44:18,370 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 6 mSDsluCounter, 256 mSDsCounter, 0 mSdLazyCounter, 285 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 276 SdHoareTripleChecker+Invalid, 1973 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 285 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1685 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 01:44:18,370 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 276 Invalid, 1973 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 285 Invalid, 0 Unknown, 1685 Unchecked, 0.2s Time] [2024-10-11 01:44:18,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2024-10-11 01:44:18,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2024-10-11 01:44:18,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 55 states have (on average 1.1454545454545455) internal successors, (63), 55 states have internal predecessors, (63), 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-10-11 01:44:18,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 73 transitions. [2024-10-11 01:44:18,392 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 73 transitions. Word has length 36 [2024-10-11 01:44:18,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 01:44:18,393 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 73 transitions. [2024-10-11 01:44:18,393 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 45 states have (on average 1.288888888888889) internal successors, (58), 42 states have internal predecessors, (58), 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-10-11 01:44:18,393 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 73 transitions. [2024-10-11 01:44:18,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-10-11 01:44:18,393 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 01:44:18,393 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 01:44:18,410 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-10-11 01:44:18,594 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,10 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 01:44:18,594 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 01:44:18,595 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 01:44:18,595 INFO L85 PathProgramCache]: Analyzing trace with hash -1687594025, now seen corresponding path program 2 times [2024-10-11 01:44:18,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 01:44:18,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [129883273] [2024-10-11 01:44:18,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 01:44:18,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 01:44:18,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:44:19,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 01:44:19,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:44:19,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 01:44:19,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:44:19,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 01:44:19,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:44:20,238 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 2 proven. 17 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-11 01:44:20,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 01:44:20,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [129883273] [2024-10-11 01:44:20,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [129883273] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 01:44:20,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [250203052] [2024-10-11 01:44:20,239 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-11 01:44:20,239 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 01:44:20,239 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 01:44:20,240 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 01:44:20,241 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-10-11 01:44:20,428 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-11 01:44:20,428 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 01:44:20,430 INFO L255 TraceCheckSpWp]: Trace formula consists of 396 conjuncts, 105 conjuncts are in the unsatisfiable core [2024-10-11 01:44:20,433 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 01:44:20,465 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-10-11 01:44:20,554 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-10-11 01:44:20,559 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-10-11 01:44:20,760 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-10-11 01:44:20,761 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 18 treesize of output 17 [2024-10-11 01:44:20,765 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-10-11 01:44:20,775 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-10-11 01:44:20,776 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 18 treesize of output 17 [2024-10-11 01:44:20,779 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-10-11 01:44:20,791 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-10-11 01:44:20,791 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-10-11 01:44:20,846 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2024-10-11 01:44:20,852 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 18 treesize of output 13 [2024-10-11 01:44:20,861 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-10-11 01:44:20,865 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 18 treesize of output 13 [2024-10-11 01:44:20,936 INFO L349 Elim1Store]: treesize reduction 53, result has 11.7 percent of original size [2024-10-11 01:44:20,936 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 116 treesize of output 89 [2024-10-11 01:44:20,947 INFO L349 Elim1Store]: treesize reduction 31, result has 26.2 percent of original size [2024-10-11 01:44:20,947 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 4 new quantified variables, introduced 1 case distinctions, treesize of input 91 treesize of output 79 [2024-10-11 01:44:21,177 INFO L349 Elim1Store]: treesize reduction 50, result has 2.0 percent of original size [2024-10-11 01:44:21,178 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 109 treesize of output 44 [2024-10-11 01:44:21,182 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2024-10-11 01:44:21,185 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-10-11 01:44:21,321 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8| Int)) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8|) 0) 0)) (exists ((|v_node_create_~temp~0#1.base_75| Int)) (and (= |c_#memory_$Pointer$#2.offset| (store |c_old(#memory_$Pointer$#2.offset)| |v_node_create_~temp~0#1.base_75| (select |c_#memory_$Pointer$#2.offset| |v_node_create_~temp~0#1.base_75|))) (= (select |c_old(#valid)| |v_node_create_~temp~0#1.base_75|) 0) (= (store |c_old(#memory_$Pointer$#2.base)| |v_node_create_~temp~0#1.base_75| (select |c_#memory_$Pointer$#2.base| |v_node_create_~temp~0#1.base_75|)) |c_#memory_$Pointer$#2.base|)))) is different from true [2024-10-11 01:44:21,336 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 01:44:21,343 INFO L349 Elim1Store]: treesize reduction 29, result has 14.7 percent of original size [2024-10-11 01:44:21,344 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 117 treesize of output 90 [2024-10-11 01:44:21,360 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2024-10-11 01:44:21,361 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-10-11 01:44:21,368 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 88 treesize of output 74 [2024-10-11 01:44:21,491 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-10-11 01:44:21,491 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-10-11 01:44:21,627 INFO L349 Elim1Store]: treesize reduction 50, result has 2.0 percent of original size [2024-10-11 01:44:21,627 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 96 treesize of output 39 [2024-10-11 01:44:21,631 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2024-10-11 01:44:21,668 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 9 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2024-10-11 01:44:21,669 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 01:44:22,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [250203052] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 01:44:22,020 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 01:44:22,020 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 23] total 48 [2024-10-11 01:44:22,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1289032793] [2024-10-11 01:44:22,020 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 01:44:22,020 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2024-10-11 01:44:22,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 01:44:22,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2024-10-11 01:44:22,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=2520, Unknown=1, NotChecked=100, Total=2756 [2024-10-11 01:44:22,022 INFO L87 Difference]: Start difference. First operand 64 states and 73 transitions. Second operand has 48 states, 40 states have (on average 1.475) internal successors, (59), 39 states have internal predecessors, (59), 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-10-11 01:44:24,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 01:44:24,218 INFO L93 Difference]: Finished difference Result 83 states and 97 transitions. [2024-10-11 01:44:24,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-10-11 01:44:24,219 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 40 states have (on average 1.475) internal successors, (59), 39 states have internal predecessors, (59), 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 36 [2024-10-11 01:44:24,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 01:44:24,219 INFO L225 Difference]: With dead ends: 83 [2024-10-11 01:44:24,219 INFO L226 Difference]: Without dead ends: 71 [2024-10-11 01:44:24,221 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 840 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=292, Invalid=5261, Unknown=1, NotChecked=146, Total=5700 [2024-10-11 01:44:24,221 INFO L432 NwaCegarLoop]: 12 mSDtfsCounter, 18 mSDsluCounter, 328 mSDsCounter, 0 mSdLazyCounter, 1203 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 340 SdHoareTripleChecker+Invalid, 1276 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 1203 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 63 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-11 01:44:24,221 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 340 Invalid, 1276 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 1203 Invalid, 0 Unknown, 63 Unchecked, 0.9s Time] [2024-10-11 01:44:24,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2024-10-11 01:44:24,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 64. [2024-10-11 01:44:24,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 55 states have (on average 1.1272727272727272) internal successors, (62), 55 states have internal predecessors, (62), 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-10-11 01:44:24,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 72 transitions. [2024-10-11 01:44:24,246 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 72 transitions. Word has length 36 [2024-10-11 01:44:24,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 01:44:24,246 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 72 transitions. [2024-10-11 01:44:24,246 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 40 states have (on average 1.475) internal successors, (59), 39 states have internal predecessors, (59), 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-10-11 01:44:24,246 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 72 transitions. [2024-10-11 01:44:24,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-10-11 01:44:24,247 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 01:44:24,247 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-11 01:44:24,262 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-10-11 01:44:24,447 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-10-11 01:44:24,448 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 01:44:24,448 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 01:44:24,448 INFO L85 PathProgramCache]: Analyzing trace with hash 1361646376, now seen corresponding path program 1 times [2024-10-11 01:44:24,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 01:44:24,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1332294787] [2024-10-11 01:44:24,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 01:44:24,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 01:44:24,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:44:25,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 01:44:25,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:44:25,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 01:44:25,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:44:25,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 01:44:25,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:44:25,675 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 9 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-11 01:44:25,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 01:44:25,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1332294787] [2024-10-11 01:44:25,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1332294787] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 01:44:25,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1670190800] [2024-10-11 01:44:25,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 01:44:25,675 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 01:44:25,675 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 01:44:25,676 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 01:44:25,678 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-10-11 01:44:26,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:44:26,420 INFO L255 TraceCheckSpWp]: Trace formula consists of 410 conjuncts, 126 conjuncts are in the unsatisfiable core [2024-10-11 01:44:26,423 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 01:44:26,449 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-10-11 01:44:26,591 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) (= |c_ULTIMATE.start_dll_create_#t~ret4#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_31| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_31| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_31| |c_ULTIMATE.start_dll_create_#t~ret4#1.base|) 0) (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_31| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_31| .cse0 (select |c_#valid| .cse0))))))) is different from false [2024-10-11 01:44:26,592 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) (= |c_ULTIMATE.start_dll_create_#t~ret4#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_31| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_31| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_31| |c_ULTIMATE.start_dll_create_#t~ret4#1.base|) 0) (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_31| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_31| .cse0 (select |c_#valid| .cse0))))))) is different from true [2024-10-11 01:44:26,601 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-10-11 01:44:26,605 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-10-11 01:44:26,614 WARN L851 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_$Pointer$#2.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) (= (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4) |c_ULTIMATE.start_dll_create_~head~0#1.base|) (exists ((|v_old(#valid)_AFTER_CALL_31| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_31| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_31| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1) (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_31| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_31| .cse0 (select |c_#valid| .cse0))))))) is different from false [2024-10-11 01:44:26,615 WARN L873 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_$Pointer$#2.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) (= (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4) |c_ULTIMATE.start_dll_create_~head~0#1.base|) (exists ((|v_old(#valid)_AFTER_CALL_31| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_31| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_31| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1) (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_31| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_31| .cse0 (select |c_#valid| .cse0))))))) is different from true [2024-10-11 01:44:26,629 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-10-11 01:44:26,630 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-10-11 01:44:26,638 INFO L349 Elim1Store]: treesize reduction 21, result has 38.2 percent of original size [2024-10-11 01:44:26,638 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-10-11 01:44:26,649 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.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| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (or (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4) 0) (= .cse0 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (exists ((|v_old(#valid)_AFTER_CALL_31| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_31| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_31| .cse0) 1) (= |c_#valid| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_31| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_31| .cse1 (select |c_#valid| .cse1)))))))) is different from false [2024-10-11 01:44:26,650 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.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| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (or (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4) 0) (= .cse0 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (exists ((|v_old(#valid)_AFTER_CALL_31| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_31| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_31| .cse0) 1) (= |c_#valid| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_31| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_31| .cse1 (select |c_#valid| .cse1)))))))) is different from true [2024-10-11 01:44:26,665 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4))) (and (or (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4) 0) (= .cse0 |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_31| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_31| .cse0) 1) (= |c_#valid| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_31| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_31| .cse1 (select |c_#valid| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_31| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 0))) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1))) is different from false [2024-10-11 01:44:26,667 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4))) (and (or (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4) 0) (= .cse0 |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_31| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_31| .cse0) 1) (= |c_#valid| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_31| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_31| .cse1 (select |c_#valid| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_31| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 0))) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1))) is different from true [2024-10-11 01:44:26,704 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| .cse0) 4))) (and (= |c_ULTIMATE.start_dll_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |c_#valid| .cse0) 1) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_31| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_31| .cse0) 0) (= |c_#valid| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_31| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_31| .cse1 (select |c_#valid| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_31| .cse2) 1))) (or (= .cse2 .cse0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse0) 4) 0)) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |c_ULTIMATE.start_dll_append_~head#1.offset| 0)))) is different from false [2024-10-11 01:44:26,705 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| .cse0) 4))) (and (= |c_ULTIMATE.start_dll_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |c_#valid| .cse0) 1) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_31| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_31| .cse0) 0) (= |c_#valid| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_31| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_31| .cse1 (select |c_#valid| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_31| .cse2) 1))) (or (= .cse2 .cse0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse0) 4) 0)) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |c_ULTIMATE.start_dll_append_~head#1.offset| 0)))) is different from true [2024-10-11 01:44:26,716 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 41 treesize of output 25 [2024-10-11 01:44:26,719 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-10-11 01:44:26,735 WARN L851 $PredicateComparison]: unable to prove that (and (= |c_#valid| |c_old(#valid)|) (exists ((|v_old(#valid)_AFTER_CALL_31| (Array Int Int)) (|v_#valid_BEFORE_CALL_24| (Array Int Int)) (v_arrayElimCell_112 Int) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_9| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_9|) 0))) (and (= (select |v_old(#valid)_AFTER_CALL_31| v_arrayElimCell_112) 1) (= (select |v_old(#valid)_AFTER_CALL_31| .cse0) 0) (= (select |v_#valid_BEFORE_CALL_24| .cse0) 1) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_31| |v_#valid_BEFORE_CALL_24|))) (store |v_old(#valid)_AFTER_CALL_31| .cse1 (select |v_#valid_BEFORE_CALL_24| .cse1))) |v_#valid_BEFORE_CALL_24|) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_9|) 0) 0)))) (= |c_#memory_$Pointer$#2.offset| |c_old(#memory_$Pointer$#2.offset)|) (= |c_old(#memory_$Pointer$#2.base)| |c_#memory_$Pointer$#2.base|)) is different from false [2024-10-11 01:44:26,737 WARN L873 $PredicateComparison]: unable to prove that (and (= |c_#valid| |c_old(#valid)|) (exists ((|v_old(#valid)_AFTER_CALL_31| (Array Int Int)) (|v_#valid_BEFORE_CALL_24| (Array Int Int)) (v_arrayElimCell_112 Int) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_9| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_9|) 0))) (and (= (select |v_old(#valid)_AFTER_CALL_31| v_arrayElimCell_112) 1) (= (select |v_old(#valid)_AFTER_CALL_31| .cse0) 0) (= (select |v_#valid_BEFORE_CALL_24| .cse0) 1) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_31| |v_#valid_BEFORE_CALL_24|))) (store |v_old(#valid)_AFTER_CALL_31| .cse1 (select |v_#valid_BEFORE_CALL_24| .cse1))) |v_#valid_BEFORE_CALL_24|) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_9|) 0) 0)))) (= |c_#memory_$Pointer$#2.offset| |c_old(#memory_$Pointer$#2.offset)|) (= |c_old(#memory_$Pointer$#2.base)| |c_#memory_$Pointer$#2.base|)) is different from true [2024-10-11 01:44:26,756 WARN L851 $PredicateComparison]: unable to prove that (and (exists ((|v_old(#valid)_AFTER_CALL_31| (Array Int Int)) (|v_#valid_BEFORE_CALL_24| (Array Int Int)) (v_arrayElimCell_112 Int) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_9| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_9|) 0))) (and (= (select |v_old(#valid)_AFTER_CALL_31| v_arrayElimCell_112) 1) (= (select |v_old(#valid)_AFTER_CALL_31| .cse0) 0) (= (select |v_#valid_BEFORE_CALL_24| .cse0) 1) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_31| |v_#valid_BEFORE_CALL_24|))) (store |v_old(#valid)_AFTER_CALL_31| .cse1 (select |v_#valid_BEFORE_CALL_24| .cse1))) |v_#valid_BEFORE_CALL_24|) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_9|) 0) 0)))) (not (= |c_node_create_~temp~0#1.base| 0)) (= |c_#memory_$Pointer$#2.offset| |c_old(#memory_$Pointer$#2.offset)|) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (= |c_old(#memory_$Pointer$#2.base)| |c_#memory_$Pointer$#2.base|)) is different from false [2024-10-11 01:44:26,757 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((|v_old(#valid)_AFTER_CALL_31| (Array Int Int)) (|v_#valid_BEFORE_CALL_24| (Array Int Int)) (v_arrayElimCell_112 Int) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_9| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_9|) 0))) (and (= (select |v_old(#valid)_AFTER_CALL_31| v_arrayElimCell_112) 1) (= (select |v_old(#valid)_AFTER_CALL_31| .cse0) 0) (= (select |v_#valid_BEFORE_CALL_24| .cse0) 1) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_31| |v_#valid_BEFORE_CALL_24|))) (store |v_old(#valid)_AFTER_CALL_31| .cse1 (select |v_#valid_BEFORE_CALL_24| .cse1))) |v_#valid_BEFORE_CALL_24|) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_9|) 0) 0)))) (not (= |c_node_create_~temp~0#1.base| 0)) (= |c_#memory_$Pointer$#2.offset| |c_old(#memory_$Pointer$#2.offset)|) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (= |c_old(#memory_$Pointer$#2.base)| |c_#memory_$Pointer$#2.base|)) is different from true [2024-10-11 01:44:26,775 WARN L851 $PredicateComparison]: unable to prove that (and (= (select |c_old(#valid)| |c_node_create_#res#1.base|) 0) (= (store |c_old(#memory_$Pointer$#2.offset)| |c_node_create_#res#1.base| (select |c_#memory_$Pointer$#2.offset| |c_node_create_#res#1.base|)) |c_#memory_$Pointer$#2.offset|) (exists ((|v_old(#valid)_AFTER_CALL_31| (Array Int Int)) (|v_#valid_BEFORE_CALL_24| (Array Int Int)) (v_arrayElimCell_112 Int) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_9| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_9|) 0))) (and (= (select |v_old(#valid)_AFTER_CALL_31| v_arrayElimCell_112) 1) (= (select |v_old(#valid)_AFTER_CALL_31| .cse0) 0) (= (select |v_#valid_BEFORE_CALL_24| .cse0) 1) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_31| |v_#valid_BEFORE_CALL_24|))) (store |v_old(#valid)_AFTER_CALL_31| .cse1 (select |v_#valid_BEFORE_CALL_24| .cse1))) |v_#valid_BEFORE_CALL_24|) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_9|) 0) 0)))) (not (= |c_node_create_#res#1.base| 0)) (= (store |c_old(#memory_$Pointer$#2.base)| |c_node_create_#res#1.base| (select |c_#memory_$Pointer$#2.base| |c_node_create_#res#1.base|)) |c_#memory_$Pointer$#2.base|)) is different from false [2024-10-11 01:44:26,777 WARN L873 $PredicateComparison]: unable to prove that (and (= (select |c_old(#valid)| |c_node_create_#res#1.base|) 0) (= (store |c_old(#memory_$Pointer$#2.offset)| |c_node_create_#res#1.base| (select |c_#memory_$Pointer$#2.offset| |c_node_create_#res#1.base|)) |c_#memory_$Pointer$#2.offset|) (exists ((|v_old(#valid)_AFTER_CALL_31| (Array Int Int)) (|v_#valid_BEFORE_CALL_24| (Array Int Int)) (v_arrayElimCell_112 Int) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_9| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_9|) 0))) (and (= (select |v_old(#valid)_AFTER_CALL_31| v_arrayElimCell_112) 1) (= (select |v_old(#valid)_AFTER_CALL_31| .cse0) 0) (= (select |v_#valid_BEFORE_CALL_24| .cse0) 1) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_31| |v_#valid_BEFORE_CALL_24|))) (store |v_old(#valid)_AFTER_CALL_31| .cse1 (select |v_#valid_BEFORE_CALL_24| .cse1))) |v_#valid_BEFORE_CALL_24|) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_9|) 0) 0)))) (not (= |c_node_create_#res#1.base| 0)) (= (store |c_old(#memory_$Pointer$#2.base)| |c_node_create_#res#1.base| (select |c_#memory_$Pointer$#2.base| |c_node_create_#res#1.base|)) |c_#memory_$Pointer$#2.base|)) is different from true [2024-10-11 01:44:26,803 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 01:44:26,804 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-10-11 01:44:26,815 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2024-10-11 01:44:26,815 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 36 treesize of output 39 [2024-10-11 01:44:26,840 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| .cse0) 4))) (and (= |c_ULTIMATE.start_dll_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_old(#valid)_AFTER_CALL_31| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_32| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_32| .cse0) 1) (= |v_old(#valid)_AFTER_CALL_32| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_31| |v_old(#valid)_AFTER_CALL_32|))) (store |v_old(#valid)_AFTER_CALL_31| .cse1 (select |v_old(#valid)_AFTER_CALL_32| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_31| .cse0) 0) (= (select |v_old(#valid)_AFTER_CALL_32| |c_ULTIMATE.start_dll_append_#t~ret7#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_31| .cse2) 1))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (not (= |c_ULTIMATE.start_dll_append_#t~ret7#1.base| 0)) (or (= |c_ULTIMATE.start_dll_append_#t~ret7#1.base| .cse0) (= .cse2 .cse0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse0) 4) 0)) (exists ((|v_old(#valid)_AFTER_CALL_33| (Array Int Int)) (v_arrayElimCell_112 Int) (|v_#valid_BEFORE_CALL_24| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_9| Int)) (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_9|) 0))) (and (= (select |v_#valid_BEFORE_CALL_24| .cse3) 1) (= (select |v_old(#valid)_AFTER_CALL_33| v_arrayElimCell_112) 1) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_9|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_33| .cse3) 0) (= |v_#valid_BEFORE_CALL_24| (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_33| |v_#valid_BEFORE_CALL_24|))) (store |v_old(#valid)_AFTER_CALL_33| .cse4 (select |v_#valid_BEFORE_CALL_24| .cse4))))))) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |c_ULTIMATE.start_dll_append_~head#1.offset| 0)))) is different from false [2024-10-11 01:44:26,843 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| .cse0) 4))) (and (= |c_ULTIMATE.start_dll_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_old(#valid)_AFTER_CALL_31| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_32| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_32| .cse0) 1) (= |v_old(#valid)_AFTER_CALL_32| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_31| |v_old(#valid)_AFTER_CALL_32|))) (store |v_old(#valid)_AFTER_CALL_31| .cse1 (select |v_old(#valid)_AFTER_CALL_32| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_31| .cse0) 0) (= (select |v_old(#valid)_AFTER_CALL_32| |c_ULTIMATE.start_dll_append_#t~ret7#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_31| .cse2) 1))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (not (= |c_ULTIMATE.start_dll_append_#t~ret7#1.base| 0)) (or (= |c_ULTIMATE.start_dll_append_#t~ret7#1.base| .cse0) (= .cse2 .cse0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse0) 4) 0)) (exists ((|v_old(#valid)_AFTER_CALL_33| (Array Int Int)) (v_arrayElimCell_112 Int) (|v_#valid_BEFORE_CALL_24| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_9| Int)) (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_9|) 0))) (and (= (select |v_#valid_BEFORE_CALL_24| .cse3) 1) (= (select |v_old(#valid)_AFTER_CALL_33| v_arrayElimCell_112) 1) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_9|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_33| .cse3) 0) (= |v_#valid_BEFORE_CALL_24| (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_33| |v_#valid_BEFORE_CALL_24|))) (store |v_old(#valid)_AFTER_CALL_33| .cse4 (select |v_#valid_BEFORE_CALL_24| .cse4))))))) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |c_ULTIMATE.start_dll_append_~head#1.offset| 0)))) is different from true [2024-10-11 01:44:26,907 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| .cse0) 4))) (and (= |c_ULTIMATE.start_dll_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| 0)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_31| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_32| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_32| .cse0) 1) (= |v_old(#valid)_AFTER_CALL_32| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_31| |v_old(#valid)_AFTER_CALL_32|))) (store |v_old(#valid)_AFTER_CALL_31| .cse1 (select |v_old(#valid)_AFTER_CALL_32| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_31| .cse0) 0) (= (select |v_old(#valid)_AFTER_CALL_31| .cse2) 1) (= (select |v_old(#valid)_AFTER_CALL_32| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) 0))) (exists ((|v_old(#valid)_AFTER_CALL_33| (Array Int Int)) (v_arrayElimCell_112 Int) (|v_#valid_BEFORE_CALL_24| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_9| Int)) (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_9|) 0))) (and (= (select |v_#valid_BEFORE_CALL_24| .cse3) 1) (= (select |v_old(#valid)_AFTER_CALL_33| v_arrayElimCell_112) 1) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_9|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_33| .cse3) 0) (= |v_#valid_BEFORE_CALL_24| (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_33| |v_#valid_BEFORE_CALL_24|))) (store |v_old(#valid)_AFTER_CALL_33| .cse4 (select |v_#valid_BEFORE_CALL_24| .cse4))))))) (or (= .cse2 .cse0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse0) 4) 0) (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| .cse0)) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |c_ULTIMATE.start_dll_append_~head#1.offset| 0)))) is different from false [2024-10-11 01:44:26,909 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| .cse0) 4))) (and (= |c_ULTIMATE.start_dll_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| 0)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_31| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_32| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_32| .cse0) 1) (= |v_old(#valid)_AFTER_CALL_32| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_31| |v_old(#valid)_AFTER_CALL_32|))) (store |v_old(#valid)_AFTER_CALL_31| .cse1 (select |v_old(#valid)_AFTER_CALL_32| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_31| .cse0) 0) (= (select |v_old(#valid)_AFTER_CALL_31| .cse2) 1) (= (select |v_old(#valid)_AFTER_CALL_32| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) 0))) (exists ((|v_old(#valid)_AFTER_CALL_33| (Array Int Int)) (v_arrayElimCell_112 Int) (|v_#valid_BEFORE_CALL_24| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_9| Int)) (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_9|) 0))) (and (= (select |v_#valid_BEFORE_CALL_24| .cse3) 1) (= (select |v_old(#valid)_AFTER_CALL_33| v_arrayElimCell_112) 1) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_9|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_33| .cse3) 0) (= |v_#valid_BEFORE_CALL_24| (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_33| |v_#valid_BEFORE_CALL_24|))) (store |v_old(#valid)_AFTER_CALL_33| .cse4 (select |v_#valid_BEFORE_CALL_24| .cse4))))))) (or (= .cse2 .cse0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse0) 4) 0) (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| .cse0)) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |c_ULTIMATE.start_dll_append_~head#1.offset| 0)))) is different from true [2024-10-11 01:44:26,958 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| .cse0) 4))) (and (not (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| 0)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse0) (exists ((|v_old(#valid)_AFTER_CALL_31| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_32| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_32| .cse0) 1) (= |v_old(#valid)_AFTER_CALL_32| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_31| |v_old(#valid)_AFTER_CALL_32|))) (store |v_old(#valid)_AFTER_CALL_31| .cse1 (select |v_old(#valid)_AFTER_CALL_32| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_31| .cse0) 0) (= (select |v_old(#valid)_AFTER_CALL_31| .cse2) 1) (= (select |v_old(#valid)_AFTER_CALL_32| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) 0))) (exists ((|v_old(#valid)_AFTER_CALL_33| (Array Int Int)) (v_arrayElimCell_112 Int) (|v_#valid_BEFORE_CALL_24| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_9| Int)) (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_9|) 0))) (and (= (select |v_#valid_BEFORE_CALL_24| .cse3) 1) (= (select |v_old(#valid)_AFTER_CALL_33| v_arrayElimCell_112) 1) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_9|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_33| .cse3) 0) (= |v_#valid_BEFORE_CALL_24| (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_33| |v_#valid_BEFORE_CALL_24|))) (store |v_old(#valid)_AFTER_CALL_33| .cse4 (select |v_#valid_BEFORE_CALL_24| .cse4))))))) (= |c_ULTIMATE.start_dll_append_~last~0#1.offset| 0) (or (= .cse2 .cse0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse0) 4) 0) (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| .cse0)) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0)))) is different from false [2024-10-11 01:44:26,960 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| .cse0) 4))) (and (not (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| 0)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse0) (exists ((|v_old(#valid)_AFTER_CALL_31| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_32| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_32| .cse0) 1) (= |v_old(#valid)_AFTER_CALL_32| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_31| |v_old(#valid)_AFTER_CALL_32|))) (store |v_old(#valid)_AFTER_CALL_31| .cse1 (select |v_old(#valid)_AFTER_CALL_32| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_31| .cse0) 0) (= (select |v_old(#valid)_AFTER_CALL_31| .cse2) 1) (= (select |v_old(#valid)_AFTER_CALL_32| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) 0))) (exists ((|v_old(#valid)_AFTER_CALL_33| (Array Int Int)) (v_arrayElimCell_112 Int) (|v_#valid_BEFORE_CALL_24| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_9| Int)) (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_9|) 0))) (and (= (select |v_#valid_BEFORE_CALL_24| .cse3) 1) (= (select |v_old(#valid)_AFTER_CALL_33| v_arrayElimCell_112) 1) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_9|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_33| .cse3) 0) (= |v_#valid_BEFORE_CALL_24| (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_33| |v_#valid_BEFORE_CALL_24|))) (store |v_old(#valid)_AFTER_CALL_33| .cse4 (select |v_#valid_BEFORE_CALL_24| .cse4))))))) (= |c_ULTIMATE.start_dll_append_~last~0#1.offset| 0) (or (= .cse2 .cse0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse0) 4) 0) (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| .cse0)) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0)))) is different from true [2024-10-11 01:44:27,039 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| .cse0) 4)) (.cse5 (select (select |c_#memory_$Pointer$#2.offset| .cse0) 4))) (and (not (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| 0)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_31| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_32| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_32| .cse0) 1) (= |v_old(#valid)_AFTER_CALL_32| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_31| |v_old(#valid)_AFTER_CALL_32|))) (store |v_old(#valid)_AFTER_CALL_31| .cse1 (select |v_old(#valid)_AFTER_CALL_32| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_31| .cse0) 0) (= (select |v_old(#valid)_AFTER_CALL_31| .cse2) 1) (= (select |v_old(#valid)_AFTER_CALL_32| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) 0))) (exists ((|v_old(#valid)_AFTER_CALL_33| (Array Int Int)) (v_arrayElimCell_112 Int) (|v_#valid_BEFORE_CALL_24| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_9| Int)) (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_9|) 0))) (and (= (select |v_#valid_BEFORE_CALL_24| .cse3) 1) (= (select |v_old(#valid)_AFTER_CALL_33| v_arrayElimCell_112) 1) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_9|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_33| .cse3) 0) (= |v_#valid_BEFORE_CALL_24| (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_33| |v_#valid_BEFORE_CALL_24|))) (store |v_old(#valid)_AFTER_CALL_33| .cse4 (select |v_#valid_BEFORE_CALL_24| .cse4))))))) (= .cse5 |c_ULTIMATE.start_dll_append_~last~0#1.offset|) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse2) (or (= .cse2 .cse0) (= .cse5 0) (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| .cse0)) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0)))) is different from false [2024-10-11 01:44:27,042 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| .cse0) 4)) (.cse5 (select (select |c_#memory_$Pointer$#2.offset| .cse0) 4))) (and (not (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| 0)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_31| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_32| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_32| .cse0) 1) (= |v_old(#valid)_AFTER_CALL_32| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_31| |v_old(#valid)_AFTER_CALL_32|))) (store |v_old(#valid)_AFTER_CALL_31| .cse1 (select |v_old(#valid)_AFTER_CALL_32| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_31| .cse0) 0) (= (select |v_old(#valid)_AFTER_CALL_31| .cse2) 1) (= (select |v_old(#valid)_AFTER_CALL_32| |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) 0))) (exists ((|v_old(#valid)_AFTER_CALL_33| (Array Int Int)) (v_arrayElimCell_112 Int) (|v_#valid_BEFORE_CALL_24| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_9| Int)) (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_9|) 0))) (and (= (select |v_#valid_BEFORE_CALL_24| .cse3) 1) (= (select |v_old(#valid)_AFTER_CALL_33| v_arrayElimCell_112) 1) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_9|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_33| .cse3) 0) (= |v_#valid_BEFORE_CALL_24| (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_33| |v_#valid_BEFORE_CALL_24|))) (store |v_old(#valid)_AFTER_CALL_33| .cse4 (select |v_#valid_BEFORE_CALL_24| .cse4))))))) (= .cse5 |c_ULTIMATE.start_dll_append_~last~0#1.offset|) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse2) (or (= .cse2 .cse0) (= .cse5 0) (= |c_ULTIMATE.start_dll_append_~new_last~0#1.base| .cse0)) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0)))) is different from true [2024-10-11 01:44:27,138 INFO L349 Elim1Store]: treesize reduction 53, result has 17.2 percent of original size [2024-10-11 01:44:27,138 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 131 treesize of output 88 [2024-10-11 01:44:27,156 INFO L349 Elim1Store]: treesize reduction 80, result has 15.8 percent of original size [2024-10-11 01:44:27,156 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 282 treesize of output 193 [2024-10-11 01:44:27,162 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 01:44:27,169 INFO L349 Elim1Store]: treesize reduction 89, result has 9.2 percent of original size [2024-10-11 01:44:27,169 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 217 treesize of output 165 [2024-10-11 01:44:27,191 INFO L349 Elim1Store]: treesize reduction 39, result has 2.5 percent of original size [2024-10-11 01:44:27,192 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 114 treesize of output 68 [2024-10-11 01:44:27,202 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 54 treesize of output 42 [2024-10-11 01:44:27,205 WARN L214 Elim1Store]: Array PQE input equivalent to false [2024-10-11 01:44:27,224 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| .cse0) 4)) (.cse4 (select (select |c_#memory_$Pointer$#2.offset| .cse0) 4))) (let ((.cse3 (select (select |c_#memory_$Pointer$#2.base| .cse2) (+ .cse4 4)))) (and (exists ((|v_old(#valid)_AFTER_CALL_31| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_32| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_32| .cse0) 1) (= |v_old(#valid)_AFTER_CALL_32| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_31| |v_old(#valid)_AFTER_CALL_32|))) (store |v_old(#valid)_AFTER_CALL_31| .cse1 (select |v_old(#valid)_AFTER_CALL_32| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_31| .cse0) 0) (= (select |v_old(#valid)_AFTER_CALL_31| .cse2) 1) (= (select |v_old(#valid)_AFTER_CALL_32| .cse3) 0))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (not (= .cse3 .cse2)) (or (= .cse3 .cse0) (= .cse2 .cse0) (= .cse4 0)) (exists ((|v_old(#valid)_AFTER_CALL_33| (Array Int Int)) (v_arrayElimCell_112 Int) (|v_#valid_BEFORE_CALL_24| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_9| Int)) (let ((.cse5 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_9|) 0))) (and (= (select |v_#valid_BEFORE_CALL_24| .cse5) 1) (= (select |v_old(#valid)_AFTER_CALL_33| v_arrayElimCell_112) 1) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_9|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_33| .cse5) 0) (= |v_#valid_BEFORE_CALL_24| (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_33| |v_#valid_BEFORE_CALL_24|))) (store |v_old(#valid)_AFTER_CALL_33| .cse6 (select |v_#valid_BEFORE_CALL_24| .cse6))))))) (not (= .cse3 0)) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0))))) is different from false [2024-10-11 01:44:27,227 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| .cse0) 4)) (.cse4 (select (select |c_#memory_$Pointer$#2.offset| .cse0) 4))) (let ((.cse3 (select (select |c_#memory_$Pointer$#2.base| .cse2) (+ .cse4 4)))) (and (exists ((|v_old(#valid)_AFTER_CALL_31| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_32| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_32| .cse0) 1) (= |v_old(#valid)_AFTER_CALL_32| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_31| |v_old(#valid)_AFTER_CALL_32|))) (store |v_old(#valid)_AFTER_CALL_31| .cse1 (select |v_old(#valid)_AFTER_CALL_32| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_31| .cse0) 0) (= (select |v_old(#valid)_AFTER_CALL_31| .cse2) 1) (= (select |v_old(#valid)_AFTER_CALL_32| .cse3) 0))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (not (= .cse3 .cse2)) (or (= .cse3 .cse0) (= .cse2 .cse0) (= .cse4 0)) (exists ((|v_old(#valid)_AFTER_CALL_33| (Array Int Int)) (v_arrayElimCell_112 Int) (|v_#valid_BEFORE_CALL_24| (Array Int Int)) (|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_9| Int)) (let ((.cse5 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_9|) 0))) (and (= (select |v_#valid_BEFORE_CALL_24| .cse5) 1) (= (select |v_old(#valid)_AFTER_CALL_33| v_arrayElimCell_112) 1) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_9|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_33| .cse5) 0) (= |v_#valid_BEFORE_CALL_24| (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_33| |v_#valid_BEFORE_CALL_24|))) (store |v_old(#valid)_AFTER_CALL_33| .cse6 (select |v_#valid_BEFORE_CALL_24| .cse6))))))) (not (= .cse3 0)) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0))))) is different from true [2024-10-11 01:44:27,274 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 01:44:27,274 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 200 treesize of output 132 [2024-10-11 01:44:27,286 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-10-11 01:44:27,286 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-10-11 01:44:27,310 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~ptr~0#1.base|) 4)) (.cse3 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~ptr~0#1.base|) 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| .cse1) (+ .cse3 4)))) (and (not (= .cse0 .cse1)) (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_31| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_32| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_32| .cse0) 0) (= (select |v_old(#valid)_AFTER_CALL_32| |c_ULTIMATE.start_main_~ptr~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_31| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_31| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= |v_old(#valid)_AFTER_CALL_32| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_31| |v_old(#valid)_AFTER_CALL_32|))) (store |v_old(#valid)_AFTER_CALL_31| .cse2 (select |v_old(#valid)_AFTER_CALL_32| .cse2)))))) (not (= .cse0 0)) (or (= .cse0 |c_ULTIMATE.start_main_~ptr~0#1.base|) (= .cse3 0) (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse1))))) is different from false [2024-10-11 01:44:27,311 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~ptr~0#1.base|) 4)) (.cse3 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~ptr~0#1.base|) 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| .cse1) (+ .cse3 4)))) (and (not (= .cse0 .cse1)) (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_31| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_32| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_32| .cse0) 0) (= (select |v_old(#valid)_AFTER_CALL_32| |c_ULTIMATE.start_main_~ptr~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_31| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_31| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= |v_old(#valid)_AFTER_CALL_32| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_31| |v_old(#valid)_AFTER_CALL_32|))) (store |v_old(#valid)_AFTER_CALL_31| .cse2 (select |v_old(#valid)_AFTER_CALL_32| .cse2)))))) (not (= .cse0 0)) (or (= .cse0 |c_ULTIMATE.start_main_~ptr~0#1.base|) (= .cse3 0) (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse1))))) is different from true [2024-10-11 01:44:27,349 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 99 treesize of output 75 [2024-10-11 01:44:27,395 WARN L851 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~ptr~0#1.base_28| Int) (|v_old(#valid)_AFTER_CALL_31| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_32| (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_main_~ptr~0#1.base_28|) 4))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| .cse0) 4))) (and (= (select |v_old(#valid)_AFTER_CALL_31| |v_ULTIMATE.start_main_~ptr~0#1.base_28|) 0) (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse0) (= (select |v_old(#valid)_AFTER_CALL_32| .cse1) 0) (not (= .cse1 0)) (= (select |v_old(#valid)_AFTER_CALL_31| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_32| |v_ULTIMATE.start_main_~ptr~0#1.base_28|) 1) (= |v_old(#valid)_AFTER_CALL_32| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_31| |v_old(#valid)_AFTER_CALL_32|))) (store |v_old(#valid)_AFTER_CALL_31| .cse2 (select |v_old(#valid)_AFTER_CALL_32| .cse2)))))))) (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0)) is different from false [2024-10-11 01:44:27,397 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~ptr~0#1.base_28| Int) (|v_old(#valid)_AFTER_CALL_31| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_32| (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_main_~ptr~0#1.base_28|) 4))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| .cse0) 4))) (and (= (select |v_old(#valid)_AFTER_CALL_31| |v_ULTIMATE.start_main_~ptr~0#1.base_28|) 0) (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse0) (= (select |v_old(#valid)_AFTER_CALL_32| .cse1) 0) (not (= .cse1 0)) (= (select |v_old(#valid)_AFTER_CALL_31| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_32| |v_ULTIMATE.start_main_~ptr~0#1.base_28|) 1) (= |v_old(#valid)_AFTER_CALL_32| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_31| |v_old(#valid)_AFTER_CALL_32|))) (store |v_old(#valid)_AFTER_CALL_31| .cse2 (select |v_old(#valid)_AFTER_CALL_32| .cse2)))))))) (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0)) is different from true [2024-10-11 01:44:27,421 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-10-11 01:44:27,421 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 46 treesize of output 21 [2024-10-11 01:44:27,434 WARN L851 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimIndex_21 Int) (|v_ULTIMATE.start_main_~ptr~0#1.base_28| Int) (|v_old(#valid)_AFTER_CALL_31| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_32| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_31| v_arrayElimIndex_21) 1) (= (select |v_old(#valid)_AFTER_CALL_31| |v_ULTIMATE.start_main_~ptr~0#1.base_28|) 0) (= (select |v_old(#valid)_AFTER_CALL_32| |v_ULTIMATE.start_main_~ptr~0#1.base_28|) 1) (= |v_old(#valid)_AFTER_CALL_32| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_31| |v_old(#valid)_AFTER_CALL_32|))) (store |v_old(#valid)_AFTER_CALL_31| .cse0 (select |v_old(#valid)_AFTER_CALL_32| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_32| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0))) (not (= |c_ULTIMATE.start_main_~ptr~0#1.base| 0))) is different from false [2024-10-11 01:44:27,436 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimIndex_21 Int) (|v_ULTIMATE.start_main_~ptr~0#1.base_28| Int) (|v_old(#valid)_AFTER_CALL_31| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_32| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_31| v_arrayElimIndex_21) 1) (= (select |v_old(#valid)_AFTER_CALL_31| |v_ULTIMATE.start_main_~ptr~0#1.base_28|) 0) (= (select |v_old(#valid)_AFTER_CALL_32| |v_ULTIMATE.start_main_~ptr~0#1.base_28|) 1) (= |v_old(#valid)_AFTER_CALL_32| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_31| |v_old(#valid)_AFTER_CALL_32|))) (store |v_old(#valid)_AFTER_CALL_31| .cse0 (select |v_old(#valid)_AFTER_CALL_32| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_32| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0))) (not (= |c_ULTIMATE.start_main_~ptr~0#1.base| 0))) is different from true [2024-10-11 01:44:27,436 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 16 not checked. [2024-10-11 01:44:27,436 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 01:44:27,578 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2698 (Array Int Int)) (v_ArrVal_2696 (Array Int Int)) (v_ArrVal_2695 (Array Int Int))) (not (= (let ((.cse4 (+ |c_ULTIMATE.start_dll_append_~last~0#1.offset| 4))) (let ((.cse3 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_append_~last~0#1.base|) .cse4)) (.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2 (+ (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (select (let ((.cse0 (store (store |c_#memory_$Pointer$#2.base| .cse3 (store (select |c_#memory_$Pointer$#2.base| .cse3) (+ (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base|) .cse4) 4) |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_2696))) (select .cse0 (select (select .cse0 .cse1) .cse2))) (+ (select (select (store (store |c_#memory_$Pointer$#2.offset| .cse3 v_ArrVal_2698) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_2695) .cse1) .cse2) 4)))) 0))) is different from false [2024-10-11 01:44:27,587 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2698 (Array Int Int)) (v_ArrVal_2696 (Array Int Int)) (v_ArrVal_2695 (Array Int Int))) (not (= (let ((.cse4 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse5 (+ (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 4))) (let ((.cse3 (select (select |c_#memory_$Pointer$#2.base| .cse4) .cse5)) (.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2 (+ (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (select (let ((.cse0 (store (store |c_#memory_$Pointer$#2.base| .cse3 (store (select |c_#memory_$Pointer$#2.base| .cse3) (+ (select (select |c_#memory_$Pointer$#2.offset| .cse4) .cse5) 4) |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_2696))) (select .cse0 (select (select .cse0 .cse1) .cse2))) (+ 4 (select (select (store (store |c_#memory_$Pointer$#2.offset| .cse3 v_ArrVal_2698) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_2695) .cse1) .cse2))))) 0))) is different from false [2024-10-11 01:44:27,593 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2698 (Array Int Int)) (v_ArrVal_2696 (Array Int Int)) (v_ArrVal_2695 (Array Int Int))) (not (= (let ((.cse4 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse5 (+ (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 4))) (let ((.cse3 (select (select |c_#memory_$Pointer$#2.base| .cse4) .cse5)) (.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2 (+ (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (select (let ((.cse0 (store (store |c_#memory_$Pointer$#2.base| .cse3 (store (select |c_#memory_$Pointer$#2.base| .cse3) (+ (select (select |c_#memory_$Pointer$#2.offset| .cse4) .cse5) 4) |c_ULTIMATE.start_dll_append_#t~ret7#1.base|)) |c_ULTIMATE.start_dll_append_#t~ret7#1.base| v_ArrVal_2696))) (select .cse0 (select (select .cse0 .cse1) .cse2))) (+ (select (select (store (store |c_#memory_$Pointer$#2.offset| .cse3 v_ArrVal_2698) |c_ULTIMATE.start_dll_append_#t~ret7#1.base| v_ArrVal_2695) .cse1) .cse2) 4)))) 0))) is different from false